TSTP Solution File: NUM181-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM181-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:46:01 EDT 2023
% Result : Unsatisfiable 0.38s 0.63s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 48 ( 30 unt; 5 nHn; 26 RR)
% Number of literals : 70 ( 18 equ; 21 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 : 19 ( 19 usr; 6 con; 0-3 aty)
% Number of variables : 60 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',intersection1) ).
cnf(limit_ordinals,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',limit_ordinals) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',not_subclass_members2) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',subclass_members) ).
cnf(prove_null_class_is_not_a_limit_ordinal_1,negated_conjecture,
member(null_class,limit_ordinals),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',prove_null_class_is_not_a_limit_ordinal_1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',not_subclass_members1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',class_elements_are_sets) ).
cnf(image,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',image) ).
cnf(range_of,axiom,
domain_of(inverse(X1)) = range_of(X1),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',range_of) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',restriction1) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',complement2) ).
cnf(kind_1_ordinals,axiom,
union(singleton(null_class),image(successor_relation,ordinal_numbers)) = kind_1_ordinals,
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',kind_1_ordinals) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',singleton_set) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',inverse) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',union) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',complement1) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p',unordered_pair2) ).
cnf(c_0_17,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_18,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
limit_ordinals ).
cnf(c_0_19,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_20,plain,
( member(X1,complement(kind_1_ordinals))
| ~ member(X1,limit_ordinals) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_22,negated_conjecture,
member(null_class,limit_ordinals),
prove_null_class_is_not_a_limit_ordinal_1 ).
cnf(c_0_23,plain,
( subclass(X1,complement(kind_1_ordinals))
| ~ member(not_subclass_element(X1,complement(kind_1_ordinals)),limit_ordinals) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_25,negated_conjecture,
( member(null_class,X1)
| ~ subclass(limit_ordinals,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_27,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
image ).
cnf(c_0_28,axiom,
domain_of(inverse(X1)) = range_of(X1),
range_of ).
cnf(c_0_29,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_30,plain,
subclass(limit_ordinals,complement(kind_1_ordinals)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_32,negated_conjecture,
member(null_class,universal_class),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,axiom,
union(singleton(null_class),image(successor_relation,ordinal_numbers)) = kind_1_ordinals,
kind_1_ordinals ).
cnf(c_0_34,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_35,plain,
domain_of(inverse(intersection(X1,cross_product(X2,universal_class)))) = image(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_36,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_37,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_38,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_39,negated_conjecture,
member(null_class,complement(kind_1_ordinals)),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_40,negated_conjecture,
( member(null_class,complement(X1))
| member(null_class,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,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_33,c_0_34]),c_0_35]),c_0_36]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
~ member(null_class,kind_1_ordinals),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
member(null_class,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))))))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_44,negated_conjecture,
member(null_class,complement(unordered_pair(null_class,null_class))),
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
~ member(null_class,unordered_pair(null_class,null_class)),
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_46,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM181-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 14:04:49 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.g42SL8EVQ3/E---3.1_23233.p
% 0.38/0.63 # Version: 3.1pre001
% 0.38/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.63 # Starting sh5l with 300s (1) cores
% 0.38/0.63 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23311 completed with status 0
% 0.38/0.63 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.38/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.63 # No SInE strategy applied
% 0.38/0.63 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.38/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.38/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.38/0.63 # Starting new_bool_1 with 308s (1) cores
% 0.38/0.63 # Starting sh5l with 304s (1) cores
% 0.38/0.63 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.38/0.63 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 23322 completed with status 0
% 0.38/0.63 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.63 # No SInE strategy applied
% 0.38/0.63 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.38/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.38/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.38/0.63 # Starting new_bool_1 with 308s (1) cores
% 0.38/0.63 # Starting sh5l with 304s (1) cores
% 0.38/0.63 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.38/0.63 # Preprocessing time : 0.003 s
% 0.38/0.63 # Presaturation interreduction done
% 0.38/0.63
% 0.38/0.63 # Proof found!
% 0.38/0.63 # SZS status Unsatisfiable
% 0.38/0.63 # SZS output start CNFRefutation
% See solution above
% 0.38/0.63 # Parsed axioms : 159
% 0.38/0.63 # Removed by relevancy pruning/SinE : 0
% 0.38/0.63 # Initial clauses : 159
% 0.38/0.63 # Removed in clause preprocessing : 19
% 0.38/0.63 # Initial clauses in saturation : 140
% 0.38/0.63 # Processed clauses : 1131
% 0.38/0.63 # ...of these trivial : 3
% 0.38/0.63 # ...subsumed : 389
% 0.38/0.63 # ...remaining for further processing : 739
% 0.38/0.63 # Other redundant clauses eliminated : 10
% 0.38/0.63 # Clauses deleted for lack of memory : 0
% 0.38/0.63 # Backward-subsumed : 76
% 0.38/0.63 # Backward-rewritten : 16
% 0.38/0.63 # Generated clauses : 2898
% 0.38/0.63 # ...of the previous two non-redundant : 2434
% 0.38/0.63 # ...aggressively subsumed : 0
% 0.38/0.63 # Contextual simplify-reflections : 18
% 0.38/0.63 # Paramodulations : 2880
% 0.38/0.63 # Factorizations : 8
% 0.38/0.63 # NegExts : 0
% 0.38/0.63 # Equation resolutions : 10
% 0.38/0.63 # Total rewrite steps : 818
% 0.38/0.63 # Propositional unsat checks : 0
% 0.38/0.63 # Propositional check models : 0
% 0.38/0.63 # Propositional check unsatisfiable : 0
% 0.38/0.63 # Propositional clauses : 0
% 0.38/0.63 # Propositional clauses after purity: 0
% 0.38/0.63 # Propositional unsat core size : 0
% 0.38/0.63 # Propositional preprocessing time : 0.000
% 0.38/0.63 # Propositional encoding time : 0.000
% 0.38/0.63 # Propositional solver time : 0.000
% 0.38/0.63 # Success case prop preproc time : 0.000
% 0.38/0.63 # Success case prop encoding time : 0.000
% 0.38/0.63 # Success case prop solver time : 0.000
% 0.38/0.63 # Current number of processed clauses : 502
% 0.38/0.63 # Positive orientable unit clauses : 73
% 0.38/0.63 # Positive unorientable unit clauses: 3
% 0.38/0.63 # Negative unit clauses : 6
% 0.38/0.63 # Non-unit-clauses : 420
% 0.38/0.63 # Current number of unprocessed clauses: 1483
% 0.38/0.63 # ...number of literals in the above : 4644
% 0.38/0.63 # Current number of archived formulas : 0
% 0.38/0.63 # Current number of archived clauses : 250
% 0.38/0.63 # Clause-clause subsumption calls (NU) : 37869
% 0.38/0.63 # Rec. Clause-clause subsumption calls : 19324
% 0.38/0.63 # Non-unit clause-clause subsumptions : 391
% 0.38/0.63 # Unit Clause-clause subsumption calls : 1982
% 0.38/0.63 # Rewrite failures with RHS unbound : 0
% 0.38/0.63 # BW rewrite match attempts : 61
% 0.38/0.63 # BW rewrite match successes : 19
% 0.38/0.63 # Condensation attempts : 0
% 0.38/0.63 # Condensation successes : 0
% 0.38/0.63 # Termbank termtop insertions : 73211
% 0.38/0.63
% 0.38/0.63 # -------------------------------------------------
% 0.38/0.63 # User time : 0.098 s
% 0.38/0.63 # System time : 0.007 s
% 0.38/0.63 # Total time : 0.105 s
% 0.38/0.63 # Maximum resident set size: 2208 pages
% 0.38/0.63
% 0.38/0.63 # -------------------------------------------------
% 0.38/0.63 # User time : 0.517 s
% 0.38/0.63 # System time : 0.023 s
% 0.38/0.63 # Total time : 0.540 s
% 0.38/0.63 # Maximum resident set size: 1816 pages
% 0.38/0.63 % E---3.1 exiting
% 0.38/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------