%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU275+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 : 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 02:24:32 PM UTC 2026
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 15 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 73 ( 30 ~; 27 |; 10 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 24 ( 4 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t7_wellord2,conjecture,
! [X1] :
( ordinal(X1)
=> well_ordering(inclusion_relation(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_wellord2) ).
fof(d4_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( well_founded_relation(X1)
& connected(X1)
& antisymmetric(X1)
& transitive(X1)
& reflexive(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_wellord1) ).
fof(t6_wellord2,axiom,
! [X1] :
( ordinal(X1)
=> well_founded_relation(inclusion_relation(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_wellord2) ).
fof(t5_wellord2,axiom,
! [X1] : antisymmetric(inclusion_relation(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_wellord2) ).
fof(t3_wellord2,axiom,
! [X1] : transitive(inclusion_relation(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_wellord2) ).
fof(t2_wellord2,axiom,
! [X1] : reflexive(inclusion_relation(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_wellord2) ).
fof(dt_k1_wellord2,axiom,
! [X1] : relation(inclusion_relation(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_wellord2) ).
fof(t4_wellord2,axiom,
! [X1] :
( ordinal(X1)
=> connected(inclusion_relation(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_wellord2) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> well_ordering(inclusion_relation(X1)) ),
inference(assume_negation,[status(cth)],[t7_wellord2]) ).
fof(c_0_9,plain,
! [X3] :
( ( ~ relation(X3)
| well_ordering(X3)
| ~ well_founded_relation(X3)
| ~ connected(X3)
| ~ antisymmetric(X3)
| ~ transitive(X3)
| ~ reflexive(X3) )
& ( ~ relation(X3)
| ~ well_ordering(X3)
| well_founded_relation(X3) )
& ( ~ relation(X3)
| ~ well_ordering(X3)
| connected(X3) )
& ( ~ relation(X3)
| ~ well_ordering(X3)
| antisymmetric(X3) )
& ( ~ relation(X3)
| ~ well_ordering(X3)
| transitive(X3) )
& ( ~ relation(X3)
| ~ well_ordering(X3)
| reflexive(X3) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])])]) ).
fof(c_0_10,plain,
! [X9] :
( well_founded_relation(inclusion_relation(X9))
| ~ ordinal(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_wellord2])])]) ).
fof(c_0_11,plain,
! [X8] : antisymmetric(inclusion_relation(X8)),
inference(variable_rename,[status(thm)],[t5_wellord2]) ).
fof(c_0_12,plain,
! [X6] : transitive(inclusion_relation(X6)),
inference(variable_rename,[status(thm)],[t3_wellord2]) ).
fof(c_0_13,plain,
! [X5] : reflexive(inclusion_relation(X5)),
inference(variable_rename,[status(thm)],[t2_wellord2]) ).
fof(c_0_14,plain,
! [X4] : relation(inclusion_relation(X4)),
inference(variable_rename,[status(thm)],[dt_k1_wellord2]) ).
fof(c_0_15,plain,
! [X7] :
( connected(inclusion_relation(X7))
| ~ ordinal(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_wellord2])])]) ).
fof(c_0_16,negated_conjecture,
( ~ well_ordering(inclusion_relation(esk1_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_8])])])]) ).
cnf(c_0_17,plain,
( ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1)
| well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ ordinal(X1)
| well_founded_relation(inclusion_relation(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
antisymmetric(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
transitive(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
reflexive(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
relation(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ ordinal(X1)
| connected(inclusion_relation(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
~ well_ordering(inclusion_relation(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( ~ ordinal(X1)
| well_ordering(inclusion_relation(X1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU275+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 % Computer : n001.cluster.edu
% 0.16/0.45 % Model : x86_64 x86_64
% 0.16/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.45 % Memory : 8046.5625MB
% 0.16/0.45 % OS : Linux 6.8.0-71-generic
% 0.16/0.45 % CPULimit : 300
% 0.16/0.45 % WCLimit : 300
% 0.16/0.45 % DateTime : Mon Sep 21 06:12:14 UTC 2026
% 0.16/0.45 % CPUTime :
% 0.16/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.52 Running first-order theorem proving
% 0.22/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.22/0.55 % Version: 3.5.1
% 0.22/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 % Starting sh5l with 300s (1) cores
% 0.22/0.55 % sh5l with pid 2359370 completed with status 0
% 0.22/0.55 % Result found by sh5l
% 0.22/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 % Starting sh5l with 300s (1) cores
% 0.22/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.55 % Search class: FHUNM-FFSS11-SFFFFFNN
% 0.22/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.55 % SubtermCWHack with pid 2359371 completed with status 0
% 0.22/0.55 % Result found by SubtermCWHack
% 0.22/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 % Starting sh5l with 300s (1) cores
% 0.22/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.55 % Search class: FHUNM-FFSS11-SFFFFFNN
% 0.22/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.55 % Preprocessing time : 0.002 s
% 0.22/0.55
% 0.22/0.55 % Proof found!
% 0.22/0.55 % SZS status Theorem
% 0.22/0.55 % SZS output start CNFRefutation
% See solution above
% 0.22/0.55 % Parsed axioms : 11
% 0.22/0.55 % Removed by relevancy pruning/SinE : 0
% 0.22/0.55 % Initial clauses : 20
% 0.22/0.55 % Removed in clause preprocessing : 0
% 0.22/0.55 % Initial clauses in saturation : 20
% 0.22/0.55 % Processed clauses : 21
% 0.22/0.55 % ...of these trivial : 0
% 0.22/0.55 % ...subsumed : 0
% 0.22/0.55 % ...remaining for further processing : 21
% 0.22/0.55 % Other redundant clauses eliminated : 0
% 0.22/0.55 % Clauses deleted for lack of memory : 0
% 0.22/0.55 % Backward-subsumed : 0
% 0.22/0.55 % Backward-rewritten : 0
% 0.22/0.55 % Generated clauses : 5
% 0.22/0.55 % ...of the previous two non-redundant : 1
% 0.22/0.55 % ...aggressively subsumed : 0
% 0.22/0.55 % Contextual simplify-reflections : 1
% 0.22/0.55 % Paramodulations : 5
% 0.22/0.55 % Factorizations : 0
% 0.22/0.55 % NegExts : 0
% 0.22/0.55 % Equation resolutions : 0
% 0.22/0.55 % Disequality decompositions : 0
% 0.22/0.55 % Total rewrite steps : 7
% 0.22/0.55 % ...of those cached : 0
% 0.22/0.55 % Propositional unsat checks : 0
% 0.22/0.55 % Propositional check models : 0
% 0.22/0.55 % Propositional check unsatisfiable : 0
% 0.22/0.55 % Propositional clauses : 0
% 0.22/0.55 % Propositional clauses after purity: 0
% 0.22/0.55 % Propositional unsat core size : 0
% 0.22/0.55 % Propositional preprocessing time : 0.000
% 0.22/0.55 % Propositional encoding time : 0.000
% 0.22/0.55 % Propositional solver time : 0.000
% 0.22/0.55 % Success case prop preproc time : 0.000
% 0.22/0.55 % Success case prop encoding time : 0.000
% 0.22/0.55 % Success case prop solver time : 0.000
% 0.22/0.55 % Current number of processed clauses : 21
% 0.22/0.55 % Positive orientable unit clauses : 8
% 0.22/0.55 % Positive unorientable unit clauses: 0
% 0.22/0.55 % Negative unit clauses : 1
% 0.22/0.55 % Non-unit-clauses : 12
% 0.22/0.55 % Current number of unprocessed clauses: 0
% 0.22/0.55 % ...number of literals in the above : 0
% 0.22/0.55 % Current number of archived formulas : 0
% 0.22/0.55 % Current number of archived clauses : 0
% 0.22/0.55 % Clause-clause subsumption calls (NU) : 3
% 0.22/0.55 % Rec. Clause-clause subsumption calls : 3
% 0.22/0.55 % Non-unit clause-clause subsumptions : 1
% 0.22/0.55 % Unit Clause-clause subsumption calls : 0
% 0.22/0.55 % Rewrite failures with RHS unbound : 0
% 0.22/0.55 % BW rewrite match attempts : 0
% 0.22/0.55 % BW rewrite match successes : 0
% 0.22/0.55 % Condensation attempts : 0
% 0.22/0.55 % Condensation successes : 0
% 0.22/0.55 % Termbank termtop insertions : 1006
% 0.22/0.55 % Search garbage collected termcells : 157
% 0.22/0.55
% 0.22/0.55 % -------------------------------------------------
% 0.22/0.55 % User time : 0.003 s
% 0.22/0.55 % System time : 0.004 s
% 0.22/0.55 % Total time : 0.007 s
% 0.22/0.55 % Maximum resident set size: 3636 pages
% 0.22/0.55
% 0.22/0.55 % -------------------------------------------------
% 0.22/0.55 % User time : 0.004 s
% 0.22/0.55 % System time : 0.011 s
% 0.22/0.55 % Total time : 0.015 s
% 0.22/0.55 % Maximum resident set size: 4608 pages
% 0.22/0.55 % E exiting
%------------------------------------------------------------------------------