%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT012+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 : n018.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 192.32s 192.67s
% Output : Proof 192.87s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(mp5,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('theBenchmark.p',mp5) ).
fof(mp6_1,axiom,
! [X,Y] :
~ ( X = Y
& greater(X,Y) ),
file('theBenchmark.p',mp6_1) ).
fof(mp6_2,axiom,
! [X,Y] :
~ ( greater(Y,X)
& greater(X,Y) ),
file('theBenchmark.p',mp6_2) ).
fof(mp9,axiom,
! [X,T] :
( organization(X,T)
=> ? [C] : class(X,C,T) ),
file('theBenchmark.p',mp9) ).
fof(mp10,axiom,
! [X,T1,T2,C1,C2] :
( ( class(X,C2,T2)
& class(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> C1 = C2 ),
file('theBenchmark.p',mp10) ).
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(t2_FOL,hypothesis,
! [X,I1,I2,T1,T2] :
( ( greater(T2,T1)
& inertia(X,I2,T2)
& inertia(X,I1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> greater(I2,I1) ),
file('theBenchmark.p',t2_FOL) ).
fof(t12_FOL,conjecture,
! [X,C1,C2,T1,T2] :
( ( greater(T2,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
file('theBenchmark.p',t12_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] :
( X != Y
| ~ greater(X,Y) ),
inference(fof_nnf,[status(thm)],[mp6_1]) ).
fof(f_2_2,plain,
! [U_4,U_3] :
( U_4 != U_3
| ~ greater(U_4,U_3) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( U_4 != U_3
| ~ greater(U_4,U_3) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
! [X,Y] :
( ~ greater(Y,X)
| ~ greater(X,Y) ),
inference(fof_nnf,[status(thm)],[mp6_2]) ).
fof(f_3_2,plain,
! [U_6,U_5] :
( ~ greater(U_5,U_6)
| ~ greater(U_6,U_5) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( ~ greater(U_5,U_6)
| ~ greater(U_6,U_5) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,plain,
! [X,T] :
( ? [C] : class(X,C,T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp9]) ).
fof(f_4_2,plain,
! [U_9,U_8] :
( ? [U_7] : class(U_9,U_7,U_8)
| ~ organization(U_9,U_8) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
! [U_9,U_8] :
( class(U_9,sK2(U_9,U_8),U_8)
| ~ organization(U_9,U_8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_7,sK2(U_9,U_8))],[f_4_2]) ).
cnf(f_4_4,plain,
( class(U_9,sK2(U_9,U_8),U_8)
| ~ organization(U_9,U_8) ),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
! [X,T1,T2,C1,C2] :
( C1 = C2
| ~ class(X,C2,T2)
| ~ class(X,C1,T1)
| ~ reorganization_free(X,T1,T2)
| ~ organization(X,T2)
| ~ organization(X,T1) ),
inference(fof_nnf,[status(thm)],[mp10]) ).
fof(f_5_2,plain,
! [U_14,U_13,U_12,U_11,U_10] :
( U_11 = U_10
| ~ class(U_14,U_10,U_12)
| ~ class(U_14,U_11,U_13)
| ~ reorganization_free(U_14,U_13,U_12)
| ~ organization(U_14,U_12)
| ~ organization(U_14,U_13) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
cnf(f_5_3,plain,
( U_11 = U_10
| ~ class(U_14,U_10,U_12)
| ~ class(U_14,U_11,U_13)
| ~ reorganization_free(U_14,U_13,U_12)
| ~ organization(U_14,U_12)
| ~ organization(U_14,U_13) ),
inference(clausify,[status(thm)],[f_5_2]) ).
fof(f_6_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_6_2,plain,
! [U_23,U_22,U_21,U_20,U_19,U_18,U_17,U_16,U_15] :
( greater(U_17,U_18)
| ~ greater(U_19,U_20)
| ~ inertia(U_22,U_17,U_15)
| ~ inertia(U_23,U_18,U_16)
| ~ complexity(U_22,U_19,U_15)
| ~ complexity(U_23,U_20,U_16)
| ~ class(U_22,U_21,U_15)
| ~ class(U_23,U_21,U_16)
| ~ organization(U_22,U_15)
| ~ organization(U_23,U_16) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
! [U_23,U_22,U_21,U_20,U_19,U_18,U_17] :
( ! [U_16] :
( ~ inertia(U_23,U_18,U_16)
| ~ complexity(U_23,U_20,U_16)
| ~ class(U_23,U_21,U_16)
| ~ organization(U_23,U_16) )
| ! [U_15] :
( ~ inertia(U_22,U_17,U_15)
| ~ complexity(U_22,U_19,U_15)
| ~ class(U_22,U_21,U_15)
| ~ organization(U_22,U_15) )
| ~ greater(U_19,U_20)
| greater(U_17,U_18) ),
inference(miniscope,[status(thm)],[f_6_2]) ).
cnf(f_6_4,plain,
( ~ inertia(U_23,U_18,U_16)
| ~ complexity(U_23,U_20,U_16)
| ~ class(U_23,U_21,U_16)
| ~ organization(U_23,U_16)
| ~ inertia(U_22,U_17,U_15)
| ~ complexity(U_22,U_19,U_15)
| ~ class(U_22,U_21,U_15)
| ~ organization(U_22,U_15)
| ~ greater(U_19,U_20)
| greater(U_17,U_18) ),
inference(clausify,[status(thm)],[f_6_3]) ).
fof(f_7_1,plain,
! [X,I1,I2,T1,T2] :
( greater(I2,I1)
| ~ greater(T2,T1)
| ~ inertia(X,I2,T2)
| ~ inertia(X,I1,T1)
| ~ reorganization_free(X,T1,T2)
| ~ organization(X,T2)
| ~ organization(X,T1) ),
inference(fof_nnf,[status(thm)],[t2_FOL]) ).
fof(f_7_2,plain,
! [U_28,U_27,U_26,U_25,U_24] :
( greater(U_26,U_27)
| ~ greater(U_24,U_25)
| ~ inertia(U_28,U_26,U_24)
| ~ inertia(U_28,U_27,U_25)
| ~ reorganization_free(U_28,U_25,U_24)
| ~ organization(U_28,U_24)
| ~ organization(U_28,U_25) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
! [U_28,U_27,U_26] :
( ! [U_25] :
( ! [U_24] :
( ~ greater(U_24,U_25)
| ~ inertia(U_28,U_26,U_24)
| ~ reorganization_free(U_28,U_25,U_24)
| ~ organization(U_28,U_24) )
| ~ inertia(U_28,U_27,U_25)
| ~ organization(U_28,U_25) )
| greater(U_26,U_27) ),
inference(miniscope,[status(thm)],[f_7_2]) ).
cnf(f_7_4,plain,
( ~ greater(U_24,U_25)
| ~ inertia(U_28,U_26,U_24)
| ~ reorganization_free(U_28,U_25,U_24)
| ~ organization(U_28,U_24)
| ~ inertia(U_28,U_27,U_25)
| ~ organization(U_28,U_25)
| greater(U_26,U_27) ),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,negated_conjecture,
~ ! [X,C1,C2,T1,T2] :
( ( greater(T2,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
inference(negate,[status(cth)],[t12_FOL]) ).
fof(f_8_2,negated_conjecture,
? [X,C1,C2,T1,T2] :
( greater(C1,C2)
& greater(T2,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) ),
inference(fof_nnf,[status(thm)],[f_8_1]) ).
fof(f_8_3,negated_conjecture,
? [U_33,U_32,U_31,U_30,U_29] :
( greater(U_32,U_31)
& greater(U_29,U_30)
& complexity(U_33,U_31,U_29)
& complexity(U_33,U_32,U_30)
& reorganization_free(U_33,U_30,U_29)
& organization(U_33,U_29)
& organization(U_33,U_30) ),
inference(variable_rename,[status(thm)],[f_8_2]) ).
fof(f_8_4,negated_conjecture,
? [U_33,U_32,U_31] :
( ? [U_30] :
( ? [U_29] :
( greater(U_29,U_30)
& complexity(U_33,U_31,U_29)
& reorganization_free(U_33,U_30,U_29)
& organization(U_33,U_29) )
& complexity(U_33,U_32,U_30)
& organization(U_33,U_30) )
& greater(U_32,U_31) ),
inference(miniscope,[status(thm)],[f_8_3]) ).
fof(f_8_5,negated_conjecture,
? [U_32,U_31] :
( ? [U_30] :
( ? [U_29] :
( greater(U_29,U_30)
& complexity(sK3,U_31,U_29)
& reorganization_free(sK3,U_30,U_29)
& organization(sK3,U_29) )
& complexity(sK3,U_32,U_30)
& organization(sK3,U_30) )
& greater(U_32,U_31) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_33,sK3)],[f_8_4]) ).
fof(f_8_6,negated_conjecture,
? [U_31] :
( ? [U_30] :
( ? [U_29] :
( greater(U_29,U_30)
& complexity(sK3,U_31,U_29)
& reorganization_free(sK3,U_30,U_29)
& organization(sK3,U_29) )
& complexity(sK3,sK4,U_30)
& organization(sK3,U_30) )
& greater(sK4,U_31) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_32,sK4)],[f_8_5]) ).
fof(f_8_7,negated_conjecture,
( ? [U_30] :
( ? [U_29] :
( greater(U_29,U_30)
& complexity(sK3,sK5,U_29)
& reorganization_free(sK3,U_30,U_29)
& organization(sK3,U_29) )
& complexity(sK3,sK4,U_30)
& organization(sK3,U_30) )
& greater(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_31,sK5)],[f_8_6]) ).
fof(f_8_8,negated_conjecture,
( ? [U_29] :
( greater(U_29,sK6)
& complexity(sK3,sK5,U_29)
& reorganization_free(sK3,sK6,U_29)
& organization(sK3,U_29) )
& complexity(sK3,sK4,sK6)
& organization(sK3,sK6)
& greater(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_30,sK6)],[f_8_7]) ).
fof(f_8_9,negated_conjecture,
( greater(sK7,sK6)
& complexity(sK3,sK5,sK7)
& reorganization_free(sK3,sK6,sK7)
& organization(sK3,sK7)
& complexity(sK3,sK4,sK6)
& organization(sK3,sK6)
& greater(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_29,sK7)],[f_8_8]) ).
cnf(f_8_10,negated_conjecture,
greater(sK4,sK5),
inference(clausify,[status(thm)],[f_8_9]) ).
cnf(f_8_11,negated_conjecture,
organization(sK3,sK6),
inference(clausify,[status(thm)],[f_8_9]) ).
cnf(f_8_12,negated_conjecture,
complexity(sK3,sK4,sK6),
inference(clausify,[status(thm)],[f_8_9]) ).
cnf(f_8_13,negated_conjecture,
organization(sK3,sK7),
inference(clausify,[status(thm)],[f_8_9]) ).
cnf(f_8_14,negated_conjecture,
reorganization_free(sK3,sK6,sK7),
inference(clausify,[status(thm)],[f_8_9]) ).
cnf(f_8_15,negated_conjecture,
complexity(sK3,sK5,sK7),
inference(clausify,[status(thm)],[f_8_9]) ).
cnf(f_8_16,negated_conjecture,
greater(sK7,sK6),
inference(clausify,[status(thm)],[f_8_9]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( sK1(Eq_x_0,Eq_x_1) = sK1(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( sK2(Eq_x_0,Eq_x_1) = sK2(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( organization(Eq_y_0,Eq_y_1)
| ~ organization(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_7,axiom,
( inertia(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ inertia(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_8,axiom,
( greater(Eq_y_0,Eq_y_1)
| ~ greater(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_9,axiom,
( class(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ class(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_10,axiom,
( reorganization_free(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ reorganization_free(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_11,axiom,
( complexity(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ complexity(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT012+1 : TPTP v9.3.1. Released v2.0.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.11/0.38 % Computer : n018.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sat Sep 19 16:13:11 UTC 2026
% 0.11/0.38 % CPUTime :
% 192.32/192.67 % SZS status Theorem for theBenchmark
% 192.32/192.67 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------