%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT012-1 : TPTP v9.3.1. Released v2.4.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 : n026.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 : Unsatisfiable 234.94s 235.22s
% Output : Proof 236.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(mp5_20,axiom,
( inertia(A,sk1(B,A),B)
| ~ organization(A,B) ),
file('theBenchmark.p',mp5_20) ).
cnf(mp6_1_21,axiom,
( A != B
| ~ greater(A,B) ),
file('theBenchmark.p',mp6_1_21) ).
cnf(mp6_2_22,axiom,
( ~ greater(B,A)
| ~ greater(A,B) ),
file('theBenchmark.p',mp6_2_22) ).
cnf(mp9_23,axiom,
( class(A,sk2(B,A),B)
| ~ organization(A,B) ),
file('theBenchmark.p',mp9_23) ).
cnf(mp10_24,axiom,
( D = E
| ~ class(A,E,C)
| ~ class(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('theBenchmark.p',mp10_24) ).
cnf(a12_FOL_25,hypothesis,
( greater(I,H)
| ~ greater(G,F)
| ~ inertia(C,I,D)
| ~ inertia(A,H,B)
| ~ complexity(C,G,D)
| ~ complexity(A,F,B)
| ~ class(C,E,D)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
file('theBenchmark.p',a12_FOL_25) ).
cnf(t2_FOL_26,hypothesis,
( greater(E,D)
| ~ greater(C,B)
| ~ inertia(A,E,C)
| ~ inertia(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('theBenchmark.p',t2_FOL_26) ).
cnf(t12_FOL_27,negated_conjecture,
organization(sk3,sk6),
file('theBenchmark.p',t12_FOL_27) ).
cnf(t12_FOL_28,negated_conjecture,
organization(sk3,sk7),
file('theBenchmark.p',t12_FOL_28) ).
cnf(t12_FOL_29,negated_conjecture,
reorganization_free(sk3,sk6,sk7),
file('theBenchmark.p',t12_FOL_29) ).
cnf(t12_FOL_30,negated_conjecture,
complexity(sk3,sk4,sk6),
file('theBenchmark.p',t12_FOL_30) ).
cnf(t12_FOL_31,negated_conjecture,
complexity(sk3,sk5,sk7),
file('theBenchmark.p',t12_FOL_31) ).
cnf(t12_FOL_32,negated_conjecture,
greater(sk7,sk6),
file('theBenchmark.p',t12_FOL_32) ).
cnf(t12_FOL_33,negated_conjecture,
greater(sk4,sk5),
file('theBenchmark.p',t12_FOL_33) ).
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.4.0.
% 0.00/0.04 This is a CNF_UNS_RFO_SEQ_HRN 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.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 19 16:13:50 UTC 2026
% 0.10/0.36 % CPUTime :
% 234.94/235.22 % SZS status Unsatisfiable for theBenchmark
% 234.94/235.22 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------