%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU261+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 : 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:29 PM UTC 2026
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 14 unt; 0 def)
% Number of atoms : 181 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 209 ( 70 ~; 67 |; 37 &)
% ( 2 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 42 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t53_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> ( ( well_founded_relation(X1)
=> well_founded_relation(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( connected(X1)
=> connected(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( reflexive(X1)
=> reflexive(X2) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t53_wellord1) ).
fof(t54_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( ( relation_isomorphism(X1,X2,X3)
& well_ordering(X1) )
=> well_ordering(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t54_wellord1) ).
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/sandbox2/benchmark/theBenchmark.p',d4_wellord1) ).
fof(c_0_3,plain,
! [X1,X2] :
( epred1_2(X2,X1)
<=> ( ( well_founded_relation(X1)
=> well_founded_relation(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( connected(X1)
=> connected(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( reflexive(X1)
=> reflexive(X2) ) ) ),
introduced(definition) ).
fof(c_0_4,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> epred1_2(X2,X1) ) ) ) ),
inference(apply_def,[status(thm)],[t53_wellord1,c_0_3]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( ( relation_isomorphism(X1,X2,X3)
& well_ordering(X1) )
=> well_ordering(X2) ) ) ) ),
inference(assume_negation,[status(cth)],[t54_wellord1]) ).
fof(c_0_6,plain,
! [X1,X2] :
( epred1_2(X2,X1)
=> ( ( well_founded_relation(X1)
=> well_founded_relation(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( connected(X1)
=> connected(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( reflexive(X1)
=> reflexive(X2) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_7,plain,
! [X8,X9,X10] :
( epred1_2(X9,X8)
| ~ relation_isomorphism(X8,X9,X10)
| ~ function(X10)
| ~ relation(X10)
| ~ relation(X9)
| ~ relation(X8) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_8,negated_conjecture,
( ~ well_ordering(esk2_0)
& relation_isomorphism(esk1_0,esk2_0,esk3_0)
& well_ordering(esk1_0)
& function(esk3_0)
& relation(esk3_0)
& relation(esk2_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_5])])])]) ).
fof(c_0_9,plain,
! [X12,X13] :
( ( ~ epred1_2(X13,X12)
| well_founded_relation(X13)
| ~ well_founded_relation(X12) )
& ( ~ epred1_2(X13,X12)
| antisymmetric(X13)
| ~ antisymmetric(X12) )
& ( ~ epred1_2(X13,X12)
| connected(X13)
| ~ connected(X12) )
& ( ~ epred1_2(X13,X12)
| transitive(X13)
| ~ transitive(X12) )
& ( ~ epred1_2(X13,X12)
| reflexive(X13)
| ~ reflexive(X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_10,plain,
( ~ relation_isomorphism(X1,X2,X3)
| ~ function(X3)
| ~ relation(X3)
| ~ relation(X2)
| ~ relation(X1)
| epred1_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation_isomorphism(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ epred1_2(X2,X1)
| ~ well_founded_relation(X1)
| well_founded_relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
epred1_2(esk2_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_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
fof(c_0_18,plain,
! [X7] :
( ( ~ relation(X7)
| well_ordering(X7)
| ~ well_founded_relation(X7)
| ~ connected(X7)
| ~ antisymmetric(X7)
| ~ transitive(X7)
| ~ reflexive(X7) )
& ( ~ relation(X7)
| ~ well_ordering(X7)
| well_founded_relation(X7) )
& ( ~ relation(X7)
| ~ well_ordering(X7)
| connected(X7) )
& ( ~ relation(X7)
| ~ well_ordering(X7)
| antisymmetric(X7) )
& ( ~ relation(X7)
| ~ well_ordering(X7)
| transitive(X7) )
& ( ~ relation(X7)
| ~ well_ordering(X7)
| reflexive(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])])]) ).
cnf(c_0_19,plain,
( ~ epred1_2(X2,X1)
| ~ connected(X1)
| connected(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( ~ epred1_2(X2,X1)
| ~ antisymmetric(X1)
| antisymmetric(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( ~ epred1_2(X2,X1)
| ~ transitive(X1)
| transitive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( ~ epred1_2(X2,X1)
| ~ reflexive(X1)
| reflexive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( ~ well_founded_relation(esk1_0)
| well_founded_relation(esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
well_ordering(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( ~ connected(esk1_0)
| connected(esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_27,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( ~ antisymmetric(esk1_0)
| antisymmetric(esk2_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_29,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( ~ transitive(esk1_0)
| transitive(esk2_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_31,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,plain,
( ~ reflexive(esk1_0)
| reflexive(esk2_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_33,plain,
( ~ relation(X1)
| ~ well_ordering(X1)
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_34,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_18]) ).
cnf(c_0_35,plain,
well_founded_relation(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_15])]) ).
cnf(c_0_36,plain,
connected(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]),c_0_15])]) ).
cnf(c_0_37,plain,
antisymmetric(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]),c_0_15])]) ).
cnf(c_0_38,plain,
transitive(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25]),c_0_15])]) ).
cnf(c_0_39,plain,
reflexive(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_25]),c_0_15])]) ).
cnf(c_0_40,negated_conjecture,
~ well_ordering(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]),c_0_38]),c_0_39]),c_0_14])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU261+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n016.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 06:09:37 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.39 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.15/0.41 % Version: 3.5.1
% 0.15/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 % Starting sh5l with 300s (1) cores
% 0.15/0.41 % new_bool_3 with pid 1724108 completed with status 0
% 0.15/0.41 % Result found by new_bool_3
% 0.15/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.15/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.41 % SubtermCWHack with pid 1724114 completed with status 0
% 0.15/0.41 % Result found by SubtermCWHack
% 0.15/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.15/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.41 % Preprocessing time : 0.001 s
% 0.15/0.41
% 0.15/0.41 % Proof found!
% 0.15/0.41 % SZS status Theorem
% 0.15/0.41 % SZS output start CNFRefutation
% See solution above
% 0.15/0.41 % Parsed axioms : 4
% 0.15/0.41 % Removed by relevancy pruning/SinE : 0
% 0.15/0.41 % Initial clauses : 21
% 0.15/0.41 % Removed in clause preprocessing : 0
% 0.15/0.41 % Initial clauses in saturation : 21
% 0.15/0.41 % Processed clauses : 32
% 0.15/0.41 % ...of these trivial : 0
% 0.15/0.41 % ...subsumed : 0
% 0.15/0.41 % ...remaining for further processing : 32
% 0.15/0.41 % Other redundant clauses eliminated : 0
% 0.15/0.41 % Clauses deleted for lack of memory : 0
% 0.15/0.41 % Backward-subsumed : 0
% 0.15/0.41 % Backward-rewritten : 5
% 0.15/0.41 % Generated clauses : 13
% 0.15/0.41 % ...of the previous two non-redundant : 11
% 0.15/0.41 % ...aggressively subsumed : 0
% 0.15/0.41 % Contextual simplify-reflections : 0
% 0.15/0.41 % Paramodulations : 13
% 0.15/0.41 % Factorizations : 0
% 0.15/0.41 % NegExts : 0
% 0.15/0.41 % Equation resolutions : 0
% 0.15/0.41 % Disequality decompositions : 0
% 0.15/0.41 % Total rewrite steps : 24
% 0.15/0.41 % ...of those cached : 14
% 0.15/0.41 % Propositional unsat checks : 0
% 0.15/0.41 % Propositional check models : 0
% 0.15/0.41 % Propositional check unsatisfiable : 0
% 0.15/0.41 % Propositional clauses : 0
% 0.15/0.41 % Propositional clauses after purity: 0
% 0.15/0.41 % Propositional unsat core size : 0
% 0.15/0.41 % Propositional preprocessing time : 0.000
% 0.15/0.41 % Propositional encoding time : 0.000
% 0.15/0.41 % Propositional solver time : 0.000
% 0.15/0.41 % Success case prop preproc time : 0.000
% 0.15/0.41 % Success case prop encoding time : 0.000
% 0.15/0.41 % Success case prop solver time : 0.000
% 0.15/0.41 % Current number of processed clauses : 27
% 0.15/0.41 % Positive orientable unit clauses : 14
% 0.15/0.41 % Positive unorientable unit clauses: 0
% 0.15/0.41 % Negative unit clauses : 1
% 0.15/0.41 % Non-unit-clauses : 12
% 0.15/0.41 % Current number of unprocessed clauses: 0
% 0.15/0.41 % ...number of literals in the above : 0
% 0.15/0.41 % Current number of archived formulas : 0
% 0.15/0.41 % Current number of archived clauses : 5
% 0.15/0.41 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.41 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.41 % Non-unit clause-clause subsumptions : 0
% 0.15/0.41 % Unit Clause-clause subsumption calls : 0
% 0.15/0.41 % Rewrite failures with RHS unbound : 0
% 0.15/0.41 % BW rewrite match attempts : 5
% 0.15/0.41 % BW rewrite match successes : 5
% 0.15/0.41 % Condensation attempts : 0
% 0.15/0.41 % Condensation successes : 0
% 0.15/0.41 % Termbank termtop insertions : 1353
% 0.15/0.41 % Search garbage collected termcells : 292
% 0.15/0.41
% 0.15/0.41 % -------------------------------------------------
% 0.15/0.41 % User time : 0.006 s
% 0.15/0.41 % System time : 0.000 s
% 0.15/0.41 % Total time : 0.006 s
% 0.15/0.41 % Maximum resident set size: 3636 pages
% 0.15/0.41
% 0.15/0.41 % -------------------------------------------------
% 0.15/0.41 % User time : 0.007 s
% 0.15/0.41 % System time : 0.005 s
% 0.15/0.41 % Total time : 0.012 s
% 0.15/0.41 % Maximum resident set size: 4608 pages
% 0.15/0.41 % E exiting
%------------------------------------------------------------------------------