%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU280+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 02:24:33 PM UTC 2026
% Result : Theorem 0.18s 5.59s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 42 ( 6 unt; 0 def)
% Number of atoms : 189 ( 58 equ)
% Maximal formula atoms : 70 ( 4 avg)
% Number of connectives : 226 ( 79 ~; 114 |; 28 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 6 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_tarski__e6_22__wellord2__1,axiom,
! [X1] :
( ! [X2,X3,X4] :
( ( ordinal(X4)
& X2 = X4
& ordinal(X3)
& X2 = X3 )
=> X3 = X4 )
=> ? [X2] :
! [X3] :
( in(X3,X2)
<=> ? [X4] :
( ordinal(X3)
& X4 = X3
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_tarski__e6_22__wellord2__1) ).
fof(s1_xboole_0__e6_22__wellord2,conjecture,
! [X1] :
? [X2] :
! [X3] :
( in(X3,X2)
<=> ( ordinal(X3)
& in(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_xboole_0__e6_22__wellord2) ).
fof(c_0_2,plain,
! [X16,X18,X20,X21] :
( ( esk5_0 != esk6_0
| in(X20,esk7_1(X16))
| ~ ordinal(X20)
| X21 != X20
| ~ in(X21,X16) )
& ( esk5_0 != esk6_0
| ~ in(X18,esk7_1(X16))
| ordinal(X18) )
& ( esk5_0 != esk6_0
| ~ in(X18,esk7_1(X16))
| esk8_2(X16,X18) = X18 )
& ( esk5_0 != esk6_0
| ~ in(X18,esk7_1(X16))
| in(esk8_2(X16,X18),X16) )
& ( ordinal(esk6_0)
| in(X20,esk7_1(X16))
| ~ ordinal(X20)
| X21 != X20
| ~ in(X21,X16) )
& ( ordinal(esk6_0)
| ~ in(X18,esk7_1(X16))
| ordinal(X18) )
& ( ordinal(esk6_0)
| ~ in(X18,esk7_1(X16))
| esk8_2(X16,X18) = X18 )
& ( ordinal(esk6_0)
| ~ in(X18,esk7_1(X16))
| in(esk8_2(X16,X18),X16) )
& ( esk4_0 = esk6_0
| in(X20,esk7_1(X16))
| ~ ordinal(X20)
| X21 != X20
| ~ in(X21,X16) )
& ( esk4_0 = esk6_0
| ~ in(X18,esk7_1(X16))
| ordinal(X18) )
& ( esk4_0 = esk6_0
| ~ in(X18,esk7_1(X16))
| esk8_2(X16,X18) = X18 )
& ( esk4_0 = esk6_0
| ~ in(X18,esk7_1(X16))
| in(esk8_2(X16,X18),X16) )
& ( ordinal(esk5_0)
| in(X20,esk7_1(X16))
| ~ ordinal(X20)
| X21 != X20
| ~ in(X21,X16) )
& ( ordinal(esk5_0)
| ~ in(X18,esk7_1(X16))
| ordinal(X18) )
& ( ordinal(esk5_0)
| ~ in(X18,esk7_1(X16))
| esk8_2(X16,X18) = X18 )
& ( ordinal(esk5_0)
| ~ in(X18,esk7_1(X16))
| in(esk8_2(X16,X18),X16) )
& ( esk4_0 = esk5_0
| in(X20,esk7_1(X16))
| ~ ordinal(X20)
| X21 != X20
| ~ in(X21,X16) )
& ( esk4_0 = esk5_0
| ~ in(X18,esk7_1(X16))
| ordinal(X18) )
& ( esk4_0 = esk5_0
| ~ in(X18,esk7_1(X16))
| esk8_2(X16,X18) = X18 )
& ( esk4_0 = esk5_0
| ~ in(X18,esk7_1(X16))
| in(esk8_2(X16,X18),X16) ) ),
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)],[s1_tarski__e6_22__wellord2__1])])])])])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
? [X2] :
! [X3] :
( in(X3,X2)
<=> ( ordinal(X3)
& in(X3,X1) ) ),
inference(assume_negation,[status(cth)],[s1_xboole_0__e6_22__wellord2]) ).
cnf(c_0_4,plain,
( ~ ordinal(X3)
| X1 != X3
| ~ in(X1,X2)
| esk4_0 = esk5_0
| in(X3,esk7_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
! [X6] :
( ( in(esk2_1(X6),X6)
| ordinal(esk2_1(X6)) )
& ( in(esk2_1(X6),X6)
| in(esk2_1(X6),esk1_0) )
& ( ~ ordinal(esk2_1(X6))
| ~ in(esk2_1(X6),esk1_0)
| ~ in(esk2_1(X6),X6) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| in(X1,esk7_1(X2))
| esk4_0 = esk5_0 ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( in(esk2_1(X1),X1)
| in(esk2_1(X1),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( in(esk2_1(X1),X1)
| ordinal(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( in(esk2_1(X1),X1)
| in(esk2_1(X1),esk7_1(esk1_0))
| esk4_0 = esk5_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,plain,
( ~ in(X1,esk7_1(X2))
| esk4_0 = esk5_0
| ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,plain,
( ~ in(X2,esk7_1(X1))
| esk4_0 = esk5_0
| in(esk8_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( in(esk2_1(esk7_1(esk1_0)),esk7_1(esk1_0))
| esk4_0 = esk5_0 ),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ in(X2,esk7_1(X1))
| esk4_0 = esk5_0
| esk8_2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( ~ ordinal(esk2_1(X1))
| ~ in(esk2_1(X1),esk1_0)
| ~ in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( ordinal(esk2_1(esk7_1(X1)))
| esk4_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( in(esk8_2(esk1_0,esk2_1(esk7_1(esk1_0))),esk1_0)
| esk4_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( in(esk2_1(esk7_1(X1)),esk1_0)
| esk4_0 = esk5_0
| esk8_2(X1,esk2_1(esk7_1(X1))) = esk2_1(esk7_1(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_18,plain,
( ~ ordinal(X3)
| X1 != X3
| ~ in(X1,X2)
| esk4_0 = esk6_0
| in(X3,esk7_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,negated_conjecture,
( ~ in(esk2_1(esk7_1(X1)),esk1_0)
| ~ in(esk2_1(esk7_1(X1)),esk7_1(X1))
| esk4_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( in(esk2_1(esk7_1(esk1_0)),esk1_0)
| esk4_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( esk5_0 != esk6_0
| ~ ordinal(X3)
| X1 != X3
| ~ in(X1,X2)
| in(X3,esk7_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_22,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| in(X1,esk7_1(X2))
| esk4_0 = esk6_0 ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
esk4_0 = esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_12]) ).
cnf(c_0_24,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| esk6_0 != esk5_0
| in(X1,esk7_1(X2)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| in(X1,esk7_1(X2)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,plain,
( ~ in(X1,esk7_1(X2))
| esk4_0 = esk6_0
| ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_27,plain,
( esk5_0 != esk6_0
| ~ in(X1,esk7_1(X2))
| ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_28,plain,
( ~ in(X2,esk7_1(X1))
| esk4_0 = esk6_0
| esk8_2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_29,plain,
( esk5_0 != esk6_0
| ~ in(X2,esk7_1(X1))
| esk8_2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_30,negated_conjecture,
( in(esk2_1(X1),X1)
| in(esk2_1(X1),esk7_1(esk1_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_7]),c_0_8]) ).
cnf(c_0_31,plain,
( ~ in(X1,esk7_1(X2))
| ordinal(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_23]),c_0_27]) ).
cnf(c_0_32,plain,
( ~ in(X2,esk7_1(X1))
| esk4_0 = esk6_0
| in(esk8_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_33,plain,
( esk5_0 != esk6_0
| ~ in(X2,esk7_1(X1))
| in(esk8_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_34,plain,
( ~ in(X2,esk7_1(X1))
| esk8_2(X1,X2) = X2 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_23]),c_0_29]) ).
cnf(c_0_35,negated_conjecture,
in(esk2_1(esk7_1(esk1_0)),esk7_1(esk1_0)),
inference(ef,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
ordinal(esk2_1(esk7_1(X1))),
inference(spm,[status(thm)],[c_0_31,c_0_8]) ).
cnf(c_0_37,plain,
( ~ in(X2,esk7_1(X1))
| in(esk8_2(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_23]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
esk8_2(esk1_0,esk2_1(esk7_1(esk1_0))) = esk2_1(esk7_1(esk1_0)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( ~ in(esk2_1(esk7_1(X1)),esk1_0)
| ~ in(esk2_1(esk7_1(X1)),esk7_1(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
in(esk2_1(esk7_1(esk1_0)),esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU280+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.50 % Computer : n016.cluster.edu
% 0.18/5.50 % Model : x86_64 x86_64
% 0.18/5.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.50 % Memory : 8046.5625MB
% 0.18/5.50 % OS : Linux 6.8.0-71-generic
% 0.18/5.50 % CPULimit : 300
% 0.18/5.50 % WCLimit : 300
% 0.18/5.50 % DateTime : Mon Sep 21 06:11:45 UTC 2026
% 0.18/5.51 % CPUTime :
% 0.18/5.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.55 Running first-order theorem proving
% 0.18/5.56 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.18/5.59 % Version: 3.5.1
% 0.18/5.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/5.59 % Starting new_bool_3 with 300s (1) cores
% 0.18/5.59 % Starting new_bool_1 with 300s (1) cores
% 0.18/5.59 % Starting sh5l with 300s (1) cores
% 0.18/5.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1726956 completed with status 0
% 0.18/5.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/5.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/5.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/5.59 % No SInE strategy applied
% 0.18/5.59 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.18/5.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/5.59 % Starting SubtermCWHack with 136s (1) cores
% 0.18/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/5.59 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.18/5.59 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.18/5.59 % Starting new_bool_3 with 136s (1) cores
% 0.18/5.59 % new_bool_3 with pid 1726966 completed with status 0
% 0.18/5.59 % Result found by new_bool_3
% 0.18/5.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/5.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/5.59 % No SInE strategy applied
% 0.18/5.59 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.18/5.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/5.59 % Starting SubtermCWHack with 136s (1) cores
% 0.18/5.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/5.59 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.18/5.59 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.18/5.59 % Starting new_bool_3 with 136s (1) cores
% 0.18/5.59 % Preprocessing time : 0.001 s
% 0.18/5.59 % Presaturation interreduction done
% 0.18/5.59
% 0.18/5.59 % Proof found!
% 0.18/5.59 % SZS status Theorem
% 0.18/5.59 % SZS output start CNFRefutation
% See solution above
% 0.18/5.59 % Parsed axioms : 6
% 0.18/5.59 % Removed by relevancy pruning/SinE : 0
% 0.18/5.59 % Initial clauses : 30
% 0.18/5.59 % Removed in clause preprocessing : 0
% 0.18/5.59 % Initial clauses in saturation : 30
% 0.18/5.59 % Processed clauses : 144
% 0.18/5.59 % ...of these trivial : 4
% 0.18/5.59 % ...subsumed : 19
% 0.18/5.59 % ...remaining for further processing : 121
% 0.18/5.59 % Other redundant clauses eliminated : 5
% 0.18/5.59 % Clauses deleted for lack of memory : 0
% 0.18/5.59 % Backward-subsumed : 15
% 0.18/5.59 % Backward-rewritten : 39
% 0.18/5.59 % Generated clauses : 240
% 0.18/5.59 % ...of the previous two non-redundant : 227
% 0.18/5.59 % ...aggressively subsumed : 0
% 0.18/5.59 % Contextual simplify-reflections : 9
% 0.18/5.59 % Paramodulations : 227
% 0.18/5.59 % Factorizations : 8
% 0.18/5.59 % NegExts : 0
% 0.18/5.59 % Equation resolutions : 5
% 0.18/5.59 % Disequality decompositions : 0
% 0.18/5.59 % Total rewrite steps : 62
% 0.18/5.59 % ...of those cached : 53
% 0.18/5.59 % Propositional unsat checks : 0
% 0.18/5.59 % Propositional check models : 0
% 0.18/5.59 % Propositional check unsatisfiable : 0
% 0.18/5.59 % Propositional clauses : 0
% 0.18/5.59 % Propositional clauses after purity: 0
% 0.18/5.59 % Propositional unsat core size : 0
% 0.18/5.59 % Propositional preprocessing time : 0.000
% 0.18/5.59 % Propositional encoding time : 0.000
% 0.18/5.59 % Propositional solver time : 0.000
% 0.18/5.59 % Success case prop preproc time : 0.000
% 0.18/5.59 % Success case prop encoding time : 0.000
% 0.18/5.59 % Success case prop solver time : 0.000
% 0.18/5.59 % Current number of processed clauses : 32
% 0.18/5.59 % Positive orientable unit clauses : 10
% 0.18/5.59 % Positive unorientable unit clauses: 0
% 0.18/5.59 % Negative unit clauses : 2
% 0.18/5.59 % Non-unit-clauses : 20
% 0.18/5.59 % Current number of unprocessed clauses: 131
% 0.18/5.59 % ...number of literals in the above : 468
% 0.18/5.59 % Current number of archived formulas : 0
% 0.18/5.59 % Current number of archived clauses : 84
% 0.18/5.59 % Clause-clause subsumption calls (NU) : 543
% 0.18/5.59 % Rec. Clause-clause subsumption calls : 388
% 0.18/5.59 % Non-unit clause-clause subsumptions : 41
% 0.18/5.59 % Unit Clause-clause subsumption calls : 17
% 0.18/5.59 % Rewrite failures with RHS unbound : 0
% 0.18/5.59 % BW rewrite match attempts : 4
% 0.18/5.59 % BW rewrite match successes : 3
% 0.18/5.59 % Condensation attempts : 0
% 0.18/5.59 % Condensation successes : 0
% 0.18/5.59 % Termbank termtop insertions : 5016
% 0.18/5.59 % Search garbage collected termcells : 317
% 0.18/5.59
% 0.18/5.59 % -------------------------------------------------
% 0.18/5.59 % User time : 0.011 s
% 0.18/5.59 % System time : 0.005 s
% 0.18/5.59 % Total time : 0.016 s
% 0.18/5.59 % Maximum resident set size: 3632 pages
% 0.18/5.59
% 0.18/5.59 % -------------------------------------------------
% 0.18/5.59 % User time : 0.054 s
% 0.18/5.59 % System time : 0.018 s
% 0.18/5.59 % Total time : 0.072 s
% 0.18/5.59 % Maximum resident set size: 4864 pages
% 0.18/5.59 % E exiting
%------------------------------------------------------------------------------