%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU243+2 : 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 : n011.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:28:42 PM UTC 2026
% Result : Theorem 36.90s 5.58s
% Output : CNFRefutation 36.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 4 unt; 0 def)
% Number of atoms : 137 ( 16 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 184 ( 76 ~; 74 |; 22 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_well_founded_in(X1,X2)
<=> ! [X3] :
~ ( ! [X4] :
~ ( disjoint(fiber(X1,X4),X3)
& in(X4,X3) )
& X3 != empty_set
& subset(X3,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_wellord1) ).
fof(d2_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> ! [X2] :
~ ( ! [X3] :
~ ( disjoint(fiber(X1,X3),X2)
& in(X3,X2) )
& X2 != empty_set
& subset(X2,relation_field(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_wellord1) ).
fof(t5_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> is_well_founded_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_wellord1) ).
fof(c_0_3,plain,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_well_founded_in(X1,X2)
<=> ! [X3] :
~ ( ! [X4] :
~ ( disjoint(fiber(X1,X4),X3)
& in(X4,X3) )
& X3 != empty_set
& subset(X3,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d3_wellord1]) ).
fof(c_0_4,plain,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> ! [X2] :
~ ( ! [X3] :
~ ( disjoint(fiber(X1,X3),X2)
& in(X3,X2) )
& X2 != empty_set
& subset(X2,relation_field(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[d2_wellord1]) ).
fof(c_0_5,plain,
! [X8,X9,X10,X12,X14] :
( ( ~ relation(X8)
| is_well_founded_in(X8,X12)
| ~ disjoint(fiber(X8,X14),esk3_2(X8,X12))
| ~ in(X14,esk3_2(X8,X12)) )
& ( ~ relation(X8)
| is_well_founded_in(X8,X12)
| esk3_2(X8,X12) != empty_set )
& ( ~ relation(X8)
| is_well_founded_in(X8,X12)
| subset(esk3_2(X8,X12),X12) )
& ( ~ relation(X8)
| ~ is_well_founded_in(X8,X9)
| X10 = empty_set
| ~ subset(X10,X9)
| disjoint(fiber(X8,esk2_3(X8,X9,X10)),X10) )
& ( ~ relation(X8)
| ~ is_well_founded_in(X8,X9)
| X10 = empty_set
| ~ subset(X10,X9)
| in(esk2_3(X8,X9,X10),X10) ) ),
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)],[c_0_3])])])])])])]) ).
fof(c_0_6,plain,
! [X19,X20,X23] :
( ( ~ relation(X19)
| well_founded_relation(X19)
| ~ disjoint(fiber(X19,X23),esk5_1(X19))
| ~ in(X23,esk5_1(X19)) )
& ( ~ relation(X19)
| well_founded_relation(X19)
| esk5_1(X19) != empty_set )
& ( ~ relation(X19)
| well_founded_relation(X19)
| subset(esk5_1(X19),relation_field(X19)) )
& ( ~ relation(X19)
| ~ well_founded_relation(X19)
| X20 = empty_set
| ~ subset(X20,relation_field(X19))
| disjoint(fiber(X19,esk4_2(X19,X20)),X20) )
& ( ~ relation(X19)
| ~ well_founded_relation(X19)
| X20 = empty_set
| ~ subset(X20,relation_field(X19))
| in(esk4_2(X19,X20),X20) ) ),
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_7,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> is_well_founded_in(X1,relation_field(X1)) ) ),
inference(assume_negation,[status(cth)],[t5_wellord1]) ).
cnf(c_0_8,plain,
( ~ relation(X2)
| ~ disjoint(fiber(X2,X1),esk3_2(X2,X3))
| ~ in(X1,esk3_2(X2,X3))
| is_well_founded_in(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ subset(X2,relation_field(X1))
| X2 = empty_set
| disjoint(fiber(X1,esk4_2(X1,X2)),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ subset(X2,relation_field(X1))
| X2 = empty_set
| in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ relation(X1)
| esk3_2(X1,X2) != empty_set
| is_well_founded_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,negated_conjecture,
( ( is_well_founded_in(esk1_0,relation_field(esk1_0))
| well_founded_relation(esk1_0) )
& ( ~ is_well_founded_in(esk1_0,relation_field(esk1_0))
| ~ well_founded_relation(esk1_0) )
& relation(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_13,plain,
( ~ relation(X1)
| ~ subset(esk3_2(X1,X2),relation_field(X1))
| ~ well_founded_relation(X1)
| is_well_founded_in(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
( ~ relation(X1)
| is_well_founded_in(X1,X2)
| subset(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( ~ relation(X2)
| ~ disjoint(fiber(X2,X1),esk5_1(X2))
| ~ in(X1,esk5_1(X2))
| well_founded_relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( ~ relation(X1)
| ~ is_well_founded_in(X1,X2)
| ~ subset(X3,X2)
| X3 = empty_set
| disjoint(fiber(X1,esk2_3(X1,X2,X3)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( ~ relation(X1)
| ~ is_well_founded_in(X1,X2)
| ~ subset(X3,X2)
| X3 = empty_set
| in(esk2_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( ~ relation(X1)
| esk5_1(X1) != empty_set
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_well_founded_in(esk1_0,relation_field(esk1_0))
| ~ well_founded_relation(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ relation(X1)
| ~ well_founded_relation(X1)
| is_well_founded_in(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ relation(X1)
| ~ subset(esk5_1(X1),X2)
| ~ is_well_founded_in(X1,X2)
| well_founded_relation(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| well_founded_relation(X1)
| subset(esk5_1(X1),relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( is_well_founded_in(esk1_0,relation_field(esk1_0))
| well_founded_relation(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
~ well_founded_relation(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
( ~ relation(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| well_founded_relation(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
is_well_founded_in(esk1_0,relation_field(esk1_0)),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_21])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU243+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n011.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 06:02:55 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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
% 36.90/5.58 % Version: 3.5.1
% 36.90/5.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 36.90/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.90/5.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 36.90/5.58 % Starting new_bool_3 with 300s (1) cores
% 36.90/5.58 % Starting new_bool_1 with 300s (1) cores
% 36.90/5.58 % Starting sh5l with 300s (1) cores
% 36.90/5.58 % new_bool_3 with pid 1130460 completed with status 0
% 36.90/5.58 % Result found by new_bool_3
% 36.90/5.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 36.90/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.90/5.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 36.90/5.58 % Starting new_bool_3 with 300s (1) cores
% 36.90/5.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 36.90/5.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.90/5.58 % Search class: FGHSM-FSLM31-SFFFFFNN
% 36.90/5.58 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 36.90/5.58 % Starting SubtermCWHack with 28s (1) cores
% 36.90/5.58 % SubtermCWHack with pid 1130464 completed with status 0
% 36.90/5.58 % Result found by SubtermCWHack
% 36.90/5.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 36.90/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.90/5.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 36.90/5.58 % Starting new_bool_3 with 300s (1) cores
% 36.90/5.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 36.90/5.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.90/5.58 % Search class: FGHSM-FSLM31-SFFFFFNN
% 36.90/5.58 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 36.90/5.58 % Starting SubtermCWHack with 28s (1) cores
% 36.90/5.58 % Preprocessing time : 0.005 s
% 36.90/5.58
% 36.90/5.58 % Proof found!
% 36.90/5.58 % SZS status Theorem
% 36.90/5.58 % SZS output start CNFRefutation
% See solution above
% 36.90/5.58 % Parsed axioms : 296
% 36.90/5.58 % Removed by relevancy pruning/SinE : 191
% 36.90/5.58 % Initial clauses : 189
% 36.90/5.58 % Removed in clause preprocessing : 2
% 36.90/5.58 % Initial clauses in saturation : 187
% 36.90/5.58 % Processed clauses : 20628
% 36.90/5.58 % ...of these trivial : 226
% 36.90/5.58 % ...subsumed : 17867
% 36.90/5.58 % ...remaining for further processing : 2535
% 36.90/5.58 % Other redundant clauses eliminated : 473
% 36.90/5.58 % Clauses deleted for lack of memory : 0
% 36.90/5.58 % Backward-subsumed : 86
% 36.90/5.58 % Backward-rewritten : 58
% 36.90/5.58 % Generated clauses : 222517
% 36.90/5.58 % ...of the previous two non-redundant : 192953
% 36.90/5.58 % ...aggressively subsumed : 0
% 36.90/5.58 % Contextual simplify-reflections : 56
% 36.90/5.58 % Paramodulations : 221875
% 36.90/5.58 % Factorizations : 166
% 36.90/5.58 % NegExts : 0
% 36.90/5.58 % Equation resolutions : 476
% 36.90/5.58 % Disequality decompositions : 0
% 36.90/5.58 % Total rewrite steps : 54422
% 36.90/5.58 % ...of those cached : 52376
% 36.90/5.58 % Propositional unsat checks : 0
% 36.90/5.58 % Propositional check models : 0
% 36.90/5.58 % Propositional check unsatisfiable : 0
% 36.90/5.58 % Propositional clauses : 0
% 36.90/5.58 % Propositional clauses after purity: 0
% 36.90/5.58 % Propositional unsat core size : 0
% 36.90/5.58 % Propositional preprocessing time : 0.000
% 36.90/5.58 % Propositional encoding time : 0.000
% 36.90/5.58 % Propositional solver time : 0.000
% 36.90/5.58 % Success case prop preproc time : 0.000
% 36.90/5.58 % Success case prop encoding time : 0.000
% 36.90/5.58 % Success case prop solver time : 0.000
% 36.90/5.58 % Current number of processed clauses : 2365
% 36.90/5.58 % Positive orientable unit clauses : 207
% 36.90/5.58 % Positive unorientable unit clauses: 2
% 36.90/5.58 % Negative unit clauses : 214
% 36.90/5.58 % Non-unit-clauses : 1942
% 36.90/5.58 % Current number of unprocessed clauses: 171691
% 36.90/5.58 % ...number of literals in the above : 605732
% 36.90/5.58 % Current number of archived formulas : 0
% 36.90/5.58 % Current number of archived clauses : 145
% 36.90/5.58 % Clause-clause subsumption calls (NU) : 1293808
% 36.90/5.58 % Rec. Clause-clause subsumption calls : 842011
% 36.90/5.58 % Non-unit clause-clause subsumptions : 12593
% 36.90/5.58 % Unit Clause-clause subsumption calls : 24553
% 36.90/5.58 % Rewrite failures with RHS unbound : 0
% 36.90/5.58 % BW rewrite match attempts : 385
% 36.90/5.58 % BW rewrite match successes : 46
% 36.90/5.58 % Condensation attempts : 0
% 36.90/5.58 % Condensation successes : 0
% 36.90/5.58 % Termbank termtop insertions : 2354736
% 36.90/5.58 % Search garbage collected termcells : 4243
% 36.90/5.58
% 36.90/5.58 % -------------------------------------------------
% 36.90/5.58 % User time : 4.626 s
% 36.90/5.58 % System time : 0.176 s
% 36.90/5.58 % Total time : 4.802 s
% 36.90/5.58 % Maximum resident set size: 4464 pages
% 36.90/5.58
% 36.90/5.58 % -------------------------------------------------
% 36.90/5.58 % User time : 4.640 s
% 36.90/5.58 % System time : 0.183 s
% 36.90/5.58 % Total time : 4.823 s
% 36.90/5.58 % Maximum resident set size: 4864 pages
% 36.90/5.58 % E exiting
%------------------------------------------------------------------------------