%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU240+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 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 08:58:39 AM UTC 2026
% Result : Theorem 77.55s 78.84s
% Output : Proof 77.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 110 ( 58 unt; 0 def)
% Number of atoms : 340 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 372 ( 142 ~; 140 |; 77 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 125 ( 2 sgn 77 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d16_relat_2,axiom,
! [A] :
( relation(A)
=> ( transitive(A)
<=> is_transitive_in(A,relation_field(A)) ) ),
file('theBenchmark.p',d16_relat_2) ).
fof(d8_relat_2,axiom,
! [A] :
( relation(A)
=> ! [B] :
( is_transitive_in(A,B)
<=> ! [C,D,E] :
( ( in(ordered_pair(D,E),A)
& in(ordered_pair(C,D),A)
& in(E,B)
& in(D,B)
& in(C,B) )
=> in(ordered_pair(C,E),A) ) ) ),
file('theBenchmark.p',d8_relat_2) ).
fof(l2_wellord1,conjecture,
! [A] :
( relation(A)
=> ( transitive(A)
<=> ! [B,C,D] :
( ( in(ordered_pair(C,D),A)
& in(ordered_pair(B,C),A) )
=> in(ordered_pair(B,D),A) ) ) ),
file('theBenchmark.p',l2_wellord1) ).
fof(t30_relat_1,axiom,
! [A,B,C] :
( relation(C)
=> ( in(ordered_pair(A,B),C)
=> ( in(B,relation_field(C))
& in(A,relation_field(C)) ) ) ),
file('theBenchmark.p',t30_relat_1) ).
fof(f_6_1,plain,
! [A] :
( ( ( transitive(A)
| ~ is_transitive_in(A,relation_field(A)) )
& ( is_transitive_in(A,relation_field(A))
| ~ transitive(A) ) )
| ~ relation(A) ),
inference(fof_nnf,[status(thm)],[d16_relat_2]) ).
fof(f_6_2,plain,
! [U_8] :
( ( ( transitive(U_8)
| ~ is_transitive_in(U_8,relation_field(U_8)) )
& ( is_transitive_in(U_8,relation_field(U_8))
| ~ transitive(U_8) ) )
| ~ relation(U_8) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
cnf(f_6_3,plain,
( is_transitive_in(U_8,relation_field(U_8))
| ~ transitive(U_8)
| ~ relation(U_8) ),
inference(clausify,[status(thm)],[f_6_2]) ).
cnf(f_6_4,plain,
( transitive(U_8)
| ~ is_transitive_in(U_8,relation_field(U_8))
| ~ relation(U_8) ),
inference(clausify,[status(thm)],[f_6_2]) ).
fof(f_9_1,plain,
! [A] :
( ! [B] :
( ( is_transitive_in(A,B)
| ? [C,D,E] :
( ~ in(ordered_pair(C,E),A)
& in(ordered_pair(D,E),A)
& in(ordered_pair(C,D),A)
& in(E,B)
& in(D,B)
& in(C,B) ) )
& ( ! [C,D,E] :
( in(ordered_pair(C,E),A)
| ~ in(ordered_pair(D,E),A)
| ~ in(ordered_pair(C,D),A)
| ~ in(E,B)
| ~ in(D,B)
| ~ in(C,B) )
| ~ is_transitive_in(A,B) ) )
| ~ relation(A) ),
inference(fof_nnf,[status(thm)],[d8_relat_2]) ).
fof(f_9_2,plain,
! [U_19] :
( ! [U_18] :
( ( is_transitive_in(U_19,U_18)
| ? [U_17,U_16,U_15] :
( ~ in(ordered_pair(U_17,U_15),U_19)
& in(ordered_pair(U_16,U_15),U_19)
& in(ordered_pair(U_17,U_16),U_19)
& in(U_15,U_18)
& in(U_16,U_18)
& in(U_17,U_18) ) )
& ( ! [U_14,U_13,U_12] :
( in(ordered_pair(U_14,U_12),U_19)
| ~ in(ordered_pair(U_13,U_12),U_19)
| ~ in(ordered_pair(U_14,U_13),U_19)
| ~ in(U_12,U_18)
| ~ in(U_13,U_18)
| ~ in(U_14,U_18) )
| ~ is_transitive_in(U_19,U_18) ) )
| ~ relation(U_19) ),
inference(variable_rename,[status(thm)],[f_9_1]) ).
fof(f_9_3,plain,
! [U_19] :
( ( ! [U_21] :
( is_transitive_in(U_19,U_21)
| ? [U_17,U_16,U_15] :
( ~ in(ordered_pair(U_17,U_15),U_19)
& in(ordered_pair(U_16,U_15),U_19)
& in(ordered_pair(U_17,U_16),U_19)
& in(U_15,U_21)
& in(U_16,U_21)
& in(U_17,U_21) ) )
& ! [U_20] :
( ! [U_14,U_13,U_12] :
( in(ordered_pair(U_14,U_12),U_19)
| ~ in(ordered_pair(U_13,U_12),U_19)
| ~ in(ordered_pair(U_14,U_13),U_19)
| ~ in(U_12,U_20)
| ~ in(U_13,U_20)
| ~ in(U_14,U_20) )
| ~ is_transitive_in(U_19,U_20) ) )
| ~ relation(U_19) ),
inference(miniscope,[status(thm)],[f_9_2]) ).
fof(f_9_4,plain,
! [U_19] :
( ( ! [U_21] :
( is_transitive_in(U_19,U_21)
| ? [U_16,U_15] :
( ~ in(ordered_pair(sK1(U_19,U_21),U_15),U_19)
& in(ordered_pair(U_16,U_15),U_19)
& in(ordered_pair(sK1(U_19,U_21),U_16),U_19)
& in(U_15,U_21)
& in(U_16,U_21)
& in(sK1(U_19,U_21),U_21) ) )
& ! [U_20] :
( ! [U_14,U_13,U_12] :
( in(ordered_pair(U_14,U_12),U_19)
| ~ in(ordered_pair(U_13,U_12),U_19)
| ~ in(ordered_pair(U_14,U_13),U_19)
| ~ in(U_12,U_20)
| ~ in(U_13,U_20)
| ~ in(U_14,U_20) )
| ~ is_transitive_in(U_19,U_20) ) )
| ~ relation(U_19) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_17,sK1(U_19,U_21))],[f_9_3]) ).
fof(f_9_5,plain,
! [U_19] :
( ( ! [U_21] :
( is_transitive_in(U_19,U_21)
| ? [U_15] :
( ~ in(ordered_pair(sK1(U_19,U_21),U_15),U_19)
& in(ordered_pair(sK2(U_19,U_21),U_15),U_19)
& in(ordered_pair(sK1(U_19,U_21),sK2(U_19,U_21)),U_19)
& in(U_15,U_21)
& in(sK2(U_19,U_21),U_21)
& in(sK1(U_19,U_21),U_21) ) )
& ! [U_20] :
( ! [U_14,U_13,U_12] :
( in(ordered_pair(U_14,U_12),U_19)
| ~ in(ordered_pair(U_13,U_12),U_19)
| ~ in(ordered_pair(U_14,U_13),U_19)
| ~ in(U_12,U_20)
| ~ in(U_13,U_20)
| ~ in(U_14,U_20) )
| ~ is_transitive_in(U_19,U_20) ) )
| ~ relation(U_19) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_16,sK2(U_19,U_21))],[f_9_4]) ).
fof(f_9_6,plain,
! [U_19] :
( ( ! [U_21] :
( is_transitive_in(U_19,U_21)
| ( ~ in(ordered_pair(sK1(U_19,U_21),sK3(U_19,U_21)),U_19)
& in(ordered_pair(sK2(U_19,U_21),sK3(U_19,U_21)),U_19)
& in(ordered_pair(sK1(U_19,U_21),sK2(U_19,U_21)),U_19)
& in(sK3(U_19,U_21),U_21)
& in(sK2(U_19,U_21),U_21)
& in(sK1(U_19,U_21),U_21) ) )
& ! [U_20] :
( ! [U_14,U_13,U_12] :
( in(ordered_pair(U_14,U_12),U_19)
| ~ in(ordered_pair(U_13,U_12),U_19)
| ~ in(ordered_pair(U_14,U_13),U_19)
| ~ in(U_12,U_20)
| ~ in(U_13,U_20)
| ~ in(U_14,U_20) )
| ~ is_transitive_in(U_19,U_20) ) )
| ~ relation(U_19) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_15,sK3(U_19,U_21))],[f_9_5]) ).
cnf(f_9_7,plain,
( in(ordered_pair(U_14,U_12),U_19)
| ~ in(ordered_pair(U_13,U_12),U_19)
| ~ in(ordered_pair(U_14,U_13),U_19)
| ~ in(U_12,U_20)
| ~ in(U_13,U_20)
| ~ in(U_14,U_20)
| ~ is_transitive_in(U_19,U_20)
| ~ relation(U_19) ),
inference(clausify,[status(thm)],[f_9_6]) ).
cnf(f_9_11,plain,
( in(ordered_pair(sK1(U_19,U_21),sK2(U_19,U_21)),U_19)
| is_transitive_in(U_19,U_21)
| ~ relation(U_19) ),
inference(clausify,[status(thm)],[f_9_6]) ).
cnf(f_9_12,plain,
( in(ordered_pair(sK2(U_19,U_21),sK3(U_19,U_21)),U_19)
| is_transitive_in(U_19,U_21)
| ~ relation(U_19) ),
inference(clausify,[status(thm)],[f_9_6]) ).
cnf(f_9_13,plain,
( ~ in(ordered_pair(sK1(U_19,U_21),sK3(U_19,U_21)),U_19)
| is_transitive_in(U_19,U_21)
| ~ relation(U_19) ),
inference(clausify,[status(thm)],[f_9_6]) ).
fof(f_25_1,negated_conjecture,
~ ! [A] :
( relation(A)
=> ( transitive(A)
<=> ! [B,C,D] :
( ( in(ordered_pair(C,D),A)
& in(ordered_pair(B,C),A) )
=> in(ordered_pair(B,D),A) ) ) ),
inference(negate,[status(cth)],[l2_wellord1]) ).
fof(f_25_2,negated_conjecture,
? [A] :
( ( ( ~ transitive(A)
& ! [B,C,D] :
( in(ordered_pair(B,D),A)
| ~ in(ordered_pair(C,D),A)
| ~ in(ordered_pair(B,C),A) ) )
| ( ? [B,C,D] :
( ~ in(ordered_pair(B,D),A)
& in(ordered_pair(C,D),A)
& in(ordered_pair(B,C),A) )
& transitive(A) ) )
& relation(A) ),
inference(fof_nnf,[status(thm)],[f_25_1]) ).
fof(f_25_3,negated_conjecture,
? [U_38] :
( ( ( ~ transitive(U_38)
& ! [U_37,U_36,U_35] :
( in(ordered_pair(U_37,U_35),U_38)
| ~ in(ordered_pair(U_36,U_35),U_38)
| ~ in(ordered_pair(U_37,U_36),U_38) ) )
| ( ? [U_34,U_33,U_32] :
( ~ in(ordered_pair(U_34,U_32),U_38)
& in(ordered_pair(U_33,U_32),U_38)
& in(ordered_pair(U_34,U_33),U_38) )
& transitive(U_38) ) )
& relation(U_38) ),
inference(variable_rename,[status(thm)],[f_25_2]) ).
fof(f_25_4,negated_conjecture,
( ( ( ~ transitive(sK5)
& ! [U_37,U_36,U_35] :
( in(ordered_pair(U_37,U_35),sK5)
| ~ in(ordered_pair(U_36,U_35),sK5)
| ~ in(ordered_pair(U_37,U_36),sK5) ) )
| ( ? [U_34,U_33,U_32] :
( ~ in(ordered_pair(U_34,U_32),sK5)
& in(ordered_pair(U_33,U_32),sK5)
& in(ordered_pair(U_34,U_33),sK5) )
& transitive(sK5) ) )
& relation(sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_38,sK5)],[f_25_3]) ).
fof(f_25_5,negated_conjecture,
( ( ( ~ transitive(sK5)
& ! [U_37,U_36,U_35] :
( in(ordered_pair(U_37,U_35),sK5)
| ~ in(ordered_pair(U_36,U_35),sK5)
| ~ in(ordered_pair(U_37,U_36),sK5) ) )
| ( ? [U_33,U_32] :
( ~ in(ordered_pair(sK6,U_32),sK5)
& in(ordered_pair(U_33,U_32),sK5)
& in(ordered_pair(sK6,U_33),sK5) )
& transitive(sK5) ) )
& relation(sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_34,sK6)],[f_25_4]) ).
fof(f_25_6,negated_conjecture,
( ( ( ~ transitive(sK5)
& ! [U_37,U_36,U_35] :
( in(ordered_pair(U_37,U_35),sK5)
| ~ in(ordered_pair(U_36,U_35),sK5)
| ~ in(ordered_pair(U_37,U_36),sK5) ) )
| ( ? [U_32] :
( ~ in(ordered_pair(sK6,U_32),sK5)
& in(ordered_pair(sK7,U_32),sK5)
& in(ordered_pair(sK6,sK7),sK5) )
& transitive(sK5) ) )
& relation(sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_33,sK7)],[f_25_5]) ).
fof(f_25_7,negated_conjecture,
( ( ( ~ transitive(sK5)
& ! [U_37,U_36,U_35] :
( in(ordered_pair(U_37,U_35),sK5)
| ~ in(ordered_pair(U_36,U_35),sK5)
| ~ in(ordered_pair(U_37,U_36),sK5) ) )
| ( ~ in(ordered_pair(sK6,sK8),sK5)
& in(ordered_pair(sK7,sK8),sK5)
& in(ordered_pair(sK6,sK7),sK5)
& transitive(sK5) ) )
& relation(sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_32,sK8)],[f_25_6]) ).
cnf(f_25_8,negated_conjecture,
relation(sK5),
inference(clausify,[status(thm)],[f_25_7]) ).
cnf(f_25_9,negated_conjecture,
( in(ordered_pair(U_37,U_35),sK5)
| ~ in(ordered_pair(U_36,U_35),sK5)
| ~ in(ordered_pair(U_37,U_36),sK5)
| transitive(sK5) ),
inference(clausify,[status(thm)],[f_25_7]) ).
cnf(f_25_14,negated_conjecture,
( in(ordered_pair(sK6,sK7),sK5)
| ~ transitive(sK5) ),
inference(clausify,[status(thm)],[f_25_7]) ).
cnf(f_25_15,negated_conjecture,
( in(ordered_pair(sK7,sK8),sK5)
| ~ transitive(sK5) ),
inference(clausify,[status(thm)],[f_25_7]) ).
cnf(f_25_16,negated_conjecture,
( ~ in(ordered_pair(sK6,sK8),sK5)
| ~ transitive(sK5) ),
inference(clausify,[status(thm)],[f_25_7]) ).
fof(f_34_1,plain,
! [A,B,C] :
( ( in(B,relation_field(C))
& in(A,relation_field(C)) )
| ~ in(ordered_pair(A,B),C)
| ~ relation(C) ),
inference(fof_nnf,[status(thm)],[t30_relat_1]) ).
fof(f_34_2,plain,
! [U_51,U_50,U_49] :
( ( in(U_50,relation_field(U_49))
& in(U_51,relation_field(U_49)) )
| ~ in(ordered_pair(U_51,U_50),U_49)
| ~ relation(U_49) ),
inference(variable_rename,[status(thm)],[f_34_1]) ).
cnf(f_34_3,plain,
( in(U_51,relation_field(U_49))
| ~ in(ordered_pair(U_51,U_50),U_49)
| ~ relation(U_49) ),
inference(clausify,[status(thm)],[f_34_2]) ).
cnf(f_34_4,plain,
( in(U_50,relation_field(U_49))
| ~ in(ordered_pair(U_51,U_50),U_49)
| ~ relation(U_49) ),
inference(clausify,[status(thm)],[f_34_2]) ).
cnf(t1,plain,
( ~ in(ordered_pair(sK6,sK8),sK5)
| ~ transitive(sK5) ),
inference(start,[status(thm),parent(0:0)],[f_25_16]) ).
cnf(t2,plain,
( ~ is_transitive_in(sK5,relation_field(sK5))
| ~ relation(sK5)
| transitive(sK5) ),
inference(extension,[status(thm),parent(t1:1)],[f_6_4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
relation(sK5),
inference(extension,[status(thm),parent(t2:2)],[f_25_8]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(l2,lemma,
relation(sK5),
inference(lemma,[status(cth),parent(t2:2),below(t1:1)],[t2:2]) ).
cnf(t6,plain,
( ~ in(ordered_pair(sK1(sK5,relation_field(sK5)),sK3(sK5,relation_field(sK5))),sK5)
| ~ relation(sK5)
| is_transitive_in(sK5,relation_field(sK5)) ),
inference(extension,[status(thm),parent(t2:3)],[f_9_13]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
relation(sK5),
inference(lemma_extension,[status(thm),parent(t6:2)],[l2:1]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( ~ in(ordered_pair(sK1(sK5,relation_field(sK5)),sK2(sK5,relation_field(sK5))),sK5)
| ~ in(ordered_pair(sK2(sK5,relation_field(sK5)),sK3(sK5,relation_field(sK5))),sK5)
| transitive(sK5)
| in(ordered_pair(sK1(sK5,relation_field(sK5)),sK3(sK5,relation_field(sK5))),sK5) ),
inference(extension,[status(thm),parent(t6:3)],[f_25_9]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t6:3]) ).
cnf(t12,plain,
$false,
inference(reduction,[status(thm),parent(t10:2)],[t10:2,t1:1]) ).
cnf(t13,plain,
( is_transitive_in(sK5,relation_field(sK5))
| ~ relation(sK5)
| in(ordered_pair(sK2(sK5,relation_field(sK5)),sK3(sK5,relation_field(sK5))),sK5) ),
inference(extension,[status(thm),parent(t10:3)],[f_9_12]) ).
cnf(t14,plain,
$false,
inference(connection,[status(thm),parent(t13:1)],[t13:1,t10:3]) ).
cnf(t15,plain,
relation(sK5),
inference(lemma_extension,[status(thm),parent(t13:2)],[l2:1]) ).
cnf(t16,plain,
$false,
inference(connection,[status(thm),parent(t15:1)],[t15:1,t13:2]) ).
cnf(t17,plain,
$false,
inference(reduction,[status(thm),parent(t13:3)],[t13:3,t2:3]) ).
cnf(t18,plain,
( is_transitive_in(sK5,relation_field(sK5))
| ~ relation(sK5)
| in(ordered_pair(sK1(sK5,relation_field(sK5)),sK2(sK5,relation_field(sK5))),sK5) ),
inference(extension,[status(thm),parent(t10:4)],[f_9_11]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t10:4]) ).
cnf(t20,plain,
relation(sK5),
inference(lemma_extension,[status(thm),parent(t18:2)],[l2:1]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
$false,
inference(reduction,[status(thm),parent(t18:3)],[t18:3,t2:3]) ).
cnf(l1,lemma,
transitive(sK5),
inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).
cnf(t23,plain,
( ~ in(ordered_pair(sK6,sK7),sK5)
| ~ in(ordered_pair(sK7,sK8),sK5)
| transitive(sK5)
| in(ordered_pair(sK6,sK8),sK5) ),
inference(extension,[status(thm),parent(t1:2)],[f_25_9]) ).
cnf(t24,plain,
$false,
inference(connection,[status(thm),parent(t23:1)],[t23:1,t1:2]) ).
cnf(t25,plain,
( is_transitive_in(sK5,relation_field(sK5))
| ~ relation(sK5)
| ~ transitive(sK5) ),
inference(extension,[status(thm),parent(t23:2)],[f_6_3]) ).
cnf(t26,plain,
$false,
inference(connection,[status(thm),parent(t25:1)],[t25:1,t23:2]) ).
cnf(t27,plain,
relation(sK5),
inference(extension,[status(thm),parent(t25:2)],[f_25_8]) ).
cnf(t28,plain,
$false,
inference(connection,[status(thm),parent(t27:1)],[t27:1,t25:2]) ).
cnf(l12,lemma,
relation(sK5),
inference(lemma,[status(cth),parent(t25:2),below(t23:2)],[t25:2]) ).
cnf(t29,plain,
( in(ordered_pair(sK6,sK8),sK5)
| ~ in(sK6,relation_field(sK5))
| ~ in(sK7,relation_field(sK5))
| ~ in(sK8,relation_field(sK5))
| ~ in(ordered_pair(sK6,sK7),sK5)
| ~ in(ordered_pair(sK7,sK8),sK5)
| ~ relation(sK5)
| ~ is_transitive_in(sK5,relation_field(sK5)) ),
inference(extension,[status(thm),parent(t25:3)],[f_9_7]) ).
cnf(t30,plain,
$false,
inference(connection,[status(thm),parent(t29:1)],[t29:1,t25:3]) ).
cnf(t31,plain,
relation(sK5),
inference(lemma_extension,[status(thm),parent(t29:2)],[l12:1]) ).
cnf(t32,plain,
$false,
inference(connection,[status(thm),parent(t31:1)],[t31:1,t29:2]) ).
cnf(t33,plain,
( ~ transitive(sK5)
| in(ordered_pair(sK7,sK8),sK5) ),
inference(extension,[status(thm),parent(t29:3)],[f_25_15]) ).
cnf(t34,plain,
$false,
inference(connection,[status(thm),parent(t33:1)],[t33:1,t29:3]) ).
cnf(t35,plain,
transitive(sK5),
inference(lemma_extension,[status(thm),parent(t33:2)],[l1:1]) ).
cnf(t36,plain,
$false,
inference(connection,[status(thm),parent(t35:1)],[t35:1,t33:2]) ).
cnf(t37,plain,
( ~ transitive(sK5)
| in(ordered_pair(sK6,sK7),sK5) ),
inference(extension,[status(thm),parent(t29:4)],[f_25_14]) ).
cnf(t38,plain,
$false,
inference(connection,[status(thm),parent(t37:1)],[t37:1,t29:4]) ).
cnf(t39,plain,
transitive(sK5),
inference(lemma_extension,[status(thm),parent(t37:2)],[l1:1]) ).
cnf(t40,plain,
$false,
inference(connection,[status(thm),parent(t39:1)],[t39:1,t37:2]) ).
cnf(t41,plain,
( ~ in(ordered_pair(sK7,sK8),sK5)
| ~ relation(sK5)
| in(sK8,relation_field(sK5)) ),
inference(extension,[status(thm),parent(t29:5)],[f_34_4]) ).
cnf(t42,plain,
$false,
inference(connection,[status(thm),parent(t41:1)],[t41:1,t29:5]) ).
cnf(t43,plain,
relation(sK5),
inference(lemma_extension,[status(thm),parent(t41:2)],[l12:1]) ).
cnf(t44,plain,
$false,
inference(connection,[status(thm),parent(t43:1)],[t43:1,t41:2]) ).
cnf(t45,plain,
( ~ transitive(sK5)
| in(ordered_pair(sK7,sK8),sK5) ),
inference(extension,[status(thm),parent(t41:3)],[f_25_15]) ).
cnf(t46,plain,
$false,
inference(connection,[status(thm),parent(t45:1)],[t45:1,t41:3]) ).
cnf(t47,plain,
transitive(sK5),
inference(lemma_extension,[status(thm),parent(t45:2)],[l1:1]) ).
cnf(t48,plain,
$false,
inference(connection,[status(thm),parent(t47:1)],[t47:1,t45:2]) ).
cnf(t49,plain,
( ~ in(ordered_pair(sK6,sK7),sK5)
| ~ relation(sK5)
| in(sK7,relation_field(sK5)) ),
inference(extension,[status(thm),parent(t29:6)],[f_34_4]) ).
cnf(t50,plain,
$false,
inference(connection,[status(thm),parent(t49:1)],[t49:1,t29:6]) ).
cnf(t51,plain,
relation(sK5),
inference(lemma_extension,[status(thm),parent(t49:2)],[l12:1]) ).
cnf(t52,plain,
$false,
inference(connection,[status(thm),parent(t51:1)],[t51:1,t49:2]) ).
cnf(t53,plain,
( ~ transitive(sK5)
| in(ordered_pair(sK6,sK7),sK5) ),
inference(extension,[status(thm),parent(t49:3)],[f_25_14]) ).
cnf(t54,plain,
$false,
inference(connection,[status(thm),parent(t53:1)],[t53:1,t49:3]) ).
cnf(t55,plain,
transitive(sK5),
inference(lemma_extension,[status(thm),parent(t53:2)],[l1:1]) ).
cnf(t56,plain,
$false,
inference(connection,[status(thm),parent(t55:1)],[t55:1,t53:2]) ).
cnf(t57,plain,
( ~ in(ordered_pair(sK6,sK7),sK5)
| ~ relation(sK5)
| in(sK6,relation_field(sK5)) ),
inference(extension,[status(thm),parent(t29:7)],[f_34_3]) ).
cnf(t58,plain,
$false,
inference(connection,[status(thm),parent(t57:1)],[t57:1,t29:7]) ).
cnf(t59,plain,
relation(sK5),
inference(lemma_extension,[status(thm),parent(t57:2)],[l12:1]) ).
cnf(t60,plain,
$false,
inference(connection,[status(thm),parent(t59:1)],[t59:1,t57:2]) ).
cnf(t61,plain,
( ~ transitive(sK5)
| in(ordered_pair(sK6,sK7),sK5) ),
inference(extension,[status(thm),parent(t57:3)],[f_25_14]) ).
cnf(t62,plain,
$false,
inference(connection,[status(thm),parent(t61:1)],[t61:1,t57:3]) ).
cnf(t63,plain,
transitive(sK5),
inference(lemma_extension,[status(thm),parent(t61:2)],[l1:1]) ).
cnf(t64,plain,
$false,
inference(connection,[status(thm),parent(t63:1)],[t63:1,t61:2]) ).
cnf(t65,plain,
$false,
inference(reduction,[status(thm),parent(t29:8)],[t29:8,t1:2]) ).
cnf(t66,plain,
( ~ transitive(sK5)
| in(ordered_pair(sK7,sK8),sK5) ),
inference(extension,[status(thm),parent(t23:3)],[f_25_15]) ).
cnf(t67,plain,
$false,
inference(connection,[status(thm),parent(t66:1)],[t66:1,t23:3]) ).
cnf(t68,plain,
transitive(sK5),
inference(lemma_extension,[status(thm),parent(t66:2)],[l1:1]) ).
cnf(t69,plain,
$false,
inference(connection,[status(thm),parent(t68:1)],[t68:1,t66:2]) ).
cnf(t70,plain,
( ~ transitive(sK5)
| in(ordered_pair(sK6,sK7),sK5) ),
inference(extension,[status(thm),parent(t23:4)],[f_25_14]) ).
cnf(t71,plain,
$false,
inference(connection,[status(thm),parent(t70:1)],[t70:1,t23:4]) ).
cnf(t72,plain,
transitive(sK5),
inference(lemma_extension,[status(thm),parent(t70:2)],[l1:1]) ).
cnf(t73,plain,
$false,
inference(connection,[status(thm),parent(t72:1)],[t72:1,t70:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU240+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/1.37 % Computer : n016.cluster.edu
% 0.08/1.37 % Model : x86_64 x86_64
% 0.08/1.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/1.37 % Memory : 8046.5625MB
% 0.08/1.37 % OS : Linux 6.8.0-71-generic
% 0.08/1.37 % CPULimit : 300
% 0.08/1.37 % WCLimit : 300
% 0.08/1.37 % DateTime : Sat Sep 19 23:42:40 UTC 2026
% 0.08/1.37 % CPUTime :
% 77.55/78.84 % SZS status Theorem for theBenchmark
% 77.55/78.84 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------