%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT028-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:47:10 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 42 ( 12 unt; 12 nHn; 42 RR)
% Number of literals : 134 ( 0 equ; 86 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_first_movers_negative_growth_2,axiom,
( greater_or_equal(sk1(X2,X1),X2)
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_2) ).
cnf(l11_7,hypothesis,
( in_environment(X1,sk3(X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l11_7) ).
cnf(mp_first_movers_negative_growth_1,axiom,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_1) ).
cnf(l11_9,hypothesis,
( greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk3(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l11_9) ).
cnf(prove_l10_11,negated_conjecture,
stable(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_11) ).
cnf(prove_l10_10,negated_conjecture,
environment(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_10) ).
cnf(mp_first_movers_negative_growth_5,axiom,
( greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_5) ).
cnf(prove_l10_13,negated_conjecture,
( greater_or_equal(sk5(X1),X1)
| ~ greater(X1,appear(efficient_producers,sk4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_13) ).
cnf(prove_l10_12,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk4,sk5(X1))
| ~ greater(X1,appear(efficient_producers,sk4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_12) ).
cnf(prove_l10_14,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| ~ greater(zero,growth_rate(first_movers,sk5(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_14) ).
cnf(mp_first_movers_negative_growth_4,axiom,
( greater_or_equal(sk1(X2,X1),X2)
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_4) ).
cnf(mp_first_movers_negative_growth_6,axiom,
( greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_6) ).
cnf(mp_first_movers_negative_growth_3,axiom,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_3) ).
cnf(c_0_13,axiom,
( greater_or_equal(sk1(X2,X1),X2)
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
mp_first_movers_negative_growth_2 ).
cnf(c_0_14,hypothesis,
( in_environment(X1,sk3(X1))
| ~ environment(X1)
| ~ stable(X1) ),
l11_7 ).
cnf(c_0_15,axiom,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
mp_first_movers_negative_growth_1 ).
cnf(c_0_16,hypothesis,
( greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk3(X1)) ),
l11_9 ).
cnf(c_0_17,hypothesis,
( greater_or_equal(sk1(sk3(X1),X1),sk3(X1))
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
( greater(sk2(X1),appear(efficient_producers,X1))
| subpopulations(first_movers,efficient_producers,X1,sk1(sk3(X1),X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_19,hypothesis,
( greater(zero,growth_rate(first_movers,sk1(sk3(X1),X1)))
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
stable(sk4),
prove_l10_11 ).
cnf(c_0_21,negated_conjecture,
environment(sk4),
prove_l10_10 ).
cnf(c_0_22,axiom,
( greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1))) ),
mp_first_movers_negative_growth_5 ).
cnf(c_0_23,negated_conjecture,
( greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4)))
| greater(sk2(sk4),appear(efficient_producers,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
( greater(sk2(sk4),appear(efficient_producers,sk4))
| ~ in_environment(sk4,sk3(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]),c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
( greater_or_equal(sk5(X1),X1)
| ~ greater(X1,appear(efficient_producers,sk4)) ),
prove_l10_13 ).
cnf(c_0_26,hypothesis,
greater(sk2(sk4),appear(efficient_producers,sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_14]),c_0_20]),c_0_21])]) ).
cnf(c_0_27,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk4,sk5(X1))
| ~ greater(X1,appear(efficient_producers,sk4)) ),
prove_l10_12 ).
cnf(c_0_28,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| ~ greater(zero,growth_rate(first_movers,sk5(X1))) ),
prove_l10_14 ).
cnf(c_0_29,axiom,
( greater_or_equal(sk1(X2,X1),X2)
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
mp_first_movers_negative_growth_4 ).
cnf(c_0_30,negated_conjecture,
greater_or_equal(sk5(sk2(sk4)),sk2(sk4)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk4,sk5(sk2(sk4))),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ greater(zero,growth_rate(first_movers,sk5(sk2(sk4)))),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_33,axiom,
( greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
mp_first_movers_negative_growth_6 ).
cnf(c_0_34,negated_conjecture,
( greater_or_equal(sk1(X1,sk4),X1)
| ~ in_environment(sk4,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_20]),c_0_21])]),c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,sk1(X1,sk4)))
| ~ in_environment(sk4,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_30]),c_0_31]),c_0_20]),c_0_21])]),c_0_32]) ).
cnf(c_0_36,axiom,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
mp_first_movers_negative_growth_3 ).
cnf(c_0_37,hypothesis,
greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_14]),c_0_20]),c_0_21])]) ).
cnf(c_0_38,hypothesis,
~ greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_14]),c_0_20]),c_0_21])]) ).
cnf(c_0_39,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk4,sk1(X1,sk4))
| ~ in_environment(sk4,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_31]),c_0_20]),c_0_21])]),c_0_32]) ).
cnf(c_0_40,hypothesis,
~ subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_37]),c_0_20]),c_0_21])]),c_0_38]) ).
cnf(c_0_41,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_14]),c_0_20]),c_0_21])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT028-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n019.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 23:27:59 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.368s
%------------------------------------------------------------------------------