%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT045-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 : n010.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:43 AM UTC 2026
% Result : Unsatisfiable 0.12s 15.64s
% Output : Proof 0.12s
% 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(assumption_6_30,axiom,
( greater(position(A,B),position(A,C))
| ~ greater(external_ties(A,B),external_ties(A,C))
| ~ organization(A) ),
file('theBenchmark.p',assumption_6_30) ).
cnf(assumption_6_31,axiom,
( position(A,B) = position(A,C)
| external_ties(A,B) != external_ties(A,C)
| ~ organization(A) ),
file('theBenchmark.p',assumption_6_31) ).
cnf(assumption_8_32,axiom,
( greater(external_ties(A,B),external_ties(A,C))
| ~ greater(age(A,B),age(A,C))
| ~ organization(A) ),
file('theBenchmark.p',assumption_8_32) ).
cnf(lemma_4_33,negated_conjecture,
organization(sk1),
file('theBenchmark.p',lemma_4_33) ).
cnf(lemma_4_34,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('theBenchmark.p',lemma_4_34) ).
cnf(lemma_4_35,negated_conjecture,
~ greater(position(sk1,sk3),position(sk1,sk2)),
file('theBenchmark.p',lemma_4_35) ).
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,
( external_ties(Eq_x_0,Eq_x_1) = external_ties(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,
( position(Eq_x_0,Eq_x_1) = position(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,
( 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_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,
( 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 : MGT045-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.12/15.61 % Computer : n010.cluster.edu
% 0.12/15.61 % Model : x86_64 x86_64
% 0.12/15.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/15.61 % Memory : 8046.5625MB
% 0.12/15.61 % OS : Linux 6.8.0-71-generic
% 0.12/15.61 % CPULimit : 300
% 0.12/15.61 % WCLimit : 300
% 0.12/15.61 % DateTime : Sat Sep 19 16:16:30 UTC 2026
% 0.12/15.61 % CPUTime :
% 0.12/15.64 % SZS status Unsatisfiable for theBenchmark
% 0.12/15.64 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------