%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU239+2 : 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 : 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:25 PM UTC 2026
% Result : Theorem 0.14s 0.98s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 88 ( 34 ~; 37 |; 6 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l1_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> ! [X2] :
( in(X2,relation_field(X1))
=> in(ordered_pair(X2,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_wellord1) ).
fof(d1_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_reflexive_in(X1,X2)
<=> ! [X3] :
( in(X3,X2)
=> in(ordered_pair(X3,X3),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_relat_2) ).
fof(d9_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> is_reflexive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_relat_2) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> ! [X2] :
( in(X2,relation_field(X1))
=> in(ordered_pair(X2,X2),X1) ) ) ),
inference(assume_negation,[status(cth)],[l1_wellord1]) ).
fof(c_0_4,negated_conjecture,
! [X9] :
( ( in(ordered_pair(X9,X9),esk1_0)
| ~ in(X9,relation_field(esk1_0))
| reflexive(esk1_0) )
& ( ~ reflexive(esk1_0)
| ~ in(ordered_pair(esk2_0,esk2_0),esk1_0) )
& ( ~ reflexive(esk1_0)
| in(esk2_0,relation_field(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_3])])])])])]) ).
fof(c_0_5,plain,
! [X167,X168,X169,X170] :
( ( ~ relation(X167)
| is_reflexive_in(X167,X170)
| ~ in(ordered_pair(esk30_2(X167,X170),esk30_2(X167,X170)),X167) )
& ( ~ relation(X167)
| is_reflexive_in(X167,X170)
| in(esk30_2(X167,X170),X170) )
& ( ~ relation(X167)
| in(ordered_pair(X169,X169),X167)
| ~ in(X169,X168)
| ~ is_reflexive_in(X167,X168) ) ),
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)],[d1_relat_2])])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ in(X1,relation_field(esk1_0))
| in(ordered_pair(X1,X1),esk1_0)
| reflexive(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ relation(X1)
| is_reflexive_in(X1,X2)
| in(esk30_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X80] :
( ( ~ relation(X80)
| reflexive(X80)
| ~ is_reflexive_in(X80,relation_field(X80)) )
& ( ~ relation(X80)
| is_reflexive_in(X80,relation_field(X80))
| ~ reflexive(X80) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_relat_2])])])]) ).
cnf(c_0_9,plain,
( ~ relation(X1)
| ~ in(ordered_pair(esk30_2(X1,X2),esk30_2(X1,X2)),X1)
| is_reflexive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( ~ relation(X1)
| in(ordered_pair(esk30_2(X1,relation_field(esk1_0)),esk30_2(X1,relation_field(esk1_0))),esk1_0)
| is_reflexive_in(X1,relation_field(esk1_0))
| reflexive(esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1))
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( is_reflexive_in(esk1_0,relation_field(esk1_0))
| reflexive(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,plain,
( ~ relation(X1)
| ~ in(X3,X2)
| ~ is_reflexive_in(X1,X2)
| in(ordered_pair(X3,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( ~ relation(X1)
| ~ reflexive(X1)
| is_reflexive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( ~ reflexive(esk1_0)
| in(esk2_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
reflexive(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11])]) ).
cnf(c_0_18,negated_conjecture,
( ~ reflexive(esk1_0)
| ~ in(ordered_pair(esk2_0,esk2_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,plain,
( ~ in(X1,relation_field(X2))
| ~ relation(X2)
| ~ reflexive(X2)
| in(ordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
in(esk2_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
~ in(ordered_pair(esk2_0,esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_11])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU239+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.51 % Computer : n016.cluster.edu
% 0.09/0.51 % Model : x86_64 x86_64
% 0.09/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.51 % Memory : 8046.5625MB
% 0.09/0.51 % OS : Linux 6.8.0-71-generic
% 0.09/0.51 % CPULimit : 300
% 0.09/0.51 % WCLimit : 300
% 0.09/0.51 % DateTime : Mon Sep 21 06:07:23 UTC 2026
% 0.09/0.51 % CPUTime :
% 0.09/0.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.55 Running first-order theorem proving
% 0.09/0.55 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.14/0.98 % Version: 3.5.1
% 0.14/0.98 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.98 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.98 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.98 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.98 % Starting sh5l with 300s (1) cores
% 0.14/0.98 % new_bool_3 with pid 1720482 completed with status 0
% 0.14/0.98 % Result found by new_bool_3
% 0.14/0.98 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.98 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.98 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.98 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.98 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.98 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.98 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.98 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.98 % SubtermCWHack with pid 1720485 completed with status 0
% 0.14/0.98 % Result found by SubtermCWHack
% 0.14/0.98 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.98 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.98 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.98 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.98 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.98 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.98 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.98 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.98 % Preprocessing time : 0.003 s
% 0.14/0.98
% 0.14/0.98 % Proof found!
% 0.14/0.98 % SZS status Theorem
% 0.14/0.98 % SZS output start CNFRefutation
% See solution above
% 0.14/0.98 % Parsed axioms : 283
% 0.14/0.98 % Removed by relevancy pruning/SinE : 189
% 0.14/0.98 % Initial clauses : 167
% 0.14/0.98 % Removed in clause preprocessing : 2
% 0.14/0.98 % Initial clauses in saturation : 165
% 0.14/0.98 % Processed clauses : 5368
% 0.14/0.98 % ...of these trivial : 42
% 0.14/0.98 % ...subsumed : 4204
% 0.14/0.98 % ...remaining for further processing : 1122
% 0.14/0.98 % Other redundant clauses eliminated : 59
% 0.14/0.98 % Clauses deleted for lack of memory : 0
% 0.14/0.98 % Backward-subsumed : 51
% 0.14/0.98 % Backward-rewritten : 50
% 0.14/0.98 % Generated clauses : 26829
% 0.14/0.98 % ...of the previous two non-redundant : 24467
% 0.14/0.98 % ...aggressively subsumed : 0
% 0.14/0.98 % Contextual simplify-reflections : 12
% 0.14/0.98 % Paramodulations : 26746
% 0.14/0.98 % Factorizations : 18
% 0.14/0.98 % NegExts : 0
% 0.14/0.98 % Equation resolutions : 61
% 0.14/0.98 % Disequality decompositions : 0
% 0.14/0.98 % Total rewrite steps : 5431
% 0.14/0.98 % ...of those cached : 5032
% 0.14/0.98 % Propositional unsat checks : 0
% 0.14/0.98 % Propositional check models : 0
% 0.14/0.98 % Propositional check unsatisfiable : 0
% 0.14/0.98 % Propositional clauses : 0
% 0.14/0.98 % Propositional clauses after purity: 0
% 0.14/0.98 % Propositional unsat core size : 0
% 0.14/0.98 % Propositional preprocessing time : 0.000
% 0.14/0.98 % Propositional encoding time : 0.000
% 0.14/0.98 % Propositional solver time : 0.000
% 0.14/0.98 % Success case prop preproc time : 0.000
% 0.14/0.98 % Success case prop encoding time : 0.000
% 0.14/0.98 % Success case prop solver time : 0.000
% 0.14/0.98 % Current number of processed clauses : 995
% 0.14/0.99 % Positive orientable unit clauses : 102
% 0.14/0.99 % Positive unorientable unit clauses: 3
% 0.14/0.99 % Negative unit clauses : 224
% 0.14/0.99 % Non-unit-clauses : 666
% 0.14/0.99 % Current number of unprocessed clauses: 19029
% 0.14/0.99 % ...number of literals in the above : 56660
% 0.14/0.99 % Current number of archived formulas : 0
% 0.14/0.99 % Current number of archived clauses : 106
% 0.14/0.99 % Clause-clause subsumption calls (NU) : 46299
% 0.14/0.99 % Rec. Clause-clause subsumption calls : 35239
% 0.14/0.99 % Non-unit clause-clause subsumptions : 1683
% 0.14/0.99 % Unit Clause-clause subsumption calls : 16408
% 0.14/0.99 % Rewrite failures with RHS unbound : 0
% 0.14/0.99 % BW rewrite match attempts : 95
% 0.14/0.99 % BW rewrite match successes : 23
% 0.14/0.99 % Condensation attempts : 0
% 0.14/0.99 % Condensation successes : 0
% 0.14/0.99 % Termbank termtop insertions : 265539
% 0.14/0.99 % Search garbage collected termcells : 3808
% 0.14/0.99
% 0.14/0.99 % -------------------------------------------------
% 0.14/0.99 % User time : 0.383 s
% 0.14/0.99 % System time : 0.019 s
% 0.14/0.99 % Total time : 0.402 s
% 0.14/0.99 % Maximum resident set size: 4184 pages
% 0.14/0.99
% 0.14/0.99 % -------------------------------------------------
% 0.14/0.99 % User time : 0.392 s
% 0.14/0.99 % System time : 0.023 s
% 0.14/0.99 % Total time : 0.414 s
% 0.14/0.99 % Maximum resident set size: 4864 pages
% 0.14/0.99 % E exiting
%------------------------------------------------------------------------------