%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM394+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:48:58 PM UTC 2026
% Result : Theorem 0.26s 0.55s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 88 ( 6 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 98 ( 39 ~; 33 |; 13 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 35 ( 1 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t26_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X2,X1)
| ordinal_subset(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_ordinal1) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X2,X1)
& X1 != X2
& ~ in(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X2)
& ordinal(X1) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_connected(X1)
& epsilon_transitive(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X2,X1)
| ordinal_subset(X1,X2) ) ) ),
inference(assume_negation,[status(cth)],[t26_ordinal1]) ).
fof(c_0_7,plain,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X2,X1)
& X1 != X2
& ~ in(X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[t24_ordinal1]) ).
fof(c_0_8,negated_conjecture,
( ~ in(esk2_0,esk1_0)
& ~ ordinal_subset(esk1_0,esk2_0)
& ordinal(esk2_0)
& ordinal(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X28,X29] :
( ( ~ ordinal(X29)
| ~ ordinal(X28)
| ordinal_subset(X28,X29)
| ~ subset(X28,X29) )
& ( ~ ordinal(X29)
| ~ ordinal(X28)
| subset(X28,X29)
| ~ ordinal_subset(X28,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])])]) ).
fof(c_0_10,plain,
! [X8,X9,X10] :
( ( epsilon_transitive(X10)
| ~ subset(esk3_1(X10),X10) )
& ( epsilon_transitive(X10)
| in(esk3_1(X10),X10) )
& ( subset(X9,X8)
| ~ in(X9,X8)
| ~ epsilon_transitive(X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_ordinal1])])])])])])]) ).
fof(c_0_11,plain,
! [X32] :
( ( ~ ordinal(X32)
| epsilon_connected(X32) )
& ( ~ ordinal(X32)
| epsilon_transitive(X32) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])])]) ).
fof(c_0_12,plain,
! [X14,X15] :
( in(X15,X14)
| X14 = X15
| in(X14,X15)
| ~ ordinal(X15)
| ~ ordinal(X14) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_13,negated_conjecture,
~ ordinal_subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2)
| ordinal_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( ~ in(X2,X1)
| ~ epsilon_transitive(X1)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ ordinal(X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| in(X2,X1)
| X1 = X2
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
~ subset(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_21,plain,
( ~ in(X1,X2)
| ~ ordinal(X2)
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ ordinal(X1)
| in(X1,esk2_0)
| in(esk2_0,X1)
| X1 = esk2_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
~ in(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
~ in(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15])]) ).
fof(c_0_25,plain,
! [X35] : subset(X35,X35),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_26,negated_conjecture,
esk2_0 = esk1_0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM394+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.43 % Computer : n001.cluster.edu
% 0.19/0.43 % Model : x86_64 x86_64
% 0.19/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.43 % Memory : 8046.5625MB
% 0.19/0.43 % 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:32:28 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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/benchmark/theBenchmark.p
% 0.26/0.55 % Version: 3.5.1
% 0.26/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55 % Starting sh5l with 300s (1) cores
% 0.26/0.55 % sh5l with pid 1997006 completed with status 0
% 0.26/0.55 % Result found by sh5l
% 0.26/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55 % Starting sh5l with 300s (1) cores
% 0.26/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.55 % Search class: FGHSS-FFMM11-SFFFFFNN
% 0.26/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.55 % SubtermCWHack with pid 1997007 completed with status 0
% 0.26/0.55 % Result found by SubtermCWHack
% 0.26/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55 % Starting sh5l with 300s (1) cores
% 0.26/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.55 % Search class: FGHSS-FFMM11-SFFFFFNN
% 0.26/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.55 % Preprocessing time : 0.002 s
% 0.26/0.55
% 0.26/0.55 % Proof found!
% 0.26/0.55 % SZS status Theorem
% 0.26/0.55 % SZS output start CNFRefutation
% See solution above
% 0.26/0.55 % Parsed axioms : 36
% 0.26/0.55 % Removed by relevancy pruning/SinE : 1
% 0.26/0.55 % Initial clauses : 60
% 0.26/0.55 % Removed in clause preprocessing : 2
% 0.26/0.55 % Initial clauses in saturation : 58
% 0.26/0.55 % Processed clauses : 144
% 0.26/0.55 % ...of these trivial : 3
% 0.26/0.55 % ...subsumed : 23
% 0.26/0.55 % ...remaining for further processing : 118
% 0.26/0.55 % Other redundant clauses eliminated : 0
% 0.26/0.55 % Clauses deleted for lack of memory : 0
% 0.26/0.55 % Backward-subsumed : 1
% 0.26/0.55 % Backward-rewritten : 30
% 0.26/0.55 % Generated clauses : 141
% 0.26/0.55 % ...of the previous two non-redundant : 126
% 0.26/0.55 % ...aggressively subsumed : 0
% 0.26/0.55 % Contextual simplify-reflections : 3
% 0.26/0.55 % Paramodulations : 141
% 0.26/0.55 % Factorizations : 0
% 0.26/0.55 % NegExts : 0
% 0.26/0.55 % Equation resolutions : 0
% 0.26/0.55 % Disequality decompositions : 0
% 0.26/0.55 % Total rewrite steps : 69
% 0.26/0.55 % ...of those cached : 52
% 0.26/0.55 % Propositional unsat checks : 0
% 0.26/0.55 % Propositional check models : 0
% 0.26/0.55 % Propositional check unsatisfiable : 0
% 0.26/0.55 % Propositional clauses : 0
% 0.26/0.55 % Propositional clauses after purity: 0
% 0.26/0.55 % Propositional unsat core size : 0
% 0.26/0.55 % Propositional preprocessing time : 0.000
% 0.26/0.55 % Propositional encoding time : 0.000
% 0.26/0.55 % Propositional solver time : 0.000
% 0.26/0.55 % Success case prop preproc time : 0.000
% 0.26/0.55 % Success case prop encoding time : 0.000
% 0.26/0.55 % Success case prop solver time : 0.000
% 0.26/0.55 % Current number of processed clauses : 87
% 0.26/0.55 % Positive orientable unit clauses : 29
% 0.26/0.55 % Positive unorientable unit clauses: 0
% 0.26/0.55 % Negative unit clauses : 2
% 0.26/0.55 % Non-unit-clauses : 56
% 0.26/0.55 % Current number of unprocessed clauses: 27
% 0.26/0.55 % ...number of literals in the above : 83
% 0.26/0.55 % Current number of archived formulas : 0
% 0.26/0.55 % Current number of archived clauses : 31
% 0.26/0.55 % Clause-clause subsumption calls (NU) : 494
% 0.26/0.55 % Rec. Clause-clause subsumption calls : 417
% 0.26/0.55 % Non-unit clause-clause subsumptions : 27
% 0.26/0.55 % Unit Clause-clause subsumption calls : 134
% 0.26/0.55 % Rewrite failures with RHS unbound : 0
% 0.26/0.55 % BW rewrite match attempts : 5
% 0.26/0.55 % BW rewrite match successes : 5
% 0.26/0.55 % Condensation attempts : 0
% 0.26/0.55 % Condensation successes : 0
% 0.26/0.55 % Termbank termtop insertions : 4296
% 0.26/0.55 % Search garbage collected termcells : 494
% 0.26/0.55
% 0.26/0.55 % -------------------------------------------------
% 0.26/0.55 % User time : 0.016 s
% 0.26/0.55 % System time : 0.003 s
% 0.26/0.55 % Total time : 0.018 s
% 0.26/0.55 % Maximum resident set size: 3656 pages
% 0.26/0.55
% 0.26/0.55 % -------------------------------------------------
% 0.26/0.55 % User time : 0.020 s
% 0.26/0.55 % System time : 0.007 s
% 0.26/0.55 % Total time : 0.027 s
% 0.26/0.55 % Maximum resident set size: 4864 pages
% 0.26/0.55 % E exiting
%------------------------------------------------------------------------------