TSTP Solution File: SET497-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET497-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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:22:51 EDT 2023
% Result : Unsatisfiable 1.79s 0.77s
% Output : CNFRefutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 19 unt; 11 nHn; 30 RR)
% Number of literals : 92 ( 37 equ; 39 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 82 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',subclass_members) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',regularity1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',class_elements_are_sets) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',restriction2) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',intersection2) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',unordered_pair_member) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',intersection3) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',regularity2) ).
cnf(prove_russell_class1_2,negated_conjecture,
member(z,z),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',prove_russell_class1_2) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.dJ21WefCEC/E---3.1_940.p',unordered_pair2) ).
cnf(c_0_14,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_15,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_16,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_17,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
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,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_22,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_23,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_24,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_25,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_27,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_29,plain,
( ~ member(X1,null_class)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_30,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_31,plain,
( intersection(cross_product(unordered_pair(X1,X1),universal_class),X2) != null_class
| ~ member(X1,domain_of(X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
intersection(X1,null_class) = null_class,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_20]) ).
cnf(c_0_33,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_33,c_0_15]) ).
cnf(c_0_35,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_36,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_37,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_38,plain,
~ member(X1,null_class),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( regular(unordered_pair(X1,X2)) = X1
| regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_35,c_0_15]) ).
cnf(c_0_40,plain,
( X1 = null_class
| ~ member(X2,regular(X1))
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
( regular(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_39])]) ).
cnf(c_0_42,negated_conjecture,
member(z,z),
prove_russell_class1_2 ).
cnf(c_0_43,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X2,unordered_pair(X1,X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_45,negated_conjecture,
( member(z,X1)
| ~ subclass(z,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_42]) ).
cnf(c_0_46,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X1,universal_class)
| ~ member(X1,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
member(z,universal_class),
inference(spm,[status(thm)],[c_0_45,c_0_18]) ).
cnf(c_0_48,negated_conjecture,
unordered_pair(z,z) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_42])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_48]),c_0_47])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET497-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 16:24:28 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.dJ21WefCEC/E---3.1_940.p
% 1.79/0.77 # Version: 3.1pre001
% 1.79/0.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.79/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.79/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.79/0.77 # Starting new_bool_3 with 300s (1) cores
% 1.79/0.77 # Starting new_bool_1 with 300s (1) cores
% 1.79/0.77 # Starting sh5l with 300s (1) cores
% 1.79/0.77 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1044 completed with status 0
% 1.79/0.77 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.79/0.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.79/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.79/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.79/0.77 # No SInE strategy applied
% 1.79/0.77 # Search class: FGHSM-FFLM31-DFFFFFNN
% 1.79/0.77 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.79/0.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 1.79/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.79/0.77 # Starting new_bool_1 with 308s (1) cores
% 1.79/0.77 # Starting sh5l with 304s (1) cores
% 1.79/0.77 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.79/0.77 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1051 completed with status 0
% 1.79/0.77 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.79/0.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.79/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.79/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.79/0.77 # No SInE strategy applied
% 1.79/0.77 # Search class: FGHSM-FFLM31-DFFFFFNN
% 1.79/0.77 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.79/0.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 1.79/0.77 # Preprocessing time : 0.003 s
% 1.79/0.77 # Presaturation interreduction done
% 1.79/0.77
% 1.79/0.77 # Proof found!
% 1.79/0.77 # SZS status Unsatisfiable
% 1.79/0.77 # SZS output start CNFRefutation
% See solution above
% 1.79/0.77 # Parsed axioms : 114
% 1.79/0.77 # Removed by relevancy pruning/SinE : 0
% 1.79/0.77 # Initial clauses : 114
% 1.79/0.77 # Removed in clause preprocessing : 17
% 1.79/0.77 # Initial clauses in saturation : 97
% 1.79/0.77 # Processed clauses : 3455
% 1.79/0.77 # ...of these trivial : 18
% 1.79/0.77 # ...subsumed : 2323
% 1.79/0.77 # ...remaining for further processing : 1114
% 1.79/0.77 # Other redundant clauses eliminated : 12
% 1.79/0.77 # Clauses deleted for lack of memory : 0
% 1.79/0.77 # Backward-subsumed : 54
% 1.79/0.77 # Backward-rewritten : 18
% 1.79/0.77 # Generated clauses : 13411
% 1.79/0.77 # ...of the previous two non-redundant : 10414
% 1.79/0.77 # ...aggressively subsumed : 0
% 1.79/0.77 # Contextual simplify-reflections : 15
% 1.79/0.77 # Paramodulations : 13383
% 1.79/0.77 # Factorizations : 10
% 1.79/0.77 # NegExts : 0
% 1.79/0.77 # Equation resolutions : 12
% 1.79/0.77 # Total rewrite steps : 7213
% 1.79/0.77 # Propositional unsat checks : 0
% 1.79/0.77 # Propositional check models : 0
% 1.79/0.77 # Propositional check unsatisfiable : 0
% 1.79/0.77 # Propositional clauses : 0
% 1.79/0.77 # Propositional clauses after purity: 0
% 1.79/0.77 # Propositional unsat core size : 0
% 1.79/0.77 # Propositional preprocessing time : 0.000
% 1.79/0.77 # Propositional encoding time : 0.000
% 1.79/0.77 # Propositional solver time : 0.000
% 1.79/0.77 # Success case prop preproc time : 0.000
% 1.79/0.77 # Success case prop encoding time : 0.000
% 1.79/0.77 # Success case prop solver time : 0.000
% 1.79/0.77 # Current number of processed clauses : 936
% 1.79/0.77 # Positive orientable unit clauses : 137
% 1.79/0.77 # Positive unorientable unit clauses: 1
% 1.79/0.77 # Negative unit clauses : 5
% 1.79/0.77 # Non-unit-clauses : 793
% 1.79/0.77 # Current number of unprocessed clauses: 7060
% 1.79/0.77 # ...number of literals in the above : 23614
% 1.79/0.77 # Current number of archived formulas : 0
% 1.79/0.77 # Current number of archived clauses : 191
% 1.79/0.77 # Clause-clause subsumption calls (NU) : 110675
% 1.79/0.77 # Rec. Clause-clause subsumption calls : 55424
% 1.79/0.77 # Non-unit clause-clause subsumptions : 1732
% 1.79/0.77 # Unit Clause-clause subsumption calls : 2731
% 1.79/0.77 # Rewrite failures with RHS unbound : 0
% 1.79/0.77 # BW rewrite match attempts : 82
% 1.79/0.77 # BW rewrite match successes : 13
% 1.79/0.77 # Condensation attempts : 0
% 1.79/0.77 # Condensation successes : 0
% 1.79/0.77 # Termbank termtop insertions : 328730
% 1.79/0.77
% 1.79/0.77 # -------------------------------------------------
% 1.79/0.77 # User time : 0.260 s
% 1.79/0.77 # System time : 0.011 s
% 1.79/0.77 # Total time : 0.271 s
% 1.79/0.77 # Maximum resident set size: 2000 pages
% 1.79/0.77
% 1.79/0.77 # -------------------------------------------------
% 1.79/0.77 # User time : 1.237 s
% 1.79/0.77 # System time : 0.029 s
% 1.79/0.77 # Total time : 1.266 s
% 1.79/0.77 # Maximum resident set size: 1772 pages
% 1.79/0.77 % E---3.1 exiting
%------------------------------------------------------------------------------