%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU239+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:25 PM UTC 2026
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 85 ( 34 ~; 34 |; 6 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 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/sandbox/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/sandbox/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/sandbox/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,plain,
! [X18,X19,X20,X21] :
( ( ~ relation(X18)
| is_reflexive_in(X18,X21)
| ~ in(ordered_pair(esk5_2(X18,X21),esk5_2(X18,X21)),X18) )
& ( ~ relation(X18)
| is_reflexive_in(X18,X21)
| in(esk5_2(X18,X21),X21) )
& ( ~ relation(X18)
| in(ordered_pair(X20,X20),X18)
| ~ in(X20,X19)
| ~ is_reflexive_in(X18,X19) ) ),
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])])])])])])]) ).
fof(c_0_5,plain,
! [X13] :
( ( ~ relation(X13)
| reflexive(X13)
| ~ is_reflexive_in(X13,relation_field(X13)) )
& ( ~ relation(X13)
| is_reflexive_in(X13,relation_field(X13))
| ~ reflexive(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_relat_2])])])]) ).
fof(c_0_6,negated_conjecture,
! [X6] :
( ( in(ordered_pair(X6,X6),esk1_0)
| ~ in(X6,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])])])])])]) ).
cnf(c_0_7,plain,
( ~ relation(X1)
| ~ in(X3,X2)
| ~ is_reflexive_in(X1,X2)
| in(ordered_pair(X3,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ relation(X1)
| ~ reflexive(X1)
| is_reflexive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( ~ reflexive(esk1_0)
| ~ in(ordered_pair(esk2_0,esk2_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ in(X1,relation_field(X2))
| ~ relation(X2)
| ~ reflexive(X2)
| in(ordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ reflexive(esk1_0)
| in(esk2_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ relation(X1)
| ~ in(ordered_pair(esk5_2(X1,X2),esk5_2(X1,X2)),X1)
| is_reflexive_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,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_6]) ).
cnf(c_0_15,negated_conjecture,
~ reflexive(esk1_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ in(esk5_2(esk1_0,X1),relation_field(esk1_0))
| is_reflexive_in(esk1_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11])]),c_0_15]) ).
cnf(c_0_17,plain,
( ~ relation(X1)
| is_reflexive_in(X1,X2)
| in(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,plain,
( ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1))
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
is_reflexive_in(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_11])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU239+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n001.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 06:07:58 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % new_bool_3 with pid 2352868 completed with status 0
% 0.15/0.44 % Result found by new_bool_3
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % SubtermCWHack with pid 2352871 completed with status 0
% 0.15/0.44 % Result found by SubtermCWHack
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Theorem
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 36
% 0.15/0.44 % Removed by relevancy pruning/SinE : 27
% 0.15/0.44 % Initial clauses : 15
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 15
% 0.15/0.44 % Processed clauses : 35
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 1
% 0.15/0.44 % ...remaining for further processing : 34
% 0.15/0.44 % Other redundant clauses eliminated : 0
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 7
% 0.15/0.44 % Backward-rewritten : 0
% 0.15/0.44 % Generated clauses : 33
% 0.15/0.44 % ...of the previous two non-redundant : 28
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 1
% 0.15/0.44 % Paramodulations : 33
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 0
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 6
% 0.15/0.44 % ...of those cached : 5
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 27
% 0.15/0.44 % Positive orientable unit clauses : 3
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 4
% 0.15/0.44 % Non-unit-clauses : 20
% 0.15/0.44 % Current number of unprocessed clauses: 6
% 0.15/0.44 % ...number of literals in the above : 34
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 7
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 71
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 37
% 0.15/0.44 % Non-unit clause-clause subsumptions : 4
% 0.15/0.44 % Unit Clause-clause subsumption calls : 5
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 0
% 0.15/0.44 % BW rewrite match successes : 0
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 1754
% 0.15/0.44 % Search garbage collected termcells : 352
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.004 s
% 0.15/0.44 % System time : 0.002 s
% 0.15/0.44 % Total time : 0.007 s
% 0.15/0.44 % Maximum resident set size: 3652 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.008 s
% 0.15/0.44 % System time : 0.005 s
% 0.15/0.44 % Total time : 0.013 s
% 0.15/0.44 % Maximum resident set size: 4608 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------