%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT014-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 : n012.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 42.05s 42.34s
% Output : Proof 42.05s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(mp6_1_18,axiom,
( A != B
| ~ greater(A,B) ),
file('theBenchmark.p',mp6_1_18) ).
cnf(mp6_2_19,axiom,
( ~ greater(B,A)
| ~ greater(A,B) ),
file('theBenchmark.p',mp6_2_19) ).
cnf(mp15_20,axiom,
( time(B)
| ~ organization(A,B) ),
file('theBenchmark.p',mp15_20) ).
cnf(mp16_21,axiom,
( greater(B,A)
| A = B
| greater(A,B)
| ~ time(B)
| ~ time(A) ),
file('theBenchmark.p',mp16_21) ).
cnf(mp17_22,axiom,
( reorganization_free(A,C,B)
| ~ reorganization_free(A,B,C) ),
file('theBenchmark.p',mp17_22) ).
cnf(mp19_23,axiom,
( D = E
| B != C
| ~ size(A,E,C)
| ~ size(A,D,B)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('theBenchmark.p',mp19_23) ).
cnf(t11_FOL_24,hypothesis,
( ~ greater(D,E)
| ~ greater(C,B)
| ~ size(A,E,C)
| ~ size(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('theBenchmark.p',t11_FOL_24) ).
cnf(t12_FOL_25,hypothesis,
( ~ greater(D,E)
| ~ greater(C,B)
| ~ complexity(A,E,C)
| ~ complexity(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('theBenchmark.p',t12_FOL_25) ).
cnf(t14_FOL_26,negated_conjecture,
organization(sk1,sk6),
file('theBenchmark.p',t14_FOL_26) ).
cnf(t14_FOL_27,negated_conjecture,
organization(sk1,sk7),
file('theBenchmark.p',t14_FOL_27) ).
cnf(t14_FOL_28,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('theBenchmark.p',t14_FOL_28) ).
cnf(t14_FOL_29,negated_conjecture,
complexity(sk1,sk2,sk6),
file('theBenchmark.p',t14_FOL_29) ).
cnf(t14_FOL_30,negated_conjecture,
complexity(sk1,sk3,sk7),
file('theBenchmark.p',t14_FOL_30) ).
cnf(t14_FOL_31,negated_conjecture,
size(sk1,sk4,sk6),
file('theBenchmark.p',t14_FOL_31) ).
cnf(t14_FOL_32,negated_conjecture,
size(sk1,sk5,sk7),
file('theBenchmark.p',t14_FOL_32) ).
cnf(t14_FOL_33,negated_conjecture,
greater(sk5,sk4),
file('theBenchmark.p',t14_FOL_33) ).
cnf(t14_FOL_34,negated_conjecture,
greater(sk2,sk3),
file('theBenchmark.p',t14_FOL_34) ).
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,
( 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_5,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_6,axiom,
( time(Eq_y_0)
| ~ time(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_7,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_8,axiom,
( size(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ size(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_9,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.01 % Problem : MGT014-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.01 This is a CNF_UNS_EPR_SEQ_NHN problem
% 0.00/0.02 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Sat Sep 19 16:10:37 UTC 2026
% 0.02/0.29 % CPUTime :
% 42.05/42.34 % SZS status Unsatisfiable for theBenchmark
% 42.05/42.34 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------