%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT060-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 : n011.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:47 AM UTC 2026
% Result : Unsatisfiable 150.36s 150.61s
% Output : Proof 150.99s
% 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_17_32,axiom,
( hazard_of_mortality(A,B) = very_low
| ~ has_immunity(A,B)
| ~ organization(A) ),
file('theBenchmark.p',assumption_17_32) ).
cnf(assumption_17_33,axiom,
( hazard_of_mortality(A,B) = low
| ~ positional_advantage(A,B)
| ~ is_aligned(A,B)
| has_immunity(A,B)
| ~ organization(A) ),
file('theBenchmark.p',assumption_17_33) ).
cnf(assumption_17_34,axiom,
( hazard_of_mortality(A,B) = mod1
| ~ positional_advantage(A,B)
| is_aligned(A,B)
| has_immunity(A,B)
| ~ organization(A) ),
file('theBenchmark.p',assumption_17_34) ).
cnf(assumption_17_35,axiom,
( hazard_of_mortality(A,B) = mod2
| positional_advantage(A,B)
| ~ is_aligned(A,B)
| has_immunity(A,B)
| ~ organization(A) ),
file('theBenchmark.p',assumption_17_35) ).
cnf(assumption_17_36,axiom,
( hazard_of_mortality(A,B) = high
| positional_advantage(A,B)
| is_aligned(A,B)
| has_immunity(A,B)
| ~ organization(A) ),
file('theBenchmark.p',assumption_17_36) ).
cnf(assumption_18a_37,axiom,
greater(high,mod1),
file('theBenchmark.p',assumption_18a_37) ).
cnf(assumption_18b_38,axiom,
greater(mod1,low),
file('theBenchmark.p',assumption_18b_38) ).
cnf(assumption_18c_39,axiom,
greater(low,very_low),
file('theBenchmark.p',assumption_18c_39) ).
cnf(assumption_18d_40,axiom,
greater(high,mod2),
file('theBenchmark.p',assumption_18d_40) ).
cnf(assumption_18e_41,axiom,
greater(mod2,low),
file('theBenchmark.p',assumption_18e_41) ).
cnf(assumption_3_42,negated_conjecture,
organization(sk1),
file('theBenchmark.p',assumption_3_42) ).
cnf(assumption_3_43,negated_conjecture,
has_immunity(sk1,sk2),
file('theBenchmark.p',assumption_3_43) ).
cnf(assumption_3_44,negated_conjecture,
~ has_immunity(sk1,sk3),
file('theBenchmark.p',assumption_3_44) ).
cnf(assumption_3_45,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
file('theBenchmark.p',assumption_3_45) ).
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,
( hazard_of_mortality(Eq_x_0,Eq_x_1) = hazard_of_mortality(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,
( 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_6,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_7,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_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,
( organization(Eq_y_0)
| ~ organization(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_10,axiom,
( has_immunity(Eq_y_0,Eq_y_1)
| ~ has_immunity(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,
( is_aligned(Eq_y_0,Eq_y_1)
| ~ is_aligned(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| 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(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT060-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.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 19 16:18:40 UTC 2026
% 0.11/0.38 % CPUTime :
% 150.36/150.61 % SZS status Unsatisfiable for theBenchmark
% 150.36/150.61 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------