TSTP Solution File: NUM159-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM159-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 106.92s 14.05s
% Output : CNFRefutation 106.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 49 ( 26 unt; 8 nHn; 22 RR)
% Number of literals : 78 ( 20 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 5 con; 0-3 aty)
% Number of variables : 79 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',class_elements_are_sets) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',not_subclass_members1) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',not_subclass_members2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',complement2) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',complement1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',subclass_implies_equal) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',intersection2) ).
cnf(image,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',image) ).
cnf(range_of,axiom,
domain_of(inverse(X1)) = range_of(X1),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',range_of) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',restriction1) ).
cnf(kind_1_ordinals,axiom,
union(singleton(null_class),image(successor_relation,ordinal_numbers)) = kind_1_ordinals,
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',kind_1_ordinals) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',singleton_set) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',inverse) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',union) ).
cnf(prove_corollary_to_kind_1_ordinal_1,negated_conjecture,
~ subclass(image(successor_relation,ordinal_numbers),kind_1_ordinals),
file('/export/starexec/sandbox2/tmp/tmp.S3fYx0QlAF/E---3.1_12674.p',prove_corollary_to_kind_1_ordinal_1) ).
cnf(c_0_16,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_17,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_18,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_20,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_21,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_22,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_24,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_27,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_28,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_29,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_21]),c_0_22]) ).
cnf(c_0_30,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_32,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_33,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_34,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
image ).
cnf(c_0_35,axiom,
domain_of(inverse(X1)) = range_of(X1),
range_of ).
cnf(c_0_36,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_37,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),complement(X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_38,plain,
( member(not_subclass_element(X1,complement(intersection(X2,X3))),X3)
| subclass(X1,complement(intersection(X2,X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_39,axiom,
union(singleton(null_class),image(successor_relation,ordinal_numbers)) = kind_1_ordinals,
kind_1_ordinals ).
cnf(c_0_40,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_41,plain,
domain_of(inverse(intersection(X1,cross_product(X2,universal_class)))) = image(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_43,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_44,negated_conjecture,
~ subclass(image(successor_relation,ordinal_numbers),kind_1_ordinals),
prove_corollary_to_kind_1_ordinal_1 ).
cnf(c_0_45,plain,
subclass(X1,complement(intersection(X2,complement(X1)))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,plain,
complement(intersection(complement(unordered_pair(null_class,null_class)),complement(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(ordinal_numbers,universal_class)),universal_class))))))) = kind_1_ordinals,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ subclass(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(ordinal_numbers,universal_class)),universal_class)))),kind_1_ordinals),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_41]),c_0_42]) ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : NUM159-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n014.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.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 13:51:34 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.45 Running first-order model finding
% 0.16/0.45 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.S3fYx0QlAF/E---3.1_12674.p
% 106.92/14.05 # Version: 3.1pre001
% 106.92/14.05 # Preprocessing class: FSLSSMSMSSSNFFN.
% 106.92/14.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 106.92/14.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 106.92/14.05 # Starting new_bool_3 with 300s (1) cores
% 106.92/14.05 # Starting new_bool_1 with 300s (1) cores
% 106.92/14.05 # Starting sh5l with 300s (1) cores
% 106.92/14.05 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12752 completed with status 0
% 106.92/14.05 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 106.92/14.05 # Preprocessing class: FSLSSMSMSSSNFFN.
% 106.92/14.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 106.92/14.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 106.92/14.05 # No SInE strategy applied
% 106.92/14.05 # Search class: FGHSM-FFLM31-DFFFFFNN
% 106.92/14.05 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 106.92/14.05 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 106.92/14.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 106.92/14.05 # Starting new_bool_1 with 308s (1) cores
% 106.92/14.05 # Starting sh5l with 304s (1) cores
% 106.92/14.05 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 106.92/14.05 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12760 completed with status 0
% 106.92/14.05 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 106.92/14.05 # Preprocessing class: FSLSSMSMSSSNFFN.
% 106.92/14.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 106.92/14.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 106.92/14.05 # No SInE strategy applied
% 106.92/14.05 # Search class: FGHSM-FFLM31-DFFFFFNN
% 106.92/14.05 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 106.92/14.05 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 106.92/14.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 106.92/14.05 # Preprocessing time : 0.003 s
% 106.92/14.05 # Presaturation interreduction done
% 106.92/14.05
% 106.92/14.05 # Proof found!
% 106.92/14.05 # SZS status Unsatisfiable
% 106.92/14.05 # SZS output start CNFRefutation
% See solution above
% 106.92/14.05 # Parsed axioms : 159
% 106.92/14.05 # Removed by relevancy pruning/SinE : 0
% 106.92/14.05 # Initial clauses : 159
% 106.92/14.05 # Removed in clause preprocessing : 19
% 106.92/14.05 # Initial clauses in saturation : 140
% 106.92/14.05 # Processed clauses : 26858
% 106.92/14.05 # ...of these trivial : 170
% 106.92/14.05 # ...subsumed : 21729
% 106.92/14.05 # ...remaining for further processing : 4959
% 106.92/14.05 # Other redundant clauses eliminated : 28
% 106.92/14.05 # Clauses deleted for lack of memory : 0
% 106.92/14.05 # Backward-subsumed : 391
% 106.92/14.05 # Backward-rewritten : 825
% 106.92/14.05 # Generated clauses : 264254
% 106.92/14.05 # ...of the previous two non-redundant : 239903
% 106.92/14.05 # ...aggressively subsumed : 0
% 106.92/14.05 # Contextual simplify-reflections : 72
% 106.92/14.05 # Paramodulations : 264203
% 106.92/14.05 # Factorizations : 23
% 106.92/14.05 # NegExts : 0
% 106.92/14.05 # Equation resolutions : 28
% 106.92/14.05 # Total rewrite steps : 115426
% 106.92/14.05 # Propositional unsat checks : 0
% 106.92/14.05 # Propositional check models : 0
% 106.92/14.05 # Propositional check unsatisfiable : 0
% 106.92/14.05 # Propositional clauses : 0
% 106.92/14.05 # Propositional clauses after purity: 0
% 106.92/14.05 # Propositional unsat core size : 0
% 106.92/14.05 # Propositional preprocessing time : 0.000
% 106.92/14.05 # Propositional encoding time : 0.000
% 106.92/14.05 # Propositional solver time : 0.000
% 106.92/14.05 # Success case prop preproc time : 0.000
% 106.92/14.05 # Success case prop encoding time : 0.000
% 106.92/14.05 # Success case prop solver time : 0.000
% 106.92/14.05 # Current number of processed clauses : 3598
% 106.92/14.05 # Positive orientable unit clauses : 278
% 106.92/14.05 # Positive unorientable unit clauses: 4
% 106.92/14.05 # Negative unit clauses : 9
% 106.92/14.05 # Non-unit-clauses : 3307
% 106.92/14.05 # Current number of unprocessed clauses: 209961
% 106.92/14.05 # ...number of literals in the above : 917356
% 106.92/14.05 # Current number of archived formulas : 0
% 106.92/14.05 # Current number of archived clauses : 1374
% 106.92/14.05 # Clause-clause subsumption calls (NU) : 3510467
% 106.92/14.05 # Rec. Clause-clause subsumption calls : 1639856
% 106.92/14.05 # Non-unit clause-clause subsumptions : 19485
% 106.92/14.05 # Unit Clause-clause subsumption calls : 23216
% 106.92/14.05 # Rewrite failures with RHS unbound : 16
% 106.92/14.05 # BW rewrite match attempts : 1144
% 106.92/14.05 # BW rewrite match successes : 775
% 106.92/14.05 # Condensation attempts : 0
% 106.92/14.05 # Condensation successes : 0
% 106.92/14.05 # Termbank termtop insertions : 31760393
% 106.92/14.05
% 106.92/14.05 # -------------------------------------------------
% 106.92/14.05 # User time : 13.089 s
% 106.92/14.05 # System time : 0.223 s
% 106.92/14.05 # Total time : 13.312 s
% 106.92/14.05 # Maximum resident set size: 2208 pages
% 106.92/14.05
% 106.92/14.05 # -------------------------------------------------
% 106.92/14.05 # User time : 65.731 s
% 106.92/14.05 # System time : 0.844 s
% 106.92/14.05 # Total time : 66.575 s
% 106.92/14.05 # Maximum resident set size: 1816 pages
% 106.92/14.05 % E---3.1 exiting
%------------------------------------------------------------------------------