%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT015+1 : TPTP v9.3.1. Released v2.0.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:50:34 AM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 95 ( 61 unt; 0 def)
% Number of atoms : 386 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 407 ( 116 ~; 101 |; 185 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 166 ( 0 sgn 89 !; 57 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp5,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('theBenchmark.p',mp5) ).
fof(a12_FOL,hypothesis,
! [X,Y,C,C1,C2,I1,I2,T1,T2] :
( ( greater(C2,C1)
& inertia(Y,I2,T2)
& inertia(X,I1,T1)
& complexity(Y,C2,T2)
& complexity(X,C1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(I2,I1) ),
file('theBenchmark.p',a12_FOL) ).
fof(a13_FOL,hypothesis,
! [X,Y,Rt,C,I1,I2,Ta,Tb,Tc] :
( ( greater(I2,I1)
& inertia(Y,I2,Ta)
& inertia(X,I1,Ta)
& reorganization_type(Y,Rt,Ta)
& reorganization_type(X,Rt,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) )
=> greater(Tc,Tb) ),
file('theBenchmark.p',a13_FOL) ).
fof(t15_FOL,conjecture,
! [X,Y,Re,C,C1,C2,Ta,Tb,Tc] :
( ( greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,Ta)
& reorganization_type(Y,Re,Ta)
& reorganization_type(X,Re,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) )
=> greater(Tc,Tb) ),
file('theBenchmark.p',t15_FOL) ).
fof(f_1_1,plain,
! [X,T] :
( ? [I] : inertia(X,I,T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp5]) ).
fof(f_1_2,plain,
! [U_2,U_1] :
( ? [U_0] : inertia(U_2,U_0,U_1)
| ~ organization(U_2,U_1) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_2,U_1] :
( inertia(U_2,sK1(U_2,U_1),U_1)
| ~ organization(U_2,U_1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_2,U_1))],[f_1_2]) ).
cnf(f_1_4,plain,
( inertia(U_2,sK1(U_2,U_1),U_1)
| ~ organization(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
! [X,Y,C,C1,C2,I1,I2,T1,T2] :
( greater(I2,I1)
| ~ greater(C2,C1)
| ~ inertia(Y,I2,T2)
| ~ inertia(X,I1,T1)
| ~ complexity(Y,C2,T2)
| ~ complexity(X,C1,T1)
| ~ class(Y,C,T2)
| ~ class(X,C,T1)
| ~ organization(Y,T2)
| ~ organization(X,T1) ),
inference(fof_nnf,[status(thm)],[a12_FOL]) ).
fof(f_2_2,plain,
! [U_11,U_10,U_9,U_8,U_7,U_6,U_5,U_4,U_3] :
( greater(U_5,U_6)
| ~ greater(U_7,U_8)
| ~ inertia(U_10,U_5,U_3)
| ~ inertia(U_11,U_6,U_4)
| ~ complexity(U_10,U_7,U_3)
| ~ complexity(U_11,U_8,U_4)
| ~ class(U_10,U_9,U_3)
| ~ class(U_11,U_9,U_4)
| ~ organization(U_10,U_3)
| ~ organization(U_11,U_4) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
! [U_11,U_10,U_9,U_8,U_7,U_6,U_5] :
( ! [U_4] :
( ~ inertia(U_11,U_6,U_4)
| ~ complexity(U_11,U_8,U_4)
| ~ class(U_11,U_9,U_4)
| ~ organization(U_11,U_4) )
| ! [U_3] :
( ~ inertia(U_10,U_5,U_3)
| ~ complexity(U_10,U_7,U_3)
| ~ class(U_10,U_9,U_3)
| ~ organization(U_10,U_3) )
| ~ greater(U_7,U_8)
| greater(U_5,U_6) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
cnf(f_2_4,plain,
( ~ inertia(U_11,U_6,U_4)
| ~ complexity(U_11,U_8,U_4)
| ~ class(U_11,U_9,U_4)
| ~ organization(U_11,U_4)
| ~ inertia(U_10,U_5,U_3)
| ~ complexity(U_10,U_7,U_3)
| ~ class(U_10,U_9,U_3)
| ~ organization(U_10,U_3)
| ~ greater(U_7,U_8)
| greater(U_5,U_6) ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [X,Y,Rt,C,I1,I2,Ta,Tb,Tc] :
( greater(Tc,Tb)
| ~ greater(I2,I1)
| ~ inertia(Y,I2,Ta)
| ~ inertia(X,I1,Ta)
| ~ reorganization_type(Y,Rt,Ta)
| ~ reorganization_type(X,Rt,Ta)
| ~ reorganization(Y,Ta,Tc)
| ~ reorganization(X,Ta,Tb)
| ~ class(Y,C,Ta)
| ~ class(X,C,Ta)
| ~ organization(Y,Tc)
| ~ organization(Y,Ta)
| ~ organization(X,Ta) ),
inference(fof_nnf,[status(thm)],[a13_FOL]) ).
fof(f_3_2,plain,
! [U_20,U_19,U_18,U_17,U_16,U_15,U_14,U_13,U_12] :
( greater(U_12,U_13)
| ~ greater(U_15,U_16)
| ~ inertia(U_19,U_15,U_14)
| ~ inertia(U_20,U_16,U_14)
| ~ reorganization_type(U_19,U_18,U_14)
| ~ reorganization_type(U_20,U_18,U_14)
| ~ reorganization(U_19,U_14,U_12)
| ~ reorganization(U_20,U_14,U_13)
| ~ class(U_19,U_17,U_14)
| ~ class(U_20,U_17,U_14)
| ~ organization(U_19,U_12)
| ~ organization(U_19,U_14)
| ~ organization(U_20,U_14) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( greater(U_12,U_13)
| ~ greater(U_15,U_16)
| ~ inertia(U_19,U_15,U_14)
| ~ inertia(U_20,U_16,U_14)
| ~ reorganization_type(U_19,U_18,U_14)
| ~ reorganization_type(U_20,U_18,U_14)
| ~ reorganization(U_19,U_14,U_12)
| ~ reorganization(U_20,U_14,U_13)
| ~ class(U_19,U_17,U_14)
| ~ class(U_20,U_17,U_14)
| ~ organization(U_19,U_12)
| ~ organization(U_19,U_14)
| ~ organization(U_20,U_14) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,negated_conjecture,
~ ! [X,Y,Re,C,C1,C2,Ta,Tb,Tc] :
( ( greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,Ta)
& reorganization_type(Y,Re,Ta)
& reorganization_type(X,Re,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) )
=> greater(Tc,Tb) ),
inference(negate,[status(cth)],[t15_FOL]) ).
fof(f_4_2,negated_conjecture,
? [X,Y,Re,C,C1,C2,Ta,Tb,Tc] :
( ~ greater(Tc,Tb)
& greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,Ta)
& reorganization_type(Y,Re,Ta)
& reorganization_type(X,Re,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) ),
inference(fof_nnf,[status(thm)],[f_4_1]) ).
fof(f_4_3,negated_conjecture,
? [U_29,U_28,U_27,U_26,U_25,U_24,U_23,U_22,U_21] :
( ~ greater(U_21,U_22)
& greater(U_24,U_25)
& complexity(U_28,U_24,U_23)
& complexity(U_29,U_25,U_23)
& reorganization_type(U_28,U_27,U_23)
& reorganization_type(U_29,U_27,U_23)
& reorganization(U_28,U_23,U_21)
& reorganization(U_29,U_23,U_22)
& class(U_28,U_26,U_23)
& class(U_29,U_26,U_23)
& organization(U_28,U_21)
& organization(U_28,U_23)
& organization(U_29,U_23) ),
inference(variable_rename,[status(thm)],[f_4_2]) ).
fof(f_4_4,negated_conjecture,
? [U_28,U_27,U_26,U_25,U_24,U_23,U_22,U_21] :
( ~ greater(U_21,U_22)
& greater(U_24,U_25)
& complexity(U_28,U_24,U_23)
& complexity(sK2,U_25,U_23)
& reorganization_type(U_28,U_27,U_23)
& reorganization_type(sK2,U_27,U_23)
& reorganization(U_28,U_23,U_21)
& reorganization(sK2,U_23,U_22)
& class(U_28,U_26,U_23)
& class(sK2,U_26,U_23)
& organization(U_28,U_21)
& organization(U_28,U_23)
& organization(sK2,U_23) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_29,sK2)],[f_4_3]) ).
fof(f_4_5,negated_conjecture,
? [U_27,U_26,U_25,U_24,U_23,U_22,U_21] :
( ~ greater(U_21,U_22)
& greater(U_24,U_25)
& complexity(sK3,U_24,U_23)
& complexity(sK2,U_25,U_23)
& reorganization_type(sK3,U_27,U_23)
& reorganization_type(sK2,U_27,U_23)
& reorganization(sK3,U_23,U_21)
& reorganization(sK2,U_23,U_22)
& class(sK3,U_26,U_23)
& class(sK2,U_26,U_23)
& organization(sK3,U_21)
& organization(sK3,U_23)
& organization(sK2,U_23) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_28,sK3)],[f_4_4]) ).
fof(f_4_6,negated_conjecture,
? [U_26,U_25,U_24,U_23,U_22,U_21] :
( ~ greater(U_21,U_22)
& greater(U_24,U_25)
& complexity(sK3,U_24,U_23)
& complexity(sK2,U_25,U_23)
& reorganization_type(sK3,sK4,U_23)
& reorganization_type(sK2,sK4,U_23)
& reorganization(sK3,U_23,U_21)
& reorganization(sK2,U_23,U_22)
& class(sK3,U_26,U_23)
& class(sK2,U_26,U_23)
& organization(sK3,U_21)
& organization(sK3,U_23)
& organization(sK2,U_23) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_27,sK4)],[f_4_5]) ).
fof(f_4_7,negated_conjecture,
? [U_25,U_24,U_23,U_22,U_21] :
( ~ greater(U_21,U_22)
& greater(U_24,U_25)
& complexity(sK3,U_24,U_23)
& complexity(sK2,U_25,U_23)
& reorganization_type(sK3,sK4,U_23)
& reorganization_type(sK2,sK4,U_23)
& reorganization(sK3,U_23,U_21)
& reorganization(sK2,U_23,U_22)
& class(sK3,sK5,U_23)
& class(sK2,sK5,U_23)
& organization(sK3,U_21)
& organization(sK3,U_23)
& organization(sK2,U_23) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_26,sK5)],[f_4_6]) ).
fof(f_4_8,negated_conjecture,
? [U_24,U_23,U_22,U_21] :
( ~ greater(U_21,U_22)
& greater(U_24,sK6)
& complexity(sK3,U_24,U_23)
& complexity(sK2,sK6,U_23)
& reorganization_type(sK3,sK4,U_23)
& reorganization_type(sK2,sK4,U_23)
& reorganization(sK3,U_23,U_21)
& reorganization(sK2,U_23,U_22)
& class(sK3,sK5,U_23)
& class(sK2,sK5,U_23)
& organization(sK3,U_21)
& organization(sK3,U_23)
& organization(sK2,U_23) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_25,sK6)],[f_4_7]) ).
fof(f_4_9,negated_conjecture,
? [U_23,U_22,U_21] :
( ~ greater(U_21,U_22)
& greater(sK7,sK6)
& complexity(sK3,sK7,U_23)
& complexity(sK2,sK6,U_23)
& reorganization_type(sK3,sK4,U_23)
& reorganization_type(sK2,sK4,U_23)
& reorganization(sK3,U_23,U_21)
& reorganization(sK2,U_23,U_22)
& class(sK3,sK5,U_23)
& class(sK2,sK5,U_23)
& organization(sK3,U_21)
& organization(sK3,U_23)
& organization(sK2,U_23) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_24,sK7)],[f_4_8]) ).
fof(f_4_10,negated_conjecture,
? [U_22,U_21] :
( ~ greater(U_21,U_22)
& greater(sK7,sK6)
& complexity(sK3,sK7,sK8)
& complexity(sK2,sK6,sK8)
& reorganization_type(sK3,sK4,sK8)
& reorganization_type(sK2,sK4,sK8)
& reorganization(sK3,sK8,U_21)
& reorganization(sK2,sK8,U_22)
& class(sK3,sK5,sK8)
& class(sK2,sK5,sK8)
& organization(sK3,U_21)
& organization(sK3,sK8)
& organization(sK2,sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_23,sK8)],[f_4_9]) ).
fof(f_4_11,negated_conjecture,
? [U_21] :
( ~ greater(U_21,sK9)
& greater(sK7,sK6)
& complexity(sK3,sK7,sK8)
& complexity(sK2,sK6,sK8)
& reorganization_type(sK3,sK4,sK8)
& reorganization_type(sK2,sK4,sK8)
& reorganization(sK3,sK8,U_21)
& reorganization(sK2,sK8,sK9)
& class(sK3,sK5,sK8)
& class(sK2,sK5,sK8)
& organization(sK3,U_21)
& organization(sK3,sK8)
& organization(sK2,sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(U_22,sK9)],[f_4_10]) ).
fof(f_4_12,negated_conjecture,
( ~ greater(sK10,sK9)
& greater(sK7,sK6)
& complexity(sK3,sK7,sK8)
& complexity(sK2,sK6,sK8)
& reorganization_type(sK3,sK4,sK8)
& reorganization_type(sK2,sK4,sK8)
& reorganization(sK3,sK8,sK10)
& reorganization(sK2,sK8,sK9)
& class(sK3,sK5,sK8)
& class(sK2,sK5,sK8)
& organization(sK3,sK10)
& organization(sK3,sK8)
& organization(sK2,sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(U_21,sK10)],[f_4_11]) ).
fof(f_4_13,negated_conjecture,
( ~ greater(sK10,sK9)
& greater(sK7,sK6)
& complexity(sK3,sK7,sK8)
& complexity(sK2,sK6,sK8)
& reorganization_type(sK3,sK4,sK8)
& reorganization_type(sK2,sK4,sK8)
& reorganization(sK3,sK8,sK10)
& reorganization(sK2,sK8,sK9)
& class(sK3,sK5,sK8)
& class(sK2,sK5,sK8)
& organization(sK3,sK10)
& organization(sK3,sK8)
& organization(sK2,sK8) ),
inference(definitional_conversion,[status(esa)],[f_4_12]) ).
cnf(f_4_14,negated_conjecture,
organization(sK2,sK8),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_15,negated_conjecture,
organization(sK3,sK8),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_16,negated_conjecture,
organization(sK3,sK10),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_17,negated_conjecture,
class(sK2,sK5,sK8),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_18,negated_conjecture,
class(sK3,sK5,sK8),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_19,negated_conjecture,
reorganization(sK2,sK8,sK9),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_20,negated_conjecture,
reorganization(sK3,sK8,sK10),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_21,negated_conjecture,
reorganization_type(sK2,sK4,sK8),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_22,negated_conjecture,
reorganization_type(sK3,sK4,sK8),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_23,negated_conjecture,
complexity(sK2,sK6,sK8),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_24,negated_conjecture,
complexity(sK3,sK7,sK8),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_25,negated_conjecture,
greater(sK7,sK6),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(f_4_26,negated_conjecture,
~ greater(sK10,sK9),
inference(clausify,[status(thm)],[f_4_13]) ).
cnf(t1,plain,
~ greater(sK10,sK9),
inference(start,[status(thm),parent(0:0)],[f_4_26]) ).
cnf(t2,plain,
( ~ organization(sK3,sK8)
| ~ organization(sK3,sK10)
| ~ class(sK2,sK5,sK8)
| ~ class(sK3,sK5,sK8)
| ~ reorganization(sK2,sK8,sK9)
| ~ reorganization(sK3,sK8,sK10)
| ~ reorganization_type(sK2,sK4,sK8)
| ~ reorganization_type(sK3,sK4,sK8)
| ~ inertia(sK2,sK1(sK2,sK8),sK8)
| ~ inertia(sK3,sK1(sK3,sK8),sK8)
| ~ greater(sK1(sK3,sK8),sK1(sK2,sK8))
| ~ organization(sK2,sK8)
| greater(sK10,sK9) ),
inference(extension,[status(thm),parent(t1:1)],[f_3_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
organization(sK2,sK8),
inference(extension,[status(thm),parent(t2:2)],[f_4_14]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(l2,lemma,
organization(sK2,sK8),
inference(lemma,[status(cth),parent(t2:2),below(t1:1)],[t2:2]) ).
cnf(t6,plain,
( ~ greater(sK7,sK6)
| ~ organization(sK3,sK8)
| ~ class(sK3,sK5,sK8)
| ~ complexity(sK3,sK7,sK8)
| ~ inertia(sK3,sK1(sK3,sK8),sK8)
| ~ organization(sK2,sK8)
| ~ class(sK2,sK5,sK8)
| ~ complexity(sK2,sK6,sK8)
| ~ inertia(sK2,sK1(sK2,sK8),sK8)
| greater(sK1(sK3,sK8),sK1(sK2,sK8)) ),
inference(extension,[status(thm),parent(t2:3)],[f_2_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( ~ organization(sK2,sK8)
| inertia(sK2,sK1(sK2,sK8),sK8) ),
inference(extension,[status(thm),parent(t6:2)],[f_1_4]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
organization(sK2,sK8),
inference(extension,[status(thm),parent(t8:2)],[f_4_14]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
complexity(sK2,sK6,sK8),
inference(extension,[status(thm),parent(t6:3)],[f_4_23]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t6:3]) ).
cnf(t14,plain,
class(sK2,sK5,sK8),
inference(extension,[status(thm),parent(t6:4)],[f_4_17]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t6:4]) ).
cnf(t16,plain,
organization(sK2,sK8),
inference(lemma_extension,[status(thm),parent(t6:5)],[l2:1]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t6:5]) ).
cnf(t18,plain,
( ~ organization(sK3,sK8)
| inertia(sK3,sK1(sK3,sK8),sK8) ),
inference(extension,[status(thm),parent(t6:6)],[f_1_4]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t6:6]) ).
cnf(t20,plain,
organization(sK3,sK8),
inference(extension,[status(thm),parent(t18:2)],[f_4_15]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
complexity(sK3,sK7,sK8),
inference(extension,[status(thm),parent(t6:7)],[f_4_24]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t6:7]) ).
cnf(t24,plain,
class(sK3,sK5,sK8),
inference(extension,[status(thm),parent(t6:8)],[f_4_18]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t6:8]) ).
cnf(t26,plain,
organization(sK3,sK8),
inference(extension,[status(thm),parent(t6:9)],[f_4_15]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t6:9]) ).
cnf(t28,plain,
greater(sK7,sK6),
inference(extension,[status(thm),parent(t6:10)],[f_4_25]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t6:10]) ).
cnf(t30,plain,
( ~ organization(sK3,sK8)
| inertia(sK3,sK1(sK3,sK8),sK8) ),
inference(extension,[status(thm),parent(t2:4)],[f_1_4]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t2:4]) ).
cnf(t32,plain,
organization(sK3,sK8),
inference(extension,[status(thm),parent(t30:2)],[f_4_15]) ).
cnf(t33,plain,
$false,
inference(connection,[status(thm),parent(t32:1)],[t32:1,t30:2]) ).
cnf(t34,plain,
( ~ organization(sK2,sK8)
| inertia(sK2,sK1(sK2,sK8),sK8) ),
inference(extension,[status(thm),parent(t2:5)],[f_1_4]) ).
cnf(t35,plain,
$false,
inference(connection,[status(thm),parent(t34:1)],[t34:1,t2:5]) ).
cnf(t36,plain,
organization(sK2,sK8),
inference(lemma_extension,[status(thm),parent(t34:2)],[l2:1]) ).
cnf(t37,plain,
$false,
inference(connection,[status(thm),parent(t36:1)],[t36:1,t34:2]) ).
cnf(t38,plain,
reorganization_type(sK3,sK4,sK8),
inference(extension,[status(thm),parent(t2:6)],[f_4_22]) ).
cnf(t39,plain,
$false,
inference(connection,[status(thm),parent(t38:1)],[t38:1,t2:6]) ).
cnf(t40,plain,
reorganization_type(sK2,sK4,sK8),
inference(extension,[status(thm),parent(t2:7)],[f_4_21]) ).
cnf(t41,plain,
$false,
inference(connection,[status(thm),parent(t40:1)],[t40:1,t2:7]) ).
cnf(t42,plain,
reorganization(sK3,sK8,sK10),
inference(extension,[status(thm),parent(t2:8)],[f_4_20]) ).
cnf(t43,plain,
$false,
inference(connection,[status(thm),parent(t42:1)],[t42:1,t2:8]) ).
cnf(t44,plain,
reorganization(sK2,sK8,sK9),
inference(extension,[status(thm),parent(t2:9)],[f_4_19]) ).
cnf(t45,plain,
$false,
inference(connection,[status(thm),parent(t44:1)],[t44:1,t2:9]) ).
cnf(t46,plain,
class(sK3,sK5,sK8),
inference(extension,[status(thm),parent(t2:10)],[f_4_18]) ).
cnf(t47,plain,
$false,
inference(connection,[status(thm),parent(t46:1)],[t46:1,t2:10]) ).
cnf(t48,plain,
class(sK2,sK5,sK8),
inference(extension,[status(thm),parent(t2:11)],[f_4_17]) ).
cnf(t49,plain,
$false,
inference(connection,[status(thm),parent(t48:1)],[t48:1,t2:11]) ).
cnf(t50,plain,
organization(sK3,sK10),
inference(extension,[status(thm),parent(t2:12)],[f_4_16]) ).
cnf(t51,plain,
$false,
inference(connection,[status(thm),parent(t50:1)],[t50:1,t2:12]) ).
cnf(t52,plain,
organization(sK3,sK8),
inference(extension,[status(thm),parent(t2:13)],[f_4_15]) ).
cnf(t53,plain,
$false,
inference(connection,[status(thm),parent(t52:1)],[t52:1,t2:13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT015+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ 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.11/0.37 % Computer : n016.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 : Sat Sep 19 16:15:35 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------