%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU254+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:28 PM UTC 2026
% Result : Theorem 0.25s 0.70s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 4 unt; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 151 ( 60 ~; 68 |; 12 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 83 ( 7 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,cartesian_product2(X2,X2))
& in(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
fof(l2_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X2,X3),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_wellord1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X2,X4)
& in(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t106_zfmisc_1) ).
fof(t24_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_wellord1) ).
fof(c_0_5,plain,
! [X18,X19,X20] :
( ( ~ relation(X20)
| in(X18,relation_restriction(X20,X19))
| ~ in(X18,cartesian_product2(X19,X19))
| ~ in(X18,X20) )
& ( ~ relation(X20)
| ~ in(X18,relation_restriction(X20,X19))
| in(X18,cartesian_product2(X19,X19)) )
& ( ~ relation(X20)
| ~ in(X18,relation_restriction(X20,X19))
| in(X18,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])])]) ).
fof(c_0_6,plain,
! [X7,X8,X9,X10] :
( ( ~ relation(X7)
| transitive(X7)
| ~ in(ordered_pair(esk3_1(X7),esk5_1(X7)),X7) )
& ( ~ relation(X7)
| transitive(X7)
| in(ordered_pair(esk4_1(X7),esk5_1(X7)),X7) )
& ( ~ relation(X7)
| transitive(X7)
| in(ordered_pair(esk3_1(X7),esk4_1(X7)),X7) )
& ( ~ relation(X7)
| in(ordered_pair(X8,X10),X7)
| ~ in(ordered_pair(X9,X10),X7)
| ~ in(ordered_pair(X8,X9),X7)
| ~ transitive(X7) ) ),
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)],[l2_wellord1])])])])])]) ).
fof(c_0_7,plain,
! [X16,X17] :
( relation(relation_restriction(X16,X17))
| ~ relation(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])]) ).
fof(c_0_8,plain,
! [X27,X28,X29,X30] :
( ( in(ordered_pair(X27,X28),cartesian_product2(X29,X30))
| ~ in(X28,X30)
| ~ in(X27,X29) )
& ( ~ in(ordered_pair(X27,X28),cartesian_product2(X29,X30))
| in(X28,X30) )
& ( ~ in(ordered_pair(X27,X28),cartesian_product2(X29,X30))
| in(X27,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])])]) ).
cnf(c_0_9,plain,
( ~ relation(X3)
| ~ in(X1,relation_restriction(X3,X2))
| in(X1,cartesian_product2(X2,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ relation(X1)
| transitive(X1)
| in(ordered_pair(esk3_1(X1),esk4_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ relation(X1)
| relation(relation_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ relation(X1)
| transitive(X1)
| in(ordered_pair(esk4_1(X1),esk5_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ relation(X2)
| ~ in(X1,cartesian_product2(X3,X3))
| ~ in(X1,X2)
| in(X1,relation_restriction(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( ~ in(X3,X4)
| ~ in(X1,X2)
| in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ relation(X1)
| in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk4_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))
| transitive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_17,plain,
( ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2))
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( ~ relation(X1)
| in(ordered_pair(esk4_1(relation_restriction(X1,X2)),esk5_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))
| transitive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_11]) ).
cnf(c_0_19,plain,
( ~ relation(X2)
| ~ in(X1,relation_restriction(X2,X3))
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t24_wellord1]) ).
cnf(c_0_21,plain,
( ~ relation(X1)
| ~ in(ordered_pair(esk3_1(X1),esk5_1(X1)),X1)
| transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( ~ in(X1,X4)
| ~ in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| ~ relation(X3)
| in(ordered_pair(X1,X2),relation_restriction(X3,X4)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| in(esk3_1(relation_restriction(X1,X2)),X2)
| transitive(relation_restriction(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
( ~ relation(X1)
| in(esk5_1(relation_restriction(X1,X2)),X2)
| transitive(relation_restriction(X1,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( ~ relation(X1)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(ordered_pair(X2,X3),X1)
| ~ transitive(X1)
| in(ordered_pair(X2,X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,plain,
( ~ relation(X1)
| in(ordered_pair(esk4_1(relation_restriction(X1,X2)),esk5_1(relation_restriction(X1,X2))),X1)
| transitive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_11]) ).
fof(c_0_27,negated_conjecture,
( ~ transitive(relation_restriction(esk2_0,esk1_0))
& transitive(esk2_0)
& relation(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_28,plain,
( ~ in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk5_1(relation_restriction(X1,X2))),X1)
| ~ relation(X1)
| transitive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_11]) ).
cnf(c_0_29,plain,
( ~ in(ordered_pair(X3,esk4_1(relation_restriction(X1,X2))),X1)
| ~ relation(X1)
| ~ transitive(X1)
| in(ordered_pair(X3,esk5_1(relation_restriction(X1,X2))),X1)
| transitive(relation_restriction(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( ~ relation(X1)
| in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk4_1(relation_restriction(X1,X2))),X1)
| transitive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_11]) ).
cnf(c_0_31,negated_conjecture,
~ transitive(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( ~ relation(X1)
| ~ transitive(X1)
| transitive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
transitive(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU254+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n016.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Mon Sep 21 06:08:38 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.54 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.25/0.70 % Version: 3.5.1
% 0.25/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.70 % Starting sh5l with 300s (1) cores
% 0.25/0.70 % new_bool_3 with pid 1722523 completed with status 0
% 0.25/0.70 % Result found by new_bool_3
% 0.25/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.70 % Search class: FGHSS-FFSS21-SFFFFFNN
% 0.25/0.70 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.70 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.70 % SubtermCWHack with pid 1722531 completed with status 0
% 0.25/0.70 % Result found by SubtermCWHack
% 0.25/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.70 % Search class: FGHSS-FFSS21-SFFFFFNN
% 0.25/0.70 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.70 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.70 % Preprocessing time : 0.002 s
% 0.25/0.70
% 0.25/0.70 % Proof found!
% 0.25/0.70 % SZS status Theorem
% 0.25/0.70 % SZS output start CNFRefutation
% See solution above
% 0.25/0.70 % Parsed axioms : 34
% 0.25/0.70 % Removed by relevancy pruning/SinE : 17
% 0.25/0.70 % Initial clauses : 26
% 0.25/0.70 % Removed in clause preprocessing : 0
% 0.25/0.70 % Initial clauses in saturation : 26
% 0.25/0.70 % Processed clauses : 751
% 0.25/0.70 % ...of these trivial : 1
% 0.25/0.70 % ...subsumed : 506
% 0.25/0.70 % ...remaining for further processing : 244
% 0.25/0.70 % Other redundant clauses eliminated : 0
% 0.25/0.70 % Clauses deleted for lack of memory : 0
% 0.25/0.70 % Backward-subsumed : 36
% 0.25/0.70 % Backward-rewritten : 1
% 0.25/0.70 % Generated clauses : 1522
% 0.25/0.70 % ...of the previous two non-redundant : 1451
% 0.25/0.70 % ...aggressively subsumed : 0
% 0.25/0.70 % Contextual simplify-reflections : 34
% 0.25/0.70 % Paramodulations : 1522
% 0.25/0.70 % Factorizations : 0
% 0.25/0.70 % NegExts : 0
% 0.25/0.70 % Equation resolutions : 0
% 0.25/0.70 % Disequality decompositions : 0
% 0.25/0.70 % Total rewrite steps : 25
% 0.25/0.70 % ...of those cached : 18
% 0.25/0.70 % Propositional unsat checks : 0
% 0.25/0.70 % Propositional check models : 0
% 0.25/0.70 % Propositional check unsatisfiable : 0
% 0.25/0.70 % Propositional clauses : 0
% 0.25/0.70 % Propositional clauses after purity: 0
% 0.25/0.70 % Propositional unsat core size : 0
% 0.25/0.70 % Propositional preprocessing time : 0.000
% 0.25/0.70 % Propositional encoding time : 0.000
% 0.25/0.70 % Propositional solver time : 0.000
% 0.25/0.70 % Success case prop preproc time : 0.000
% 0.25/0.70 % Success case prop encoding time : 0.000
% 0.25/0.70 % Success case prop solver time : 0.000
% 0.25/0.70 % Current number of processed clauses : 207
% 0.25/0.70 % Positive orientable unit clauses : 7
% 0.25/0.70 % Positive unorientable unit clauses: 1
% 0.25/0.70 % Negative unit clauses : 6
% 0.25/0.70 % Non-unit-clauses : 193
% 0.25/0.70 % Current number of unprocessed clauses: 697
% 0.25/0.70 % ...number of literals in the above : 3565
% 0.25/0.70 % Current number of archived formulas : 0
% 0.25/0.70 % Current number of archived clauses : 37
% 0.25/0.70 % Clause-clause subsumption calls (NU) : 12674
% 0.25/0.70 % Rec. Clause-clause subsumption calls : 6389
% 0.25/0.70 % Non-unit clause-clause subsumptions : 575
% 0.25/0.70 % Unit Clause-clause subsumption calls : 47
% 0.25/0.70 % Rewrite failures with RHS unbound : 0
% 0.25/0.70 % BW rewrite match attempts : 6
% 0.25/0.70 % BW rewrite match successes : 5
% 0.25/0.70 % Condensation attempts : 0
% 0.25/0.70 % Condensation successes : 0
% 0.25/0.70 % Termbank termtop insertions : 34532
% 0.25/0.70 % Search garbage collected termcells : 370
% 0.25/0.70
% 0.25/0.70 % -------------------------------------------------
% 0.25/0.70 % User time : 0.114 s
% 0.25/0.70 % System time : 0.007 s
% 0.25/0.70 % Total time : 0.121 s
% 0.25/0.70 % Maximum resident set size: 3652 pages
% 0.25/0.70
% 0.25/0.70 % -------------------------------------------------
% 0.25/0.70 % User time : 0.116 s
% 0.25/0.70 % System time : 0.014 s
% 0.25/0.70 % Total time : 0.130 s
% 0.25/0.70 % Maximum resident set size: 4864 pages
% 0.25/0.70 % E exiting
%------------------------------------------------------------------------------