TSTP Solution File: SET138-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET138-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Sat May 4 09:18:11 EDT 2024
% Result : Unsatisfiable 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 40 ( 20 unt; 6 nHn; 22 RR)
% Number of literals : 66 ( 12 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 56 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',class_elements_are_sets) ).
cnf(prove_member_of_triple_kludge2_4,negated_conjecture,
~ member(u,set_builder(u,set_builder(v,set_builder(w,null_class)))),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',prove_member_of_triple_kludge2_4) ).
cnf(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',definition_of_set_builder) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',singleton_set) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',regularity1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',union) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',complement2) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',intersection1) ).
cnf(prove_member_of_triple_kludge2_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',prove_member_of_triple_kludge2_1) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p',unordered_pair2) ).
cnf(c_0_12,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_13,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_14,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_12 ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,negated_conjecture,
~ member(u,set_builder(u,set_builder(v,set_builder(w,null_class)))),
inference(fof_simplification,[status(thm)],[prove_member_of_triple_kludge2_4]) ).
cnf(c_0_17,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_18,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_19,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_13 ).
cnf(c_0_20,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_21,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
~ member(u,set_builder(u,set_builder(v,set_builder(w,null_class)))),
c_0_16 ).
cnf(c_0_23,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_25,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_26,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_28,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_29,negated_conjecture,
~ member(u,complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_23]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_30,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
member(u,universal_class),
prove_member_of_triple_kludge2_1 ).
cnf(c_0_32,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_28 ).
cnf(c_0_34,negated_conjecture,
member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(complement(universal_class)))))))))),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_35,negated_conjecture,
member(u,complement(unordered_pair(u,u))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_37,negated_conjecture,
~ member(u,unordered_pair(u,u)),
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
cnf(c_0_38,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET138-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 10:20:40 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.uBr4AvoIrG/E---3.1_10628.p
% 0.17/0.45 # Version: 3.1.0
% 0.17/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10706 completed with status 0
% 0.17/0.45 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 308s (1) cores
% 0.17/0.45 # Starting sh5l with 304s (1) cores
% 0.17/0.45 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.45 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10714 completed with status 0
% 0.17/0.45 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.45 # Preprocessing time : 0.002 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Unsatisfiable
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 96
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 96
% 0.17/0.45 # Removed in clause preprocessing : 16
% 0.17/0.45 # Initial clauses in saturation : 80
% 0.17/0.45 # Processed clauses : 156
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 1
% 0.17/0.45 # ...remaining for further processing : 155
% 0.17/0.45 # Other redundant clauses eliminated : 3
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 1
% 0.17/0.45 # Backward-rewritten : 13
% 0.17/0.45 # Generated clauses : 90
% 0.17/0.45 # ...of the previous two non-redundant : 79
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 87
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 3
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 35
% 0.17/0.45 # ...of those cached : 26
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 59
% 0.17/0.45 # Positive orientable unit clauses : 20
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 3
% 0.17/0.45 # Non-unit-clauses : 36
% 0.17/0.45 # Current number of unprocessed clauses: 81
% 0.17/0.45 # ...number of literals in the above : 195
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 109
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 1418
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 678
% 0.17/0.45 # Non-unit clause-clause subsumptions : 2
% 0.17/0.45 # Unit Clause-clause subsumption calls : 23
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 7
% 0.17/0.45 # BW rewrite match successes : 3
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 7090
% 0.17/0.45 # Search garbage collected termcells : 156
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.013 s
% 0.17/0.45 # System time : 0.004 s
% 0.17/0.45 # Total time : 0.017 s
% 0.17/0.45 # Maximum resident set size: 1988 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.059 s
% 0.17/0.45 # System time : 0.009 s
% 0.17/0.45 # Total time : 0.068 s
% 0.17/0.45 # Maximum resident set size: 1772 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E exiting
%------------------------------------------------------------------------------