%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM181-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:44:28 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.65s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 47 ( 28 unt; 4 nHn; 24 RR)
% Number of literals : 72 ( 18 equ; 25 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; 6 con; 0-3 aty)
% Number of variables : 67 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(prove_null_class_is_not_a_limit_ordinal_1,negated_conjecture,
member(null_class,limit_ordinals),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_class_is_not_a_limit_ordinal_1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(image,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',image) ).
cnf(range_of,axiom,
domain_of(inverse(X1)) = range_of(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',range_of) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(limit_ordinals,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',limit_ordinals) ).
cnf(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(kind_1_ordinals,axiom,
union(singleton(null_class),image(successor_relation,ordinal_numbers)) = kind_1_ordinals,
file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',kind_1_ordinals) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',inverse) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_15,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_16,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_15 ).
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)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
member(null_class,limit_ordinals),
prove_null_class_is_not_a_limit_ordinal_1 ).
cnf(c_0_21,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_22,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_23,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
member(null_class,universal_class),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
image ).
cnf(c_0_26,axiom,
domain_of(inverse(X1)) = range_of(X1),
range_of ).
cnf(c_0_27,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_28,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_21 ).
cnf(c_0_29,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
limit_ordinals ).
cnf(c_0_30,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_31,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_22 ).
cnf(c_0_32,negated_conjecture,
( member(null_class,X1)
| member(null_class,complement(X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
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_25,c_0_26]),c_0_27]) ).
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,plain,
( ~ member(X1,limit_ordinals)
| member(X1,complement(kind_1_ordinals)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_30 ).
cnf(c_0_40,negated_conjecture,
( ~ member(null_class,complement(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,complement(kind_1_ordinals)),
inference(spm,[status(thm)],[c_0_38,c_0_20]) ).
cnf(c_0_43,negated_conjecture,
member(null_class,unordered_pair(X1,null_class)),
inference(spm,[status(thm)],[c_0_39,c_0_24]) ).
cnf(c_0_44,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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
~ member(null_class,complement(unordered_pair(X1,null_class))),
inference(spm,[status(thm)],[c_0_31,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM181-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n005.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 02:10:34 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.52 Running first-order theorem proving
% 0.26/0.52 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.26/0.65 % Version: 3.5.1
% 0.26/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.65 % Starting sh5l with 300s (1) cores
% 0.26/0.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2326714 completed with status 0
% 0.26/0.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.26/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.65 % No SInE strategy applied
% 0.26/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.26/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.26/0.65 % Starting new_bool_3 with 311s (1) cores
% 0.26/0.65 % Starting new_bool_1 with 308s (1) cores
% 0.26/0.65 % Starting sh5l with 304s (1) cores
% 0.26/0.65 % new_bool_1 with pid 2326723 completed with status 0
% 0.26/0.65 % Result found by new_bool_1
% 0.26/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.65 % No SInE strategy applied
% 0.26/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.26/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.26/0.65 % Starting new_bool_3 with 311s (1) cores
% 0.26/0.65 % Starting new_bool_1 with 308s (1) cores
% 0.26/0.65 % Preprocessing time : 0.006 s
% 0.26/0.65 % Presaturation interreduction done
% 0.26/0.65
% 0.26/0.65 % Proof found!
% 0.26/0.65 % SZS status Unsatisfiable
% 0.26/0.65 % SZS output start CNFRefutation
% See solution above
% 0.26/0.65 % Parsed axioms : 159
% 0.26/0.65 % Removed by relevancy pruning/SinE : 0
% 0.26/0.65 % Initial clauses : 159
% 0.26/0.65 % Removed in clause preprocessing : 19
% 0.26/0.65 % Initial clauses in saturation : 140
% 0.26/0.65 % Processed clauses : 397
% 0.26/0.65 % ...of these trivial : 3
% 0.26/0.65 % ...subsumed : 6
% 0.26/0.65 % ...remaining for further processing : 388
% 0.26/0.65 % Other redundant clauses eliminated : 6
% 0.26/0.65 % Clauses deleted for lack of memory : 0
% 0.26/0.65 % Backward-subsumed : 0
% 0.26/0.65 % Backward-rewritten : 0
% 0.26/0.65 % Generated clauses : 839
% 0.26/0.65 % ...of the previous two non-redundant : 683
% 0.26/0.65 % ...aggressively subsumed : 0
% 0.26/0.65 % Contextual simplify-reflections : 0
% 0.26/0.65 % Paramodulations : 833
% 0.26/0.65 % Factorizations : 0
% 0.26/0.65 % NegExts : 0
% 0.26/0.65 % Equation resolutions : 6
% 0.26/0.65 % Disequality decompositions : 0
% 0.26/0.65 % Total rewrite steps : 152
% 0.26/0.65 % ...of those cached : 107
% 0.26/0.65 % Propositional unsat checks : 0
% 0.26/0.65 % Propositional check models : 0
% 0.26/0.65 % Propositional check unsatisfiable : 0
% 0.26/0.65 % Propositional clauses : 0
% 0.26/0.65 % Propositional clauses after purity: 0
% 0.26/0.65 % Propositional unsat core size : 0
% 0.26/0.65 % Propositional preprocessing time : 0.000
% 0.26/0.65 % Propositional encoding time : 0.000
% 0.26/0.65 % Propositional solver time : 0.000
% 0.26/0.65 % Success case prop preproc time : 0.000
% 0.26/0.65 % Success case prop encoding time : 0.000
% 0.26/0.65 % Success case prop solver time : 0.000
% 0.26/0.65 % Current number of processed clauses : 243
% 0.26/0.65 % Positive orientable unit clauses : 68
% 0.26/0.65 % Positive unorientable unit clauses: 2
% 0.26/0.65 % Negative unit clauses : 39
% 0.26/0.65 % Non-unit-clauses : 134
% 0.26/0.65 % Current number of unprocessed clauses: 561
% 0.26/0.65 % ...number of literals in the above : 1075
% 0.26/0.65 % Current number of archived formulas : 0
% 0.26/0.65 % Current number of archived clauses : 158
% 0.26/0.65 % Clause-clause subsumption calls (NU) : 3537
% 0.26/0.65 % Rec. Clause-clause subsumption calls : 2356
% 0.26/0.65 % Non-unit clause-clause subsumptions : 6
% 0.26/0.65 % Unit Clause-clause subsumption calls : 149
% 0.26/0.65 % Rewrite failures with RHS unbound : 0
% 0.26/0.65 % BW rewrite match attempts : 39
% 0.26/0.65 % BW rewrite match successes : 8
% 0.26/0.65 % Condensation attempts : 0
% 0.26/0.65 % Condensation successes : 0
% 0.26/0.65 % Termbank termtop insertions : 22890
% 0.26/0.65 % Search garbage collected termcells : 285
% 0.26/0.65
% 0.26/0.65 % -------------------------------------------------
% 0.26/0.65 % User time : 0.071 s
% 0.26/0.65 % System time : 0.009 s
% 0.26/0.65 % Total time : 0.080 s
% 0.26/0.65 % Maximum resident set size: 4028 pages
% 0.26/0.65
% 0.26/0.65 % -------------------------------------------------
% 0.26/0.65 % User time : 0.283 s
% 0.26/0.65 % System time : 0.032 s
% 0.26/0.65 % Total time : 0.315 s
% 0.26/0.65 % Maximum resident set size: 4864 pages
% 0.26/0.65 % E exiting
%------------------------------------------------------------------------------