TSTP Solution File: SET137-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET137-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:22:21 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of clauses : 53 ( 18 unt; 14 nHn; 33 RR)
% Number of literals : 96 ( 17 equ; 34 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 : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 70 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',subclass_members) ).
cnf(prove_member_of_triple_kludge1_3,negated_conjecture,
member(w,x),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',prove_member_of_triple_kludge1_3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',complement2) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',class_elements_are_sets) ).
cnf(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',definition_of_set_builder) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',singleton_set) ).
cnf(prove_member_of_triple_kludge1_4,negated_conjecture,
set_builder(u,set_builder(v,set_builder(w,null_class))) = null_class,
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',prove_member_of_triple_kludge1_4) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',union) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',intersection2) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',complement1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',intersection1) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',unordered_pair2) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p',regularity2) ).
cnf(c_0_13,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_14,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_13 ).
cnf(c_0_15,negated_conjecture,
member(w,x),
prove_member_of_triple_kludge1_3 ).
cnf(c_0_16,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_17,negated_conjecture,
( member(w,X1)
| ~ subclass(x,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_19,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_20,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_21,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
member(w,universal_class),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
set_builder(u,set_builder(v,set_builder(w,null_class))) = null_class,
prove_member_of_triple_kludge1_4 ).
cnf(c_0_24,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_26,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_27,negated_conjecture,
( member(w,complement(X1))
| member(w,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
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))))))))) = 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_23,c_0_24]),c_0_24]),c_0_24]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_30,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
( member(w,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)))))))))
| member(w,null_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_29 ).
cnf(c_0_33,negated_conjecture,
( member(w,complement(complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class))))))))
| member(w,null_class) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( member(w,null_class)
| ~ member(w,complement(intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class))))))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
( member(w,intersection(complement(unordered_pair(v,v)),complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class))))))
| member(w,null_class) ),
inference(spm,[status(thm)],[c_0_34,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( member(w,complement(complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))))
| member(w,null_class) ),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
cnf(c_0_37,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_38,negated_conjecture,
( member(w,null_class)
| ~ member(w,complement(intersection(complement(unordered_pair(w,w)),complement(null_class)))) ),
inference(spm,[status(thm)],[c_0_32,c_0_36]) ).
cnf(c_0_39,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_37 ).
cnf(c_0_40,negated_conjecture,
( member(w,intersection(complement(unordered_pair(w,w)),complement(null_class)))
| member(w,null_class) ),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_41,negated_conjecture,
( member(w,complement(unordered_pair(w,w)))
| member(w,null_class) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_43,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_44,negated_conjecture,
( member(w,null_class)
| ~ member(w,unordered_pair(w,w)) ),
inference(spm,[status(thm)],[c_0_32,c_0_41]) ).
cnf(c_0_45,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_42 ).
cnf(c_0_46,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
member(w,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_22])]) ).
cnf(c_0_48,negated_conjecture,
( X1 = null_class
| member(w,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( complement(X1) = null_class
| ~ member(w,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_48]) ).
cnf(c_0_50,negated_conjecture,
( ~ member(X1,null_class)
| ~ member(w,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
~ member(w,X1),
inference(spm,[status(thm)],[c_0_50,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_27,c_0_51]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET137-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 10:12:27 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.n5S0DmQFgS/E---3.1_5576.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 5684 completed with status 0
% 0.20/0.51 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 308s (1) cores
% 0.20/0.51 # Starting sh5l with 304s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5695 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.51 # Preprocessing time : 0.006 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 96
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 96
% 0.20/0.51 # Removed in clause preprocessing : 16
% 0.20/0.51 # Initial clauses in saturation : 80
% 0.20/0.51 # Processed clauses : 196
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 5
% 0.20/0.51 # ...remaining for further processing : 191
% 0.20/0.51 # Other redundant clauses eliminated : 3
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 6
% 0.20/0.51 # Backward-rewritten : 15
% 0.20/0.51 # Generated clauses : 247
% 0.20/0.51 # ...of the previous two non-redundant : 216
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 238
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 3
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 36
% 0.20/0.51 # ...of those cached : 28
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 82
% 0.20/0.51 # Positive orientable unit clauses : 20
% 0.20/0.51 # Positive unorientable unit clauses: 1
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 60
% 0.20/0.51 # Current number of unprocessed clauses: 178
% 0.20/0.51 # ...number of literals in the above : 471
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 122
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 2813
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 1391
% 0.20/0.51 # Non-unit clause-clause subsumptions : 5
% 0.20/0.51 # Unit Clause-clause subsumption calls : 59
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 6
% 0.20/0.51 # BW rewrite match successes : 3
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 9758
% 0.20/0.51 # Search garbage collected termcells : 154
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.023 s
% 0.20/0.51 # System time : 0.006 s
% 0.20/0.51 # Total time : 0.029 s
% 0.20/0.51 # Maximum resident set size: 1936 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.098 s
% 0.20/0.51 # System time : 0.026 s
% 0.20/0.51 # Total time : 0.124 s
% 0.20/0.51 # Maximum resident set size: 1772 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------