%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT026-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 : n003.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:38 AM UTC 2026
% Result : Unsatisfiable 30.56s 30.86s
% Output : Proof 30.56s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(mp1_high_growth_rates_28,axiom,
( selection_favors(C,B,D)
| ~ greater(growth_rate(C,D),growth_rate(B,D))
| ~ subpopulations(B,C,A,D)
| ~ environment(A) ),
file('theBenchmark.p',mp1_high_growth_rates_28) ).
cnf(mp2_favour_members_29,axiom,
( selection_favors(B,D,C)
| cardinality_at_time(D,C) != zero
| ~ greater(cardinality_at_time(B,C),zero)
| ~ subpopulation(D,A,C)
| ~ subpopulation(B,A,C)
| ~ environment(A) ),
file('theBenchmark.p',mp2_favour_members_29) ).
cnf(mp_non_empty_fm_and_ep_30,axiom,
( subpopulations(first_movers,efficient_producers,A,B)
| ~ greater(cardinality_at_time(efficient_producers,B),zero)
| ~ greater(cardinality_at_time(first_movers,B),zero)
| ~ in_environment(A,B)
| ~ environment(A) ),
file('theBenchmark.p',mp_non_empty_fm_and_ep_30) ).
cnf(mp_first_movers_exist_31,axiom,
( greater_or_equal(cardinality_at_time(first_movers,B),zero)
| ~ in_environment(A,B)
| ~ environment(A) ),
file('theBenchmark.p',mp_first_movers_exist_31) ).
cnf(mp_subpopulations_32,axiom,
( subpopulation(first_movers,A,B)
| ~ in_environment(A,B)
| ~ environment(A) ),
file('theBenchmark.p',mp_subpopulations_32) ).
cnf(mp_subpopulations_33,axiom,
( subpopulation(efficient_producers,A,B)
| ~ in_environment(A,B)
| ~ environment(A) ),
file('theBenchmark.p',mp_subpopulations_33) ).
cnf(mp_critical_point_after_EP_34,axiom,
( greater_or_equal(critical_point(A),appear(efficient_producers,A))
| ~ environment(A) ),
file('theBenchmark.p',mp_critical_point_after_EP_34) ).
cnf(mp_greater_transitivity_35,axiom,
( greater(A,C)
| ~ greater(B,C)
| ~ greater(A,B) ),
file('theBenchmark.p',mp_greater_transitivity_35) ).
cnf(mp_greater_or_equal_36,axiom,
( A = B
| greater(A,B)
| ~ greater_or_equal(A,B) ),
file('theBenchmark.p',mp_greater_or_equal_36) ).
cnf(mp_greater_or_equal_37,axiom,
( greater_or_equal(A,B)
| ~ greater(A,B) ),
file('theBenchmark.p',mp_greater_or_equal_37) ).
cnf(mp_greater_or_equal_38,axiom,
( greater_or_equal(A,B)
| A != B ),
file('theBenchmark.p',mp_greater_or_equal_38) ).
cnf(d1_39,hypothesis,
( ~ greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))
| B != critical_point(A)
| ~ environment(A) ),
file('theBenchmark.p',d1_39) ).
cnf(d1_40,hypothesis,
( greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C))
| ~ greater(C,B)
| ~ subpopulations(first_movers,efficient_producers,A,C)
| B != critical_point(A)
| ~ environment(A) ),
file('theBenchmark.p',d1_40) ).
cnf(t6_41,hypothesis,
( greater(cardinality_at_time(efficient_producers,B),zero)
| ~ greater_or_equal(B,appear(efficient_producers,A))
| ~ in_environment(A,B)
| ~ environment(A) ),
file('theBenchmark.p',t6_41) ).
cnf(prove_l8_42,negated_conjecture,
environment(sk1),
file('theBenchmark.p',prove_l8_42) ).
cnf(prove_l8_43,negated_conjecture,
in_environment(sk1,sk2),
file('theBenchmark.p',prove_l8_43) ).
cnf(prove_l8_44,negated_conjecture,
greater(sk2,critical_point(sk1)),
file('theBenchmark.p',prove_l8_44) ).
cnf(prove_l8_45,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk2),
file('theBenchmark.p',prove_l8_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,
( growth_rate(Eq_x_0,Eq_x_1) = growth_rate(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,
( cardinality_at_time(Eq_x_0,Eq_x_1) = cardinality_at_time(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,
( critical_point(Eq_x_0) = critical_point(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( appear(Eq_x_0,Eq_x_1) = appear(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_8,axiom,
( environment(Eq_y_0)
| ~ environment(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_9,axiom,
( subpopulations(Eq_y_0,Eq_y_1,Eq_y_2,Eq_y_3)
| ~ subpopulations(Eq_x_0,Eq_x_1,Eq_x_2,Eq_x_3)
| Eq_x_3 != Eq_y_3
| 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,
( 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,
( selection_favors(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ selection_favors(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_12,axiom,
( subpopulation(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ subpopulation(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_13,axiom,
( in_environment(Eq_y_0,Eq_y_1)
| ~ in_environment(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_14,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(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT026-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.09/0.38 % Computer : n003.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sat Sep 19 16:13:58 UTC 2026
% 0.09/0.38 % CPUTime :
% 30.56/30.86 % SZS status Unsatisfiable for theBenchmark
% 30.56/30.86 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------