TSTP Solution File: SET124-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET124-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:19 EDT 2024
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 17 unt; 3 nHn; 16 RR)
% Number of literals : 44 ( 7 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_set_builder_alternate_defn2_2,negated_conjecture,
~ member(x,set_builder(x,z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_set_builder_alternate_defn2_2) ).
cnf(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_of_set_builder) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(prove_set_builder_alternate_defn2_1,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_set_builder_alternate_defn2_1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(c_0_9,negated_conjecture,
~ member(x,set_builder(x,z)),
inference(fof_simplification,[status(thm)],[prove_set_builder_alternate_defn2_2]) ).
cnf(c_0_10,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_11,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_12,negated_conjecture,
~ member(x,set_builder(x,z)),
c_0_9 ).
cnf(c_0_13,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_15,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_16,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_17,negated_conjecture,
~ member(x,complement(intersection(complement(unordered_pair(x,x)),complement(z)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
member(x,universal_class),
prove_set_builder_alternate_defn2_1 ).
cnf(c_0_20,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_21,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
member(x,intersection(complement(unordered_pair(x,x)),complement(z))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
member(x,complement(unordered_pair(x,x))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_26,negated_conjecture,
~ member(x,unordered_pair(x,x)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET124-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 11:19:22 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.16/0.47 # Version: 3.1.0
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 27307 completed with status 0
% 0.16/0.47 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # No SInE strategy applied
% 0.16/0.47 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 308s (1) cores
% 0.16/0.47 # Starting sh5l with 304s (1) cores
% 0.16/0.47 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.47 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 27315 completed with status 0
% 0.16/0.47 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # No SInE strategy applied
% 0.16/0.47 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.47 # Preprocessing time : 0.002 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Unsatisfiable
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 94
% 0.16/0.47 # Removed by relevancy pruning/SinE : 0
% 0.16/0.47 # Initial clauses : 94
% 0.16/0.47 # Removed in clause preprocessing : 16
% 0.16/0.47 # Initial clauses in saturation : 78
% 0.16/0.47 # Processed clauses : 145
% 0.16/0.47 # ...of these trivial : 0
% 0.16/0.47 # ...subsumed : 0
% 0.16/0.47 # ...remaining for further processing : 145
% 0.16/0.47 # Other redundant clauses eliminated : 3
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 1
% 0.16/0.47 # Backward-rewritten : 12
% 0.16/0.47 # Generated clauses : 78
% 0.16/0.47 # ...of the previous two non-redundant : 70
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 0
% 0.16/0.47 # Paramodulations : 75
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 3
% 0.16/0.47 # Disequality decompositions : 0
% 0.16/0.47 # Total rewrite steps : 24
% 0.16/0.47 # ...of those cached : 18
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 52
% 0.16/0.47 # Positive orientable unit clauses : 17
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 3
% 0.16/0.47 # Non-unit-clauses : 32
% 0.16/0.47 # Current number of unprocessed clauses: 80
% 0.16/0.47 # ...number of literals in the above : 195
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 106
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 1363
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 648
% 0.16/0.47 # Non-unit clause-clause subsumptions : 1
% 0.16/0.47 # Unit Clause-clause subsumption calls : 95
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 6
% 0.16/0.47 # BW rewrite match successes : 3
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 6800
% 0.16/0.47 # Search garbage collected termcells : 156
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.013 s
% 0.16/0.47 # System time : 0.005 s
% 0.16/0.47 # Total time : 0.019 s
% 0.16/0.47 # Maximum resident set size: 1932 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.065 s
% 0.16/0.47 # System time : 0.012 s
% 0.16/0.47 # Total time : 0.077 s
% 0.16/0.47 # Maximum resident set size: 1780 pages
% 0.16/0.47 % E---3.1 exiting
% 0.16/0.47 % E exiting
%------------------------------------------------------------------------------