%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT032-2 : 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:32 PM UTC 2026
% Result : Unsatisfiable 1.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 6 unt; 0 nHn; 21 RR)
% Number of literals : 51 ( 0 equ; 35 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 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 : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(l1_3,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_3) ).
cnf(prove_t1_6,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk2,sk3(X1))
| ~ in_environment(sk2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_6) ).
cnf(prove_t1_5,negated_conjecture,
stable(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_5) ).
cnf(prove_t1_4,negated_conjecture,
environment(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_4) ).
cnf(mp1_high_growth_rates_1,axiom,
( selection_favors(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater(growth_rate(X3,X4),growth_rate(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp1_high_growth_rates_1) ).
cnf(prove_t1_8,negated_conjecture,
( ~ in_environment(sk2,X1)
| ~ selection_favors(efficient_producers,first_movers,sk3(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_8) ).
cnf(prove_t1_7,negated_conjecture,
( greater_or_equal(sk3(X1),X1)
| ~ in_environment(sk2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_7) ).
cnf(l1_2,hypothesis,
( in_environment(X1,sk1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_2) ).
cnf(c_0_8,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk1(X1)) ),
l1_3 ).
cnf(c_0_9,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk2,sk3(X1))
| ~ in_environment(sk2,X1) ),
prove_t1_6 ).
cnf(c_0_10,negated_conjecture,
stable(sk2),
prove_t1_5 ).
cnf(c_0_11,negated_conjecture,
environment(sk2),
prove_t1_4 ).
cnf(c_0_12,axiom,
( selection_favors(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater(growth_rate(X3,X4),growth_rate(X2,X4)) ),
mp1_high_growth_rates_1 ).
cnf(c_0_13,negated_conjecture,
( greater(growth_rate(efficient_producers,sk3(X1)),growth_rate(first_movers,sk3(X1)))
| ~ greater_or_equal(sk3(X1),sk1(sk2))
| ~ in_environment(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
( ~ in_environment(sk2,X1)
| ~ selection_favors(efficient_producers,first_movers,sk3(X1)) ),
prove_t1_8 ).
cnf(c_0_15,negated_conjecture,
( ~ greater_or_equal(sk3(X1),sk1(sk2))
| ~ in_environment(sk2,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,sk3(X1))
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( ~ greater_or_equal(sk3(X1),sk1(sk2))
| ~ in_environment(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_9]),c_0_11])]) ).
cnf(c_0_17,negated_conjecture,
( greater_or_equal(sk3(X1),X1)
| ~ in_environment(sk2,X1) ),
prove_t1_7 ).
cnf(c_0_18,negated_conjecture,
~ in_environment(sk2,sk1(sk2)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,hypothesis,
( in_environment(X1,sk1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
l1_2 ).
cnf(c_0_20,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT032-2 : 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.14/0.33 % Computer : n019.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 23:28:14 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.24/1.71 % Version : CSE_E---1.7
% 1.24/1.71 % Problem : theBenchmark.p
% 1.24/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.71 % SZS output start CNFRefutation
% See solution above
% 1.24/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------