TSTP Solution File: SET516-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET516-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:54 EDT 2023
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of clauses : 45 ( 16 unt; 15 nHn; 32 RR)
% Number of literals : 83 ( 33 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_corollary_to_no_class_belongs_to_itself_1,negated_conjecture,
singleton(x) = x,
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',prove_corollary_to_no_class_belongs_to_itself_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',singleton_set) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',unordered_pair_member) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',regularity1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',regularity2) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',unordered_pairs_in_universal) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',intersection3) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',unordered_pair3) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',complement1) ).
cnf(inductive1,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',inductive1) ).
cnf(omega_is_inductive1,axiom,
inductive(omega),
file('/export/starexec/sandbox/tmp/tmp.kXosTHIz88/E---3.1_27686.p',omega_is_inductive1) ).
cnf(c_0_12,negated_conjecture,
singleton(x) = x,
prove_corollary_to_no_class_belongs_to_itself_1 ).
cnf(c_0_13,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_14,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_15,negated_conjecture,
unordered_pair(x,x) = x,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( X1 = x
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_18,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_19,negated_conjecture,
( regular(x) = x
| x = null_class ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_21,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_22,negated_conjecture,
( intersection(x,x) = null_class
| x = null_class ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_24,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_25,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_26,negated_conjecture,
( x = null_class
| member(X1,null_class)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
member(x,x),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_24])]) ).
cnf(c_0_28,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( x = null_class
| member(x,null_class) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_31,negated_conjecture,
( x = null_class
| X1 = null_class
| member(x,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( complement(X1) = null_class
| x = null_class
| ~ member(x,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( complement(x) = null_class
| x = null_class ),
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( x = null_class
| ~ member(X1,null_class) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
x = null_class,
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
member(null_class,null_class),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_35]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( X1 = null_class
| member(null_class,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
( complement(X1) = null_class
| ~ member(null_class,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_39,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
inductive1 ).
cnf(c_0_40,axiom,
inductive(omega),
omega_is_inductive1 ).
cnf(c_0_41,negated_conjecture,
( ~ member(X1,null_class)
| ~ member(null_class,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_38]) ).
cnf(c_0_42,plain,
member(null_class,omega),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
~ member(null_class,X1),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_44,plain,
$false,
inference(sr,[status(thm)],[c_0_42,c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET516-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 17:15:30 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.kXosTHIz88/E---3.1_27686.p
% 0.20/0.54 # Version: 3.1pre001
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 27874 completed with status 0
% 0.20/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 308s (1) cores
% 0.20/0.54 # Starting sh5l with 304s (1) cores
% 0.20/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27882 completed with status 0
% 0.20/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.54 # Preprocessing time : 0.004 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Unsatisfiable
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 113
% 0.20/0.54 # Removed by relevancy pruning/SinE : 0
% 0.20/0.54 # Initial clauses : 113
% 0.20/0.54 # Removed in clause preprocessing : 17
% 0.20/0.54 # Initial clauses in saturation : 96
% 0.20/0.54 # Processed clauses : 207
% 0.20/0.54 # ...of these trivial : 2
% 0.20/0.54 # ...subsumed : 5
% 0.20/0.54 # ...remaining for further processing : 200
% 0.20/0.54 # Other redundant clauses eliminated : 4
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 5
% 0.20/0.54 # Backward-rewritten : 21
% 0.20/0.54 # Generated clauses : 173
% 0.20/0.54 # ...of the previous two non-redundant : 156
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 1
% 0.20/0.54 # Paramodulations : 164
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 4
% 0.20/0.54 # Total rewrite steps : 69
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 70
% 0.20/0.54 # Positive orientable unit clauses : 22
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 1
% 0.20/0.54 # Non-unit-clauses : 47
% 0.20/0.54 # Current number of unprocessed clauses: 127
% 0.20/0.54 # ...number of literals in the above : 318
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 143
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 2160
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 970
% 0.20/0.54 # Non-unit clause-clause subsumptions : 7
% 0.20/0.54 # Unit Clause-clause subsumption calls : 96
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 6
% 0.20/0.54 # BW rewrite match successes : 3
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 8847
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.022 s
% 0.20/0.54 # System time : 0.005 s
% 0.20/0.54 # Total time : 0.027 s
% 0.20/0.54 # Maximum resident set size: 1996 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.096 s
% 0.20/0.54 # System time : 0.019 s
% 0.20/0.54 # Total time : 0.114 s
% 0.20/0.54 # Maximum resident set size: 1768 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------