%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU240+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:25 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 140 ( 0 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 169 ( 64 ~; 73 |; 19 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 3 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l2_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X2,X3),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_wellord1) ).
fof(d8_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_transitive_in(X1,X2)
<=> ! [X3,X4,X5] :
( ( in(ordered_pair(X4,X5),X1)
& in(ordered_pair(X3,X4),X1)
& in(X5,X2)
& in(X4,X2)
& in(X3,X2) )
=> in(ordered_pair(X3,X5),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_relat_2) ).
fof(d16_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> is_transitive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d16_relat_2) ).
fof(t30_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X2,relation_field(X3))
& in(X1,relation_field(X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_relat_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X2,X3),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
inference(assume_negation,[status(cth)],[l2_wellord1]) ).
fof(c_0_5,negated_conjecture,
! [X10,X11,X12] :
( ( in(ordered_pair(X10,X12),esk1_0)
| ~ in(ordered_pair(X11,X12),esk1_0)
| ~ in(ordered_pair(X10,X11),esk1_0)
| transitive(esk1_0) )
& ( ~ transitive(esk1_0)
| ~ in(ordered_pair(esk2_0,esk4_0),esk1_0) )
& ( ~ transitive(esk1_0)
| in(ordered_pair(esk3_0,esk4_0),esk1_0) )
& ( ~ transitive(esk1_0)
| in(ordered_pair(esk2_0,esk3_0),esk1_0) )
& relation(esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_6,plain,
! [X24,X25,X26,X27,X28,X29] :
( ( ~ relation(X24)
| is_transitive_in(X24,X29)
| ~ in(ordered_pair(esk7_2(X24,X29),esk9_2(X24,X29)),X24) )
& ( ~ relation(X24)
| is_transitive_in(X24,X29)
| in(ordered_pair(esk8_2(X24,X29),esk9_2(X24,X29)),X24) )
& ( ~ relation(X24)
| is_transitive_in(X24,X29)
| in(ordered_pair(esk7_2(X24,X29),esk8_2(X24,X29)),X24) )
& ( ~ relation(X24)
| is_transitive_in(X24,X29)
| in(esk9_2(X24,X29),X29) )
& ( ~ relation(X24)
| is_transitive_in(X24,X29)
| in(esk8_2(X24,X29),X29) )
& ( ~ relation(X24)
| is_transitive_in(X24,X29)
| in(esk7_2(X24,X29),X29) )
& ( ~ relation(X24)
| in(ordered_pair(X26,X28),X24)
| ~ in(ordered_pair(X27,X28),X24)
| ~ in(ordered_pair(X26,X27),X24)
| ~ in(X28,X25)
| ~ in(X27,X25)
| ~ in(X26,X25)
| ~ is_transitive_in(X24,X25) ) ),
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)],[d8_relat_2])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ in(ordered_pair(X2,X3),esk1_0)
| ~ in(ordered_pair(X1,X2),esk1_0)
| in(ordered_pair(X1,X3),esk1_0)
| transitive(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ relation(X1)
| is_transitive_in(X1,X2)
| in(ordered_pair(esk8_2(X1,X2),esk9_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ relation(X1)
| ~ in(ordered_pair(esk7_2(X1,X2),esk9_2(X1,X2)),X1)
| is_transitive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( ~ in(ordered_pair(X2,esk8_2(esk1_0,X1)),esk1_0)
| in(ordered_pair(X2,esk9_2(esk1_0,X1)),esk1_0)
| transitive(esk1_0)
| is_transitive_in(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
fof(c_0_12,plain,
! [X19] :
( ( ~ relation(X19)
| transitive(X19)
| ~ is_transitive_in(X19,relation_field(X19)) )
& ( ~ relation(X19)
| is_transitive_in(X19,relation_field(X19))
| ~ transitive(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_relat_2])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ in(ordered_pair(esk7_2(esk1_0,X1),esk8_2(esk1_0,X1)),esk1_0)
| transitive(esk1_0)
| is_transitive_in(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9])]) ).
cnf(c_0_14,plain,
( ~ relation(X1)
| is_transitive_in(X1,X2)
| in(ordered_pair(esk7_2(X1,X2),esk8_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1))
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( transitive(esk1_0)
| is_transitive_in(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9])]) ).
cnf(c_0_17,negated_conjecture,
( ~ transitive(esk1_0)
| in(ordered_pair(esk3_0,esk4_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
transitive(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_9])]) ).
fof(c_0_19,plain,
! [X33,X34,X35] :
( ( ~ relation(X35)
| ~ in(ordered_pair(X33,X34),X35)
| in(X34,relation_field(X35)) )
& ( ~ relation(X35)
| ~ in(ordered_pair(X33,X34),X35)
| in(X33,relation_field(X35)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t30_relat_1])])])]) ).
cnf(c_0_20,plain,
( ~ relation(X1)
| ~ in(ordered_pair(X4,X5),X1)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(X5,X2)
| ~ in(X4,X2)
| ~ in(X3,X2)
| ~ is_transitive_in(X1,X2)
| in(ordered_pair(X3,X5),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
in(ordered_pair(esk3_0,esk4_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_22,plain,
( ~ relation(X2)
| ~ in(ordered_pair(X3,X1),X2)
| in(X1,relation_field(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( ~ relation(X2)
| ~ in(ordered_pair(X1,X3),X2)
| in(X1,relation_field(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ transitive(esk1_0)
| in(ordered_pair(esk2_0,esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
( ~ in(X1,X2)
| ~ in(esk3_0,X2)
| ~ in(esk4_0,X2)
| ~ in(ordered_pair(X1,esk3_0),esk1_0)
| ~ is_transitive_in(esk1_0,X2)
| in(ordered_pair(X1,esk4_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_9])]) ).
cnf(c_0_26,plain,
( ~ relation(X1)
| ~ transitive(X1)
| is_transitive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
in(esk4_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_9])]) ).
cnf(c_0_28,negated_conjecture,
in(esk3_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_9])]) ).
cnf(c_0_29,negated_conjecture,
in(ordered_pair(esk2_0,esk3_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_18])]) ).
cnf(c_0_30,negated_conjecture,
( ~ transitive(esk1_0)
| ~ in(ordered_pair(esk2_0,esk4_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_31,negated_conjecture,
( ~ in(X1,relation_field(esk1_0))
| ~ in(ordered_pair(X1,esk3_0),esk1_0)
| in(ordered_pair(X1,esk4_0),esk1_0) ),
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_25,c_0_26]),c_0_27]),c_0_28]),c_0_18]),c_0_9])]) ).
cnf(c_0_32,negated_conjecture,
in(esk2_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_29]),c_0_9])]) ).
cnf(c_0_33,negated_conjecture,
~ in(ordered_pair(esk2_0,esk4_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_18])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU240+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n015.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 06:05:51 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % new_bool_3 with pid 722743 completed with status 0
% 0.12/0.44 % Result found by new_bool_3
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FGHSF-FFMF21-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % SubtermCWHack with pid 722751 completed with status 0
% 0.12/0.44 % Result found by SubtermCWHack
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FGHSF-FFMF21-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Theorem
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 37
% 0.12/0.44 % Removed by relevancy pruning/SinE : 27
% 0.12/0.44 % Initial clauses : 22
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 22
% 0.12/0.44 % Processed clauses : 75
% 0.12/0.44 % ...of these trivial : 0
% 0.12/0.44 % ...subsumed : 11
% 0.12/0.44 % ...remaining for further processing : 64
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 6
% 0.12/0.44 % Backward-rewritten : 4
% 0.12/0.44 % Generated clauses : 81
% 0.12/0.44 % ...of the previous two non-redundant : 76
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 81
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 32
% 0.12/0.44 % ...of those cached : 26
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 54
% 0.12/0.44 % Positive orientable unit clauses : 8
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 10
% 0.12/0.44 % Non-unit-clauses : 36
% 0.12/0.44 % Current number of unprocessed clauses: 8
% 0.12/0.44 % ...number of literals in the above : 53
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 10
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 509
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 247
% 0.12/0.44 % Non-unit clause-clause subsumptions : 13
% 0.12/0.44 % Unit Clause-clause subsumption calls : 4
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 1
% 0.12/0.44 % BW rewrite match successes : 1
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 3420
% 0.12/0.44 % Search garbage collected termcells : 523
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.008 s
% 0.12/0.44 % System time : 0.004 s
% 0.12/0.44 % Total time : 0.012 s
% 0.12/0.44 % Maximum resident set size: 3656 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.010 s
% 0.12/0.44 % System time : 0.009 s
% 0.12/0.44 % Total time : 0.019 s
% 0.12/0.44 % Maximum resident set size: 4864 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------