%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT036-3 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n010.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:48:15 PM UTC 2026
% Result : Unsatisfiable 0.24s 1.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 11 unt; 0 nHn; 23 RR)
% Number of literals : 57 ( 0 equ; 36 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_symmetry_of_subpopulations_1,axiom,
( subpopulations(X3,X2,X1,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations_1) ).
cnf(d2_2,hypothesis,
( outcompetes(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ greater(zero,growth_rate(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_2) ).
cnf(d2_3,hypothesis,
( greater_or_equal(growth_rate(X3,X4),zero)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_3) ).
cnf(d2_4,hypothesis,
( greater(zero,growth_rate(X2,X4))
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_4) ).
cnf(prove_t5_star_9,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ outcompetes(first_movers,efficient_producers,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_star_9) ).
cnf(a13_star_6,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_6) ).
cnf(a13_star_7,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_7) ).
cnf(a13_star_8,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_8) ).
cnf(a13_star_5,hypothesis,
environment(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_5) ).
cnf(i_0_9,axiom,
( subpopulations(X3,X2,X1,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4) ),
mp_symmetry_of_subpopulations_1,
[final] ).
cnf(i_0_10,hypothesis,
( outcompetes(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ greater(zero,growth_rate(X2,X4)) ),
d2_2,
[final] ).
cnf(i_0_11,hypothesis,
( greater_or_equal(growth_rate(X3,X4),zero)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
d2_3,
[final] ).
cnf(i_0_12,hypothesis,
( greater(zero,growth_rate(X2,X4))
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
d2_4,
[final] ).
cnf(i_0_13,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ outcompetes(first_movers,efficient_producers,X2) ),
prove_t5_star_9,
[final] ).
cnf(i_0_14,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
a13_star_6,
[final] ).
cnf(i_0_15,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
a13_star_7,
[final] ).
cnf(i_0_16,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
a13_star_8,
[final] ).
cnf(i_0_17,hypothesis,
environment(sk1),
a13_star_5,
[final] ).
cnf(i_0_18,plain,
subpopulations(efficient_producers,first_movers,sk1,sk2),
inference(scs_inference,[],[i_0_14,i_0_17,i_0_9]) ).
cnf(i_0_19,plain,
( ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| subpopulations(X3,X2,X1,X4) ),
inference(rename_variables,[],[i_0_9]) ).
cnf(i_0_20,plain,
outcompetes(first_movers,efficient_producers,sk2),
inference(scs_inference,[],[i_0_14,i_0_17,i_0_15,i_0_16,i_0_9,i_0_10]) ).
cnf(i_0_21,plain,
( ~ greater_or_equal(growth_rate(X1,X2),zero)
| ~ greater(zero,growth_rate(X3,X2))
| ~ subpopulations(X3,X1,X4,X2)
| outcompetes(X1,X3,X2)
| ~ environment(X4) ),
inference(rename_variables,[],[i_0_10]) ).
cnf(i_0_22,plain,
$false,
inference(scs_inference,[],[i_0_14,i_0_17,i_0_15,i_0_16,i_0_9,i_0_10,i_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT036-3 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n010.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 23:28:06 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 0.24/1.61 % Version : CSE_E---1.7
% 0.24/1.61 % Problem : theBenchmark.p
% 0.24/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.24/1.61 % SZS output start CNFRefutation
% See solution above
% 0.24/1.63 % Total time : 1.271s
%------------------------------------------------------------------------------