%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU242+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 : n004.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.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 4 unt; 0 def)
% Number of atoms : 167 ( 20 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 219 ( 86 ~; 89 |; 32 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 4 ( 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 : 53 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d6_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_connected_in(X1,X2)
<=> ! [X3,X4] :
~ ( ~ in(ordered_pair(X4,X3),X1)
& ~ in(ordered_pair(X3,X4),X1)
& X3 != X4
& in(X4,X2)
& in(X3,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_relat_2) ).
fof(l4_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> ! [X2,X3] :
~ ( ~ in(ordered_pair(X3,X2),X1)
& ~ in(ordered_pair(X2,X3),X1)
& X2 != X3
& in(X3,relation_field(X1))
& in(X2,relation_field(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_wellord1) ).
fof(d14_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> is_connected_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d14_relat_2) ).
fof(c_0_3,plain,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_connected_in(X1,X2)
<=> ! [X3,X4] :
~ ( ~ in(ordered_pair(X4,X3),X1)
& ~ in(ordered_pair(X3,X4),X1)
& X3 != X4
& in(X4,X2)
& in(X3,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d6_relat_2]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( connected(X1)
<=> ! [X2,X3] :
~ ( ~ in(ordered_pair(X3,X2),X1)
& ~ in(ordered_pair(X2,X3),X1)
& X2 != X3
& in(X3,relation_field(X1))
& in(X2,relation_field(X1)) ) ) ),
inference(assume_negation,[status(cth)],[l4_wellord1]) ).
fof(c_0_5,plain,
! [X21,X22,X23,X24,X25] :
( ( ~ relation(X21)
| is_connected_in(X21,X25)
| ~ in(ordered_pair(esk7_2(X21,X25),esk6_2(X21,X25)),X21) )
& ( ~ relation(X21)
| is_connected_in(X21,X25)
| ~ in(ordered_pair(esk6_2(X21,X25),esk7_2(X21,X25)),X21) )
& ( ~ relation(X21)
| is_connected_in(X21,X25)
| esk6_2(X21,X25) != esk7_2(X21,X25) )
& ( ~ relation(X21)
| is_connected_in(X21,X25)
| in(esk7_2(X21,X25),X25) )
& ( ~ relation(X21)
| is_connected_in(X21,X25)
| in(esk6_2(X21,X25),X25) )
& ( ~ relation(X21)
| in(ordered_pair(X24,X23),X21)
| in(ordered_pair(X23,X24),X21)
| X23 = X24
| ~ in(X24,X22)
| ~ in(X23,X22)
| ~ is_connected_in(X21,X22) ) ),
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,
! [X16] :
( ( ~ relation(X16)
| connected(X16)
| ~ is_connected_in(X16,relation_field(X16)) )
& ( ~ relation(X16)
| is_connected_in(X16,relation_field(X16))
| ~ connected(X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d14_relat_2])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( connected(X1)
<=> ! [X2,X3] :
~ ( ~ in(ordered_pair(X3,X2),X1)
& ~ in(ordered_pair(X2,X3),X1)
& X2 != X3
& in(X3,relation_field(X1))
& in(X2,relation_field(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ relation(X1)
| ~ in(X4,X2)
| ~ in(X3,X2)
| ~ is_connected_in(X1,X2)
| in(ordered_pair(X4,X3),X1)
| in(ordered_pair(X3,X4),X1)
| X3 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ relation(X1)
| ~ connected(X1)
| is_connected_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
! [X8,X9] :
( ( in(ordered_pair(X9,X8),esk1_0)
| in(ordered_pair(X8,X9),esk1_0)
| X8 = X9
| ~ in(X9,relation_field(esk1_0))
| ~ in(X8,relation_field(esk1_0))
| connected(esk1_0) )
& ( ~ connected(esk1_0)
| ~ in(ordered_pair(esk3_0,esk2_0),esk1_0) )
& ( ~ connected(esk1_0)
| ~ in(ordered_pair(esk2_0,esk3_0),esk1_0) )
& ( ~ connected(esk1_0)
| esk2_0 != esk3_0 )
& ( ~ connected(esk1_0)
| in(esk3_0,relation_field(esk1_0)) )
& ( ~ connected(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_7])])])])])]) ).
cnf(c_0_11,plain,
( ~ in(X1,relation_field(X3))
| ~ in(X2,relation_field(X3))
| ~ relation(X3)
| ~ connected(X3)
| in(ordered_pair(X1,X2),X3)
| in(ordered_pair(X2,X1),X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ connected(esk1_0)
| in(esk3_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( ~ in(X1,relation_field(esk1_0))
| ~ connected(esk1_0)
| in(ordered_pair(esk3_0,X1),esk1_0)
| in(ordered_pair(X1,esk3_0),esk1_0)
| X1 = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,negated_conjecture,
( ~ connected(esk1_0)
| in(esk2_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ connected(esk1_0)
| ~ in(ordered_pair(esk3_0,esk2_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ connected(esk1_0)
| ~ in(ordered_pair(esk2_0,esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
( ~ connected(esk1_0)
| esk2_0 != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( ~ in(X2,relation_field(esk1_0))
| ~ in(X1,relation_field(esk1_0))
| in(ordered_pair(X2,X1),esk1_0)
| in(ordered_pair(X1,X2),esk1_0)
| X1 = X2
| connected(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( ~ relation(X1)
| is_connected_in(X1,X2)
| in(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
~ connected(esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ in(X1,relation_field(esk1_0))
| ~ relation(X2)
| in(ordered_pair(X1,esk6_2(X2,relation_field(esk1_0))),esk1_0)
| in(ordered_pair(esk6_2(X2,relation_field(esk1_0)),X1),esk1_0)
| is_connected_in(X2,relation_field(esk1_0))
| X1 = esk6_2(X2,relation_field(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| is_connected_in(X1,X2)
| in(esk7_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
( ~ relation(X1)
| ~ relation(X2)
| in(ordered_pair(esk6_2(X2,relation_field(esk1_0)),esk7_2(X1,relation_field(esk1_0))),esk1_0)
| in(ordered_pair(esk7_2(X1,relation_field(esk1_0)),esk6_2(X2,relation_field(esk1_0))),esk1_0)
| is_connected_in(X2,relation_field(esk1_0))
| is_connected_in(X1,relation_field(esk1_0))
| esk7_2(X1,relation_field(esk1_0)) = esk6_2(X2,relation_field(esk1_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( ~ relation(X1)
| ~ in(ordered_pair(esk7_2(X1,X2),esk6_2(X1,X2)),X1)
| is_connected_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,negated_conjecture,
( ~ relation(X1)
| in(ordered_pair(esk7_2(X1,relation_field(esk1_0)),esk6_2(esk1_0,relation_field(esk1_0))),esk1_0)
| in(ordered_pair(esk6_2(esk1_0,relation_field(esk1_0)),esk7_2(X1,relation_field(esk1_0))),esk1_0)
| is_connected_in(X1,relation_field(esk1_0))
| is_connected_in(esk1_0,relation_field(esk1_0))
| esk7_2(X1,relation_field(esk1_0)) = esk6_2(esk1_0,relation_field(esk1_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_27,plain,
( ~ relation(X1)
| ~ in(ordered_pair(esk6_2(X1,X2),esk7_2(X1,X2)),X1)
| is_connected_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,negated_conjecture,
( in(ordered_pair(esk6_2(esk1_0,relation_field(esk1_0)),esk7_2(esk1_0,relation_field(esk1_0))),esk1_0)
| is_connected_in(esk1_0,relation_field(esk1_0))
| esk7_2(esk1_0,relation_field(esk1_0)) = esk6_2(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_13])]) ).
cnf(c_0_29,plain,
( ~ relation(X1)
| esk6_2(X1,X2) != esk7_2(X1,X2)
| is_connected_in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_30,negated_conjecture,
( is_connected_in(esk1_0,relation_field(esk1_0))
| esk7_2(esk1_0,relation_field(esk1_0)) = esk6_2(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_13])]) ).
cnf(c_0_31,plain,
( ~ relation(X1)
| ~ is_connected_in(X1,relation_field(X1))
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
is_connected_in(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_13])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_13])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU242+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.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 06:02:51 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % new_bool_3 with pid 2405120 completed with status 0
% 0.11/0.44 % Result found by new_bool_3
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 2405123 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Theorem
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 36
% 0.11/0.44 % Removed by relevancy pruning/SinE : 27
% 0.11/0.44 % Initial clauses : 21
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 21
% 0.11/0.44 % Processed clauses : 47
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 4
% 0.11/0.44 % ...remaining for further processing : 43
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 10
% 0.11/0.44 % Backward-rewritten : 2
% 0.11/0.44 % Generated clauses : 51
% 0.11/0.44 % ...of the previous two non-redundant : 45
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 3
% 0.11/0.44 % Paramodulations : 51
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 13
% 0.11/0.44 % ...of those cached : 11
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 31
% 0.11/0.44 % Positive orientable unit clauses : 3
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 3
% 0.11/0.44 % Non-unit-clauses : 25
% 0.11/0.44 % Current number of unprocessed clauses: 15
% 0.11/0.44 % ...number of literals in the above : 83
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 12
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 432
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 110
% 0.11/0.44 % Non-unit clause-clause subsumptions : 8
% 0.11/0.44 % Unit Clause-clause subsumption calls : 13
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 1
% 0.11/0.44 % BW rewrite match successes : 1
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 3268
% 0.11/0.44 % Search garbage collected termcells : 494
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.005 s
% 0.11/0.44 % System time : 0.003 s
% 0.11/0.44 % Total time : 0.008 s
% 0.11/0.44 % Maximum resident set size: 3656 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.006 s
% 0.11/0.44 % System time : 0.009 s
% 0.11/0.44 % Total time : 0.015 s
% 0.11/0.44 % Maximum resident set size: 4864 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------