%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM183-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 : n011.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.56s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 13 unt; 4 nHn; 20 RR)
% Number of literals : 48 ( 2 equ; 25 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
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(limit_ordinals,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',limit_ordinals) ).
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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(prove_ordinals_are_kind_1_or_limit_3,negated_conjecture,
~ member(x,limit_ordinals),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_3) ).
cnf(prove_ordinals_are_kind_1_or_limit_2,negated_conjecture,
~ member(x,kind_1_ordinals),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_2) ).
cnf(prove_ordinals_are_kind_1_or_limit_1,negated_conjecture,
member(x,ordinal_numbers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_1) ).
cnf(c_0_8,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_9,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_10,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_8 ).
cnf(c_0_11,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
limit_ordinals ).
cnf(c_0_12,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_9 ).
cnf(c_0_14,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_15,negated_conjecture,
~ member(x,limit_ordinals),
inference(fof_simplification,[status(thm)],[prove_ordinals_are_kind_1_or_limit_3]) ).
cnf(c_0_16,plain,
( ~ member(X1,ordinal_numbers)
| ~ member(X1,complement(kind_1_ordinals))
| member(X1,limit_ordinals) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_12 ).
cnf(c_0_18,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ member(x,kind_1_ordinals),
inference(fof_simplification,[status(thm)],[prove_ordinals_are_kind_1_or_limit_2]) ).
cnf(c_0_20,negated_conjecture,
~ member(x,limit_ordinals),
c_0_15 ).
cnf(c_0_21,plain,
( ~ member(X1,ordinal_numbers)
| member(X1,limit_ordinals)
| member(X1,kind_1_ordinals) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
member(x,ordinal_numbers),
prove_ordinals_are_kind_1_or_limit_1 ).
cnf(c_0_23,negated_conjecture,
~ member(x,kind_1_ordinals),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM183-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n011.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.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 02:10:40 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.51 Running first-order theorem proving
% 0.26/0.51 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.56 % Version: 3.5.1
% 0.26/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.56 % Starting sh5l with 300s (1) cores
% 0.26/0.56 % new_bool_1 with pid 748510 completed with status 0
% 0.26/0.56 % Result found by new_bool_1
% 0.26/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.56 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.26/0.56 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.56 % SubtermCWHack with pid 748512 completed with status 0
% 0.26/0.56 % Result found by SubtermCWHack
% 0.26/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.56 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.26/0.56 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.56 % Preprocessing time : 0.003 s
% 0.26/0.56
% 0.26/0.56 % Proof found!
% 0.26/0.56 % SZS status Unsatisfiable
% 0.26/0.56 % SZS output start CNFRefutation
% See solution above
% 0.26/0.56 % Parsed axioms : 161
% 0.26/0.56 % Removed by relevancy pruning/SinE : 108
% 0.26/0.56 % Initial clauses : 53
% 0.26/0.56 % Removed in clause preprocessing : 0
% 0.26/0.56 % Initial clauses in saturation : 53
% 0.26/0.56 % Processed clauses : 86
% 0.26/0.56 % ...of these trivial : 0
% 0.26/0.56 % ...subsumed : 7
% 0.26/0.56 % ...remaining for further processing : 79
% 0.26/0.56 % Other redundant clauses eliminated : 2
% 0.26/0.56 % Clauses deleted for lack of memory : 0
% 0.26/0.56 % Backward-subsumed : 0
% 0.26/0.56 % Backward-rewritten : 1
% 0.26/0.56 % Generated clauses : 85
% 0.26/0.56 % ...of the previous two non-redundant : 65
% 0.26/0.56 % ...aggressively subsumed : 0
% 0.26/0.56 % Contextual simplify-reflections : 1
% 0.26/0.56 % Paramodulations : 83
% 0.26/0.56 % Factorizations : 0
% 0.26/0.56 % NegExts : 0
% 0.26/0.56 % Equation resolutions : 2
% 0.26/0.56 % Disequality decompositions : 0
% 0.26/0.56 % Total rewrite steps : 8
% 0.26/0.56 % ...of those cached : 2
% 0.26/0.56 % Propositional unsat checks : 0
% 0.26/0.56 % Propositional check models : 0
% 0.26/0.56 % Propositional check unsatisfiable : 0
% 0.26/0.56 % Propositional clauses : 0
% 0.26/0.56 % Propositional clauses after purity: 0
% 0.26/0.56 % Propositional unsat core size : 0
% 0.26/0.56 % Propositional preprocessing time : 0.000
% 0.26/0.56 % Propositional encoding time : 0.000
% 0.26/0.56 % Propositional solver time : 0.000
% 0.26/0.56 % Success case prop preproc time : 0.000
% 0.26/0.56 % Success case prop encoding time : 0.000
% 0.26/0.56 % Success case prop solver time : 0.000
% 0.26/0.56 % Current number of processed clauses : 76
% 0.26/0.56 % Positive orientable unit clauses : 20
% 0.26/0.56 % Positive unorientable unit clauses: 0
% 0.26/0.56 % Negative unit clauses : 2
% 0.26/0.56 % Non-unit-clauses : 54
% 0.26/0.56 % Current number of unprocessed clauses: 32
% 0.26/0.56 % ...number of literals in the above : 86
% 0.26/0.56 % Current number of archived formulas : 0
% 0.26/0.56 % Current number of archived clauses : 1
% 0.26/0.56 % Clause-clause subsumption calls (NU) : 380
% 0.26/0.56 % Rec. Clause-clause subsumption calls : 319
% 0.26/0.56 % Non-unit clause-clause subsumptions : 8
% 0.26/0.56 % Unit Clause-clause subsumption calls : 14
% 0.26/0.56 % Rewrite failures with RHS unbound : 0
% 0.26/0.56 % BW rewrite match attempts : 5
% 0.26/0.56 % BW rewrite match successes : 1
% 0.26/0.56 % Condensation attempts : 0
% 0.26/0.56 % Condensation successes : 0
% 0.26/0.56 % Termbank termtop insertions : 3531
% 0.26/0.56 % Search garbage collected termcells : 596
% 0.26/0.56
% 0.26/0.56 % -------------------------------------------------
% 0.26/0.56 % User time : 0.009 s
% 0.26/0.56 % System time : 0.005 s
% 0.26/0.56 % Total time : 0.014 s
% 0.26/0.56 % Maximum resident set size: 3780 pages
% 0.26/0.56
% 0.26/0.56 % -------------------------------------------------
% 0.26/0.56 % User time : 0.018 s
% 0.26/0.56 % System time : 0.011 s
% 0.26/0.56 % Total time : 0.029 s
% 0.26/0.56 % Maximum resident set size: 4864 pages
% 0.26/0.56 % E exiting
%------------------------------------------------------------------------------