%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT032-2 : 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:39 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 38 ( 25 unt; 0 nHn; 38 RR)
% Number of literals : 63 ( 0 equ; 27 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp1_high_growth_rates_1,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_1) ).
cnf(l1_2,hypothesis,
( in_environment(A,sk1(A))
| ~ stable(A)
| ~ environment(A) ),
file('theBenchmark.p',l1_2) ).
cnf(l1_3,hypothesis,
( greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))
| ~ greater_or_equal(B,sk1(A))
| ~ subpopulations(first_movers,efficient_producers,A,B)
| ~ stable(A)
| ~ environment(A) ),
file('theBenchmark.p',l1_3) ).
cnf(prove_t1_4,negated_conjecture,
environment(sk2),
file('theBenchmark.p',prove_t1_4) ).
cnf(prove_t1_5,negated_conjecture,
stable(sk2),
file('theBenchmark.p',prove_t1_5) ).
cnf(prove_t1_6,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk2,sk3(A))
| ~ in_environment(sk2,A) ),
file('theBenchmark.p',prove_t1_6) ).
cnf(prove_t1_7,negated_conjecture,
( greater_or_equal(sk3(A),A)
| ~ in_environment(sk2,A) ),
file('theBenchmark.p',prove_t1_7) ).
cnf(prove_t1_8,negated_conjecture,
( ~ selection_favors(efficient_producers,first_movers,sk3(A))
| ~ in_environment(sk2,A) ),
file('theBenchmark.p',prove_t1_8) ).
cnf(t1,plain,
( ~ selection_favors(efficient_producers,first_movers,sk3(sk1(sk2)))
| ~ in_environment(sk2,sk1(sk2)) ),
inference(start,[status(thm),parent(0:0)],[prove_t1_8]) ).
cnf(t2,plain,
( ~ stable(sk2)
| ~ environment(sk2)
| in_environment(sk2,sk1(sk2)) ),
inference(extension,[status(thm),parent(t1:1)],[l1_2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
environment(sk2),
inference(extension,[status(thm),parent(t2:2)],[prove_t1_4]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
stable(sk2),
inference(extension,[status(thm),parent(t2:3)],[prove_t1_5]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(l1,lemma,
in_environment(sk2,sk1(sk2)),
inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).
cnf(t8,plain,
( ~ subpopulations(first_movers,efficient_producers,sk2,sk3(sk1(sk2)))
| ~ greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2))))
| ~ environment(sk2)
| selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))) ),
inference(extension,[status(thm),parent(t1:2)],[mp1_high_growth_rates_1]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t1:2]) ).
cnf(t10,plain,
environment(sk2),
inference(extension,[status(thm),parent(t8:2)],[prove_t1_4]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
( ~ stable(sk2)
| ~ subpopulations(first_movers,efficient_producers,sk2,sk3(sk1(sk2)))
| ~ greater_or_equal(sk3(sk1(sk2)),sk1(sk2))
| ~ environment(sk2)
| greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))) ),
inference(extension,[status(thm),parent(t8:3)],[l1_3]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).
cnf(t14,plain,
environment(sk2),
inference(extension,[status(thm),parent(t12:2)],[prove_t1_4]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
( ~ in_environment(sk2,sk1(sk2))
| greater_or_equal(sk3(sk1(sk2)),sk1(sk2)) ),
inference(extension,[status(thm),parent(t12:3)],[prove_t1_7]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t12:3]) ).
cnf(t18,plain,
in_environment(sk2,sk1(sk2)),
inference(lemma_extension,[status(thm),parent(t16:2)],[l1:1]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
( ~ in_environment(sk2,sk1(sk2))
| subpopulations(first_movers,efficient_producers,sk2,sk3(sk1(sk2))) ),
inference(extension,[status(thm),parent(t12:4)],[prove_t1_6]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t12:4]) ).
cnf(t22,plain,
in_environment(sk2,sk1(sk2)),
inference(lemma_extension,[status(thm),parent(t20:2)],[l1:1]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
stable(sk2),
inference(extension,[status(thm),parent(t12:5)],[prove_t1_5]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t12:5]) ).
cnf(t26,plain,
( ~ in_environment(sk2,sk1(sk2))
| subpopulations(first_movers,efficient_producers,sk2,sk3(sk1(sk2))) ),
inference(extension,[status(thm),parent(t8:4)],[prove_t1_6]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t8:4]) ).
cnf(t28,plain,
in_environment(sk2,sk1(sk2)),
inference(lemma_extension,[status(thm),parent(t26:2)],[l1:1]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t26:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT032-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN 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.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 19 16:13:28 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------