TSTP Solution File: NUM154-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM154-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 18:58:24 EDT 2023
% Result : Unsatisfiable 0.14s 0.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 46 ( 23 unt; 6 nHn; 29 RR)
% Number of literals : 73 ( 18 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 55 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',class_elements_are_sets) ).
cnf(successor,axiom,
union(X1,singleton(X1)) = successor(X1),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',successor) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',singleton_set) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',complement1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',regularity1) ).
cnf(prove_corollary_5_to_successor_property1_1,negated_conjecture,
successor(x) = null_class,
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',prove_corollary_5_to_successor_property1_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',union) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',complement2) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',intersection1) ).
cnf(inductive1,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',inductive1) ).
cnf(omega_is_inductive1,axiom,
inductive(omega),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',omega_is_inductive1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',intersection2) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p',unordered_pair2) ).
cnf(c_0_14,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,axiom,
union(X1,singleton(X1)) = successor(X1),
successor ).
cnf(c_0_17,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_18,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_19,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_20,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
successor(x) = null_class,
prove_corollary_5_to_successor_property1_1 ).
cnf(c_0_22,plain,
union(X1,unordered_pair(X1,X1)) = successor(X1),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_24,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
complement(intersection(complement(x),complement(unordered_pair(x,x)))) = null_class,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_27,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_29,negated_conjecture,
complement(intersection(complement(x),complement(unordered_pair(x,x)))) = complement(universal_class),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_31,negated_conjecture,
( member(X1,intersection(complement(x),complement(unordered_pair(x,x))))
| ~ member(X1,universal_class) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18]) ).
cnf(c_0_32,negated_conjecture,
( member(X1,complement(x))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
~ member(X1,x),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_20]) ).
cnf(c_0_34,plain,
( X1 = complement(universal_class)
| member(regular(X1),X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_35,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
inductive1 ).
cnf(c_0_36,axiom,
inductive(omega),
omega_is_inductive1 ).
cnf(c_0_37,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_38,negated_conjecture,
x = complement(universal_class),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
member(null_class,omega),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( member(X1,complement(unordered_pair(complement(universal_class),complement(universal_class))))
| ~ member(X1,universal_class) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_38]),c_0_38]) ).
cnf(c_0_41,plain,
member(null_class,universal_class),
inference(spm,[status(thm)],[c_0_20,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
~ member(X1,unordered_pair(complement(universal_class),complement(universal_class))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_40]),c_0_20]) ).
cnf(c_0_43,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_44,plain,
member(complement(universal_class),universal_class),
inference(rw,[status(thm)],[c_0_41,c_0_27]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : NUM154-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.05/0.09 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n009.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 2400
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Mon Oct 2 13:39:29 EDT 2023
% 0.08/0.29 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.3MfHAuRlvJ/E---3.1_20377.p
% 0.14/0.48 # Version: 3.1pre001
% 0.14/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 # Starting sh5l with 300s (1) cores
% 0.14/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 20454 completed with status 0
% 0.14/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.48 # No SInE strategy applied
% 0.14/0.48 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.14/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.48 # Starting new_bool_1 with 308s (1) cores
% 0.14/0.48 # Starting sh5l with 304s (1) cores
% 0.14/0.48 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 20462 completed with status 0
% 0.14/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.48 # No SInE strategy applied
% 0.14/0.48 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.14/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.48 # Preprocessing time : 0.003 s
% 0.14/0.48 # Presaturation interreduction done
% 0.14/0.48
% 0.14/0.48 # Proof found!
% 0.14/0.48 # SZS status Unsatisfiable
% 0.14/0.48 # SZS output start CNFRefutation
% See solution above
% 0.14/0.48 # Parsed axioms : 159
% 0.14/0.48 # Removed by relevancy pruning/SinE : 0
% 0.14/0.48 # Initial clauses : 159
% 0.14/0.48 # Removed in clause preprocessing : 19
% 0.14/0.48 # Initial clauses in saturation : 140
% 0.14/0.48 # Processed clauses : 670
% 0.14/0.48 # ...of these trivial : 1
% 0.14/0.48 # ...subsumed : 136
% 0.14/0.48 # ...remaining for further processing : 533
% 0.14/0.48 # Other redundant clauses eliminated : 12
% 0.14/0.48 # Clauses deleted for lack of memory : 0
% 0.14/0.48 # Backward-subsumed : 24
% 0.14/0.48 # Backward-rewritten : 33
% 0.14/0.48 # Generated clauses : 1387
% 0.14/0.48 # ...of the previous two non-redundant : 1258
% 0.14/0.48 # ...aggressively subsumed : 0
% 0.14/0.48 # Contextual simplify-reflections : 10
% 0.14/0.48 # Paramodulations : 1369
% 0.14/0.48 # Factorizations : 6
% 0.14/0.48 # NegExts : 0
% 0.14/0.48 # Equation resolutions : 12
% 0.14/0.48 # Total rewrite steps : 352
% 0.14/0.48 # Propositional unsat checks : 0
% 0.14/0.48 # Propositional check models : 0
% 0.14/0.48 # Propositional check unsatisfiable : 0
% 0.14/0.48 # Propositional clauses : 0
% 0.14/0.48 # Propositional clauses after purity: 0
% 0.14/0.48 # Propositional unsat core size : 0
% 0.14/0.48 # Propositional preprocessing time : 0.000
% 0.14/0.48 # Propositional encoding time : 0.000
% 0.14/0.48 # Propositional solver time : 0.000
% 0.14/0.48 # Success case prop preproc time : 0.000
% 0.14/0.48 # Success case prop encoding time : 0.000
% 0.14/0.48 # Success case prop solver time : 0.000
% 0.14/0.48 # Current number of processed clauses : 331
% 0.14/0.48 # Positive orientable unit clauses : 58
% 0.14/0.48 # Positive unorientable unit clauses: 3
% 0.14/0.48 # Negative unit clauses : 2
% 0.14/0.48 # Non-unit-clauses : 268
% 0.14/0.48 # Current number of unprocessed clauses: 831
% 0.14/0.48 # ...number of literals in the above : 2405
% 0.14/0.48 # Current number of archived formulas : 0
% 0.14/0.48 # Current number of archived clauses : 215
% 0.14/0.48 # Clause-clause subsumption calls (NU) : 14972
% 0.14/0.48 # Rec. Clause-clause subsumption calls : 8093
% 0.14/0.48 # Non-unit clause-clause subsumptions : 145
% 0.14/0.48 # Unit Clause-clause subsumption calls : 585
% 0.14/0.48 # Rewrite failures with RHS unbound : 14
% 0.14/0.48 # BW rewrite match attempts : 35
% 0.14/0.48 # BW rewrite match successes : 12
% 0.14/0.48 # Condensation attempts : 0
% 0.14/0.48 # Condensation successes : 0
% 0.14/0.48 # Termbank termtop insertions : 46348
% 0.14/0.48
% 0.14/0.48 # -------------------------------------------------
% 0.14/0.48 # User time : 0.066 s
% 0.14/0.48 # System time : 0.005 s
% 0.14/0.48 # Total time : 0.070 s
% 0.14/0.48 # Maximum resident set size: 2208 pages
% 0.14/0.48
% 0.14/0.48 # -------------------------------------------------
% 0.14/0.48 # User time : 0.319 s
% 0.14/0.48 # System time : 0.017 s
% 0.14/0.48 # Total time : 0.335 s
% 0.14/0.48 # Maximum resident set size: 1816 pages
% 0.14/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------