%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT058-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/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:46 AM UTC 2026
% Result : Unsatisfiable 183.34s 193.70s
% Output : Proof 184.26s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(definition_smaller_or_equal_1,axiom,
( A = B
| smaller(A,B)
| ~ smaller_or_equal(A,B) ),
file('MGT001-0.ax',definition_smaller_or_equal_1) ).
cnf(definition_smaller_or_equal_2,axiom,
( smaller_or_equal(A,B)
| ~ smaller(A,B) ),
file('MGT001-0.ax',definition_smaller_or_equal_2) ).
cnf(definition_smaller_or_equal_3,axiom,
( smaller_or_equal(A,B)
| A != B ),
file('MGT001-0.ax',definition_smaller_or_equal_3) ).
cnf(definition_greater_or_equal_4,axiom,
( A = B
| greater(A,B)
| ~ greater_or_equal(A,B) ),
file('MGT001-0.ax',definition_greater_or_equal_4) ).
cnf(definition_greater_or_equal_5,axiom,
( greater_or_equal(A,B)
| ~ greater(A,B) ),
file('MGT001-0.ax',definition_greater_or_equal_5) ).
cnf(definition_greater_or_equal_6,axiom,
( greater_or_equal(A,B)
| A != B ),
file('MGT001-0.ax',definition_greater_or_equal_6) ).
cnf(definition_smaller_7,axiom,
( greater(B,A)
| ~ smaller(A,B) ),
file('MGT001-0.ax',definition_smaller_7) ).
cnf(definition_smaller_8,axiom,
( smaller(B,A)
| ~ greater(A,B) ),
file('MGT001-0.ax',definition_smaller_8) ).
cnf(meaning_postulate_greater_strict_9,axiom,
( ~ greater(B,A)
| ~ greater(A,B) ),
file('MGT001-0.ax',meaning_postulate_greater_strict_9) ).
cnf(meaning_postulate_greater_transitive_10,axiom,
( greater(A,C)
| ~ greater(B,C)
| ~ greater(A,B) ),
file('MGT001-0.ax',meaning_postulate_greater_transitive_10) ).
cnf(meaning_postulate_greater_comparable_11,axiom,
( greater(A,B)
| A = B
| smaller(A,B) ),
file('MGT001-0.ax',meaning_postulate_greater_comparable_11) ).
cnf(definition_3_30,axiom,
( positional_advantage(A,B)
| ~ smaller_or_equal(age(A,B),sigma)
| ~ fragile_position(A) ),
file('theBenchmark.p',definition_3_30) ).
cnf(definition_3_31,axiom,
( ~ positional_advantage(A,B)
| ~ greater(age(A,B),sigma)
| ~ fragile_position(A) ),
file('theBenchmark.p',definition_3_31) ).
cnf(definition_3_32,axiom,
( fragile_position(A)
| greater(age(A,sk1(A)),sigma)
| smaller_or_equal(age(A,sk1(A)),sigma) ),
file('theBenchmark.p',definition_3_32) ).
cnf(definition_3_33,axiom,
( fragile_position(A)
| positional_advantage(A,sk1(A))
| smaller_or_equal(age(A,sk1(A)),sigma) ),
file('theBenchmark.p',definition_3_33) ).
cnf(definition_3_34,axiom,
( fragile_position(A)
| greater(age(A,sk1(A)),sigma)
| ~ positional_advantage(A,sk1(A)) ),
file('theBenchmark.p',definition_3_34) ).
cnf(definition_3_35,axiom,
( fragile_position(A)
| positional_advantage(A,sk1(A))
| ~ positional_advantage(A,sk1(A)) ),
file('theBenchmark.p',definition_3_35) ).
cnf(definition_4_36,axiom,
( ~ positional_advantage(A,B)
| ~ smaller_or_equal(age(A,B),tau)
| ~ robust_position(A) ),
file('theBenchmark.p',definition_4_36) ).
cnf(definition_4_37,axiom,
( positional_advantage(A,B)
| ~ greater(age(A,B),tau)
| ~ robust_position(A) ),
file('theBenchmark.p',definition_4_37) ).
cnf(definition_4_38,axiom,
( robust_position(A)
| greater(age(A,sk2(A)),tau)
| smaller_or_equal(age(A,sk2(A)),tau) ),
file('theBenchmark.p',definition_4_38) ).
cnf(definition_4_39,axiom,
( robust_position(A)
| ~ positional_advantage(A,sk2(A))
| smaller_or_equal(age(A,sk2(A)),tau) ),
file('theBenchmark.p',definition_4_39) ).
cnf(definition_4_40,axiom,
( robust_position(A)
| greater(age(A,sk2(A)),tau)
| positional_advantage(A,sk2(A)) ),
file('theBenchmark.p',definition_4_40) ).
cnf(definition_4_41,axiom,
( robust_position(A)
| ~ positional_advantage(A,sk2(A))
| positional_advantage(A,sk2(A)) ),
file('theBenchmark.p',definition_4_41) ).
cnf(lemma_10_42,negated_conjecture,
organization(sk3),
file('theBenchmark.p',lemma_10_42) ).
cnf(lemma_10_43,negated_conjecture,
age(sk3,sk4) = zero,
file('theBenchmark.p',lemma_10_43) ).
cnf(lemma_10_44,negated_conjecture,
greater_or_equal(sigma,zero),
file('theBenchmark.p',lemma_10_44) ).
cnf(lemma_10_45,negated_conjecture,
greater_or_equal(tau,zero),
file('theBenchmark.p',lemma_10_45) ).
cnf(lemma_10_46,negated_conjecture,
fragile_position(sk3),
file('theBenchmark.p',lemma_10_46) ).
cnf(lemma_10_47,negated_conjecture,
robust_position(sk3),
file('theBenchmark.p',lemma_10_47) ).
cnf(definition_3_35_true,plain,
$true,
inference(clause_is_true,[status(thm)],[definition_3_35]) ).
cnf(definition_4_41_true,plain,
$true,
inference(clause_is_true,[status(thm)],[definition_4_41]) ).
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,
( age(Eq_x_0,Eq_x_1) = age(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,
( sk1(Eq_x_0) = sk1(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( sk2(Eq_x_0) = sk2(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( smaller_or_equal(Eq_y_0,Eq_y_1)
| ~ smaller_or_equal(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_8,axiom,
( smaller(Eq_y_0,Eq_y_1)
| ~ smaller(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,
( greater_or_equal(Eq_y_0,Eq_y_1)
| ~ greater_or_equal(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_10,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_11,axiom,
( fragile_position(Eq_y_0)
| ~ fragile_position(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_12,axiom,
( positional_advantage(Eq_y_0,Eq_y_1)
| ~ positional_advantage(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_13,axiom,
( robust_position(Eq_y_0)
| ~ robust_position(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_14,axiom,
( organization(Eq_y_0)
| ~ organization(Eq_x_0)
| 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 : MGT058-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/10.38 % Computer : n018.cluster.edu
% 0.08/10.38 % Model : x86_64 x86_64
% 0.08/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.38 % Memory : 8046.5625MB
% 0.08/10.38 % OS : Linux 6.8.0-71-generic
% 0.08/10.38 % CPULimit : 300
% 0.08/10.38 % WCLimit : 300
% 0.08/10.38 % DateTime : Sat Sep 19 16:19:37 UTC 2026
% 0.08/10.38 % CPUTime :
% 183.34/193.70 % SZS status Unsatisfiable for theBenchmark
% 183.34/193.70 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------