TSTP Solution File: SET149-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET149-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:53:25 EDT 2024
% Result : Unsatisfiable 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 28 ( 7 unt; 4 nHn; 21 RR)
% Number of literals : 56 ( 7 equ; 27 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_corollary_to_idempotency_of_intersection_1,negated_conjecture,
intersection(x,intersection(x,y)) != intersection(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_idempotency_of_intersection_1) ).
cnf(c_0_7,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_8,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_9,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_7 ).
cnf(c_0_10,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_8 ).
cnf(c_0_11,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_12,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_13,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_15,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_11 ).
cnf(c_0_16,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_12 ).
cnf(c_0_17,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_18,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
intersection(x,intersection(x,y)) != intersection(x,y),
inference(fof_simplification,[status(thm)],[prove_corollary_to_idempotency_of_intersection_1]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_17 ).
cnf(c_0_23,plain,
subclass(intersection(X1,X2),intersection(X1,intersection(X1,X2))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_9,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
intersection(x,intersection(x,y)) != intersection(x,y),
c_0_21 ).
cnf(c_0_26,plain,
intersection(X1,intersection(X1,X2)) = intersection(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET149-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.09/0.31 % Computer : n009.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Mon May 20 11:14:53 EDT 2024
% 0.09/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.47 # Version: 3.1.0
% 0.15/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7406 completed with status 0
% 0.15/0.47 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.47 # No SInE strategy applied
% 0.15/0.47 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.15/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 308s (1) cores
% 0.15/0.47 # Starting sh5l with 304s (1) cores
% 0.15/0.47 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.47 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7416 completed with status 0
% 0.15/0.47 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.47 # No SInE strategy applied
% 0.15/0.47 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.15/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.47 # Preprocessing time : 0.003 s
% 0.15/0.47 # Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 # Proof found!
% 0.15/0.47 # SZS status Unsatisfiable
% 0.15/0.47 # SZS output start CNFRefutation
% See solution above
% 0.15/0.47 # Parsed axioms : 113
% 0.15/0.47 # Removed by relevancy pruning/SinE : 0
% 0.15/0.47 # Initial clauses : 113
% 0.15/0.47 # Removed in clause preprocessing : 17
% 0.15/0.47 # Initial clauses in saturation : 96
% 0.15/0.47 # Processed clauses : 498
% 0.15/0.47 # ...of these trivial : 8
% 0.15/0.47 # ...subsumed : 130
% 0.15/0.47 # ...remaining for further processing : 360
% 0.15/0.47 # Other redundant clauses eliminated : 6
% 0.15/0.47 # Clauses deleted for lack of memory : 0
% 0.15/0.47 # Backward-subsumed : 4
% 0.15/0.47 # Backward-rewritten : 27
% 0.15/0.47 # Generated clauses : 1119
% 0.15/0.47 # ...of the previous two non-redundant : 920
% 0.15/0.47 # ...aggressively subsumed : 0
% 0.15/0.47 # Contextual simplify-reflections : 2
% 0.15/0.47 # Paramodulations : 1111
% 0.15/0.47 # Factorizations : 2
% 0.15/0.47 # NegExts : 0
% 0.15/0.47 # Equation resolutions : 6
% 0.15/0.47 # Disequality decompositions : 0
% 0.15/0.47 # Total rewrite steps : 316
% 0.15/0.47 # ...of those cached : 231
% 0.15/0.47 # Propositional unsat checks : 0
% 0.15/0.47 # Propositional check models : 0
% 0.15/0.47 # Propositional check unsatisfiable : 0
% 0.15/0.47 # Propositional clauses : 0
% 0.15/0.47 # Propositional clauses after purity: 0
% 0.15/0.47 # Propositional unsat core size : 0
% 0.15/0.47 # Propositional preprocessing time : 0.000
% 0.15/0.47 # Propositional encoding time : 0.000
% 0.15/0.47 # Propositional solver time : 0.000
% 0.15/0.47 # Success case prop preproc time : 0.000
% 0.15/0.47 # Success case prop encoding time : 0.000
% 0.15/0.47 # Success case prop solver time : 0.000
% 0.15/0.47 # Current number of processed clauses : 230
% 0.15/0.47 # Positive orientable unit clauses : 46
% 0.15/0.47 # Positive unorientable unit clauses: 1
% 0.15/0.47 # Negative unit clauses : 2
% 0.15/0.47 # Non-unit-clauses : 181
% 0.15/0.47 # Current number of unprocessed clauses: 576
% 0.15/0.47 # ...number of literals in the above : 1626
% 0.15/0.47 # Current number of archived formulas : 0
% 0.15/0.47 # Current number of archived clauses : 143
% 0.15/0.47 # Clause-clause subsumption calls (NU) : 7018
% 0.15/0.47 # Rec. Clause-clause subsumption calls : 3936
% 0.15/0.47 # Non-unit clause-clause subsumptions : 110
% 0.15/0.47 # Unit Clause-clause subsumption calls : 404
% 0.15/0.47 # Rewrite failures with RHS unbound : 0
% 0.15/0.47 # BW rewrite match attempts : 62
% 0.15/0.47 # BW rewrite match successes : 13
% 0.15/0.47 # Condensation attempts : 0
% 0.15/0.47 # Condensation successes : 0
% 0.15/0.47 # Termbank termtop insertions : 32555
% 0.15/0.47 # Search garbage collected termcells : 185
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.042 s
% 0.15/0.47 # System time : 0.005 s
% 0.15/0.47 # Total time : 0.047 s
% 0.15/0.47 # Maximum resident set size: 1992 pages
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.208 s
% 0.15/0.47 # System time : 0.015 s
% 0.15/0.47 # Total time : 0.223 s
% 0.15/0.47 # Maximum resident set size: 1796 pages
% 0.15/0.47 % E---3.1 exiting
% 0.15/0.47 % E exiting
%------------------------------------------------------------------------------