%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU241+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 : n013.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:41 PM UTC 2026
% Result : Theorem 206.61s 30.47s
% Output : CNFRefutation 206.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 124 ( 15 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 149 ( 55 ~; 64 |; 17 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 2 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l3_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( antisymmetric(X1)
<=> ! [X2,X3] :
( ( in(ordered_pair(X3,X2),X1)
& in(ordered_pair(X2,X3),X1) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_wellord1) ).
fof(d4_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_antisymmetric_in(X1,X2)
<=> ! [X3,X4] :
( ( in(ordered_pair(X4,X3),X1)
& in(ordered_pair(X3,X4),X1)
& in(X4,X2)
& in(X3,X2) )
=> X3 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_2) ).
fof(d12_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( antisymmetric(X1)
<=> is_antisymmetric_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d12_relat_2) ).
fof(t30_relat_1,lemma,
! [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)
=> ( antisymmetric(X1)
<=> ! [X2,X3] :
( ( in(ordered_pair(X3,X2),X1)
& in(ordered_pair(X2,X3),X1) )
=> X2 = X3 ) ) ),
inference(assume_negation,[status(cth)],[l3_wellord1]) ).
fof(c_0_5,negated_conjecture,
! [X10,X11] :
( ( X10 = X11
| ~ in(ordered_pair(X11,X10),esk1_0)
| ~ in(ordered_pair(X10,X11),esk1_0)
| antisymmetric(esk1_0) )
& ( ~ antisymmetric(esk1_0)
| esk2_0 != esk3_0 )
& ( ~ antisymmetric(esk1_0)
| in(ordered_pair(esk3_0,esk2_0),esk1_0) )
& ( ~ antisymmetric(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,
! [X129,X130,X131,X132,X133] :
( ( ~ relation(X129)
| is_antisymmetric_in(X129,X133)
| esk30_2(X129,X133) != esk31_2(X129,X133) )
& ( ~ relation(X129)
| is_antisymmetric_in(X129,X133)
| in(ordered_pair(esk31_2(X129,X133),esk30_2(X129,X133)),X129) )
& ( ~ relation(X129)
| is_antisymmetric_in(X129,X133)
| in(ordered_pair(esk30_2(X129,X133),esk31_2(X129,X133)),X129) )
& ( ~ relation(X129)
| is_antisymmetric_in(X129,X133)
| in(esk31_2(X129,X133),X133) )
& ( ~ relation(X129)
| is_antisymmetric_in(X129,X133)
| in(esk30_2(X129,X133),X133) )
& ( ~ relation(X129)
| X131 = X132
| ~ in(ordered_pair(X132,X131),X129)
| ~ in(ordered_pair(X131,X132),X129)
| ~ in(X132,X130)
| ~ in(X131,X130)
| ~ is_antisymmetric_in(X129,X130) ) ),
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)],[d4_relat_2])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ in(ordered_pair(X2,X1),esk1_0)
| ~ in(ordered_pair(X1,X2),esk1_0)
| X1 = X2
| antisymmetric(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ relation(X1)
| is_antisymmetric_in(X1,X2)
| in(ordered_pair(esk30_2(X1,X2),esk31_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,negated_conjecture,
( ~ in(ordered_pair(esk31_2(esk1_0,X1),esk30_2(esk1_0,X1)),esk1_0)
| antisymmetric(esk1_0)
| is_antisymmetric_in(esk1_0,X1)
| esk31_2(esk1_0,X1) = esk30_2(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_11,plain,
( ~ relation(X1)
| is_antisymmetric_in(X1,X2)
| in(ordered_pair(esk31_2(X1,X2),esk30_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X78] :
( ( ~ relation(X78)
| antisymmetric(X78)
| ~ is_antisymmetric_in(X78,relation_field(X78)) )
& ( ~ relation(X78)
| is_antisymmetric_in(X78,relation_field(X78))
| ~ antisymmetric(X78) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d12_relat_2])])])]) ).
cnf(c_0_13,plain,
( ~ relation(X1)
| esk30_2(X1,X2) != esk31_2(X1,X2)
| is_antisymmetric_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
( antisymmetric(esk1_0)
| is_antisymmetric_in(esk1_0,X1)
| esk31_2(esk1_0,X1) = esk30_2(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9])]) ).
fof(c_0_15,lemma,
! [X137,X138,X139] :
( ( ~ relation(X139)
| ~ in(ordered_pair(X137,X138),X139)
| in(X138,relation_field(X139)) )
& ( ~ relation(X139)
| ~ in(ordered_pair(X137,X138),X139)
| in(X137,relation_field(X139)) ) ),
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_16,plain,
( ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( antisymmetric(esk1_0)
| is_antisymmetric_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_18,plain,
( ~ relation(X1)
| ~ in(ordered_pair(X4,X3),X1)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(X4,X2)
| ~ in(X3,X2)
| ~ is_antisymmetric_in(X1,X2)
| X3 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
( ~ relation(X1)
| ~ antisymmetric(X1)
| is_antisymmetric_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,lemma,
( ~ relation(X2)
| ~ in(ordered_pair(X1,X3),X2)
| in(X1,relation_field(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( ~ antisymmetric(esk1_0)
| in(ordered_pair(esk3_0,esk2_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
antisymmetric(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_9])]) ).
cnf(c_0_23,negated_conjecture,
( ~ antisymmetric(esk1_0)
| in(ordered_pair(esk2_0,esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
( ~ antisymmetric(esk1_0)
| esk2_0 != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,plain,
( ~ in(ordered_pair(X1,X2),X3)
| ~ in(ordered_pair(X2,X1),X3)
| ~ relation(X3)
| ~ antisymmetric(X3)
| X1 = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
in(ordered_pair(esk3_0,esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
in(ordered_pair(esk2_0,esk3_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
esk3_0 != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[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_22]),c_0_9]),c_0_27])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU241+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.13/0.36 % Computer : n013.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8046.5625MB
% 0.13/0.36 % OS : Linux 6.8.0-71-generic
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Sep 21 06:02:07 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 206.61/30.47 % Version: 3.5.1
% 206.61/30.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 206.61/30.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.61/30.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 206.61/30.47 % Starting new_bool_3 with 300s (1) cores
% 206.61/30.47 % Starting new_bool_1 with 300s (1) cores
% 206.61/30.47 % Starting sh5l with 300s (1) cores
% 206.61/30.47 % new_bool_1 with pid 88379 completed with status 0
% 206.61/30.47 % Result found by new_bool_1
% 206.61/30.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 206.61/30.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.61/30.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 206.61/30.47 % Starting new_bool_3 with 300s (1) cores
% 206.61/30.47 % Starting new_bool_1 with 300s (1) cores
% 206.61/30.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 206.61/30.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 206.61/30.47 % Search class: FGHSM-FFMM31-SFFFFFNN
% 206.61/30.47 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 206.61/30.47 % Starting SubtermCWHack with 28s (1) cores
% 206.61/30.47 % SubtermCWHack with pid 88382 completed with status 8
% 206.61/30.47 % Starting new_bool_1 with 31s (1) cores
% 206.61/30.47 % new_bool_1 with pid 88923 completed with status 0
% 206.61/30.47 % Result found by new_bool_1
% 206.61/30.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 206.61/30.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.61/30.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 206.61/30.47 % Starting new_bool_3 with 300s (1) cores
% 206.61/30.47 % Starting new_bool_1 with 300s (1) cores
% 206.61/30.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 206.61/30.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 206.61/30.47 % Search class: FGHSM-FFMM31-SFFFFFNN
% 206.61/30.47 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 206.61/30.47 % Starting SubtermCWHack with 28s (1) cores
% 206.61/30.47 % SubtermCWHack with pid 88382 completed with status 8
% 206.61/30.47 % Starting new_bool_1 with 31s (1) cores
% 206.61/30.47 % Preprocessing time : 0.003 s
% 206.61/30.47 % Presaturation interreduction done
% 206.61/30.47
% 206.61/30.47 % Proof found!
% 206.61/30.47 % SZS status Theorem
% 206.61/30.47 % SZS output start CNFRefutation
% See solution above
% 206.61/30.47 % Parsed axioms : 289
% 206.61/30.47 % Removed by relevancy pruning/SinE : 215
% 206.61/30.47 % Initial clauses : 134
% 206.61/30.47 % Removed in clause preprocessing : 2
% 206.61/30.47 % Initial clauses in saturation : 132
% 206.61/30.47 % Processed clauses : 11028
% 206.61/30.47 % ...of these trivial : 78
% 206.61/30.47 % ...subsumed : 9284
% 206.61/30.47 % ...remaining for further processing : 1666
% 206.61/30.47 % Other redundant clauses eliminated : 77
% 206.61/30.47 % Clauses deleted for lack of memory : 0
% 206.61/30.47 % Backward-subsumed : 61
% 206.61/30.47 % Backward-rewritten : 26
% 206.61/30.47 % Generated clauses : 76748
% 206.61/30.47 % ...of the previous two non-redundant : 71635
% 206.61/30.47 % ...aggressively subsumed : 0
% 206.61/30.47 % Contextual simplify-reflections : 26
% 206.61/30.47 % Paramodulations : 76614
% 206.61/30.47 % Factorizations : 52
% 206.61/30.47 % NegExts : 0
% 206.61/30.47 % Equation resolutions : 79
% 206.61/30.47 % Disequality decompositions : 0
% 206.61/30.47 % Total rewrite steps : 7499
% 206.61/30.47 % ...of those cached : 6977
% 206.61/30.47 % Propositional unsat checks : 0
% 206.61/30.47 % Propositional check models : 0
% 206.61/30.47 % Propositional check unsatisfiable : 0
% 206.61/30.47 % Propositional clauses : 0
% 206.61/30.47 % Propositional clauses after purity: 0
% 206.61/30.47 % Propositional unsat core size : 0
% 206.61/30.47 % Propositional preprocessing time : 0.000
% 206.61/30.47 % Propositional encoding time : 0.000
% 206.61/30.47 % Propositional solver time : 0.000
% 206.61/30.47 % Success case prop preproc time : 0.000
% 206.61/30.47 % Success case prop encoding time : 0.000
% 206.61/30.47 % Success case prop solver time : 0.000
% 206.61/30.47 % Current number of processed clauses : 1442
% 206.61/30.47 % Positive orientable unit clauses : 169
% 206.61/30.47 % Positive unorientable unit clauses: 2
% 206.61/30.47 % Negative unit clauses : 241
% 206.61/30.47 % Non-unit-clauses : 1030
% 206.61/30.47 % Current number of unprocessed clauses: 60733
% 206.61/30.47 % ...number of literals in the above : 216830
% 206.61/30.47 % Current number of archived formulas : 0
% 206.61/30.47 % Current number of archived clauses : 212
% 206.61/30.47 % Clause-clause subsumption calls (NU) : 174908
% 206.61/30.47 % Rec. Clause-clause subsumption calls : 96328
% 206.61/30.47 % Non-unit clause-clause subsumptions : 3540
% 206.61/30.47 % Unit Clause-clause subsumption calls : 39121
% 206.61/30.47 % Rewrite failures with RHS unbound : 0
% 206.61/30.47 % BW rewrite match attempts : 109
% 206.61/30.47 % BW rewrite match successes : 31
% 206.61/30.47 % Condensation attempts : 0
% 206.61/30.47 % Condensation successes : 0
% 206.61/30.47 % Termbank termtop insertions : 894827
% 206.61/30.47 % Search garbage collected termcells : 3587
% 206.61/30.47
% 206.61/30.47 % -------------------------------------------------
% 206.61/30.47 % User time : 28.176 s
% 206.61/30.47 % System time : 1.356 s
% 206.61/30.47 % Total time : 29.531 s
% 206.61/30.47 % Maximum resident set size: 4140 pages
% 206.61/30.47
% 206.61/30.47 % -------------------------------------------------
% 206.61/30.47 % User time : 28.186 s
% 206.61/30.47 % System time : 1.360 s
% 206.61/30.47 % Total time : 29.546 s
% 206.61/30.47 % Maximum resident set size: 5120 pages
% 206.61/30.47 % E exiting
%------------------------------------------------------------------------------