%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT024-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 01:26:04 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 77 ( 12 unt; 44 nHn; 77 RR)
% Number of literals : 288 ( 48 equ; 139 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a6_30,hypothesis,
( ~ constant(resources(X1,X2))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(number_of_organizations(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a6_30) ).
cnf(a3_28,hypothesis,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(resources(X1,X2))
| greater(equilibrium(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_28) ).
cnf(mp_equilibrium_26,axiom,
( ~ greater(equilibrium(X1),X2)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_equilibrium_26) ).
cnf(l7_32,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(growth_rate(first_movers,X2),zero)
| growth_rate(first_movers,X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_32) ).
cnf(mp_time_point_occur_24,axiom,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_point_occur_24) ).
cnf(mp_positive_number_of_organizations_25,axiom,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_positive_number_of_organizations_25) ).
cnf(l7_34,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(first_movers,X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_34) ).
cnf(l7_31,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),zero)
| greater(growth_rate(first_movers,X2),zero)
| growth_rate(first_movers,X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_31) ).
cnf(prove_l6_41,negated_conjecture,
greater_or_equal(sk2,equilibrium(sk1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_41) ).
cnf(prove_l6_39,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_39) ).
cnf(l7_33,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),zero)
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(first_movers,X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_33) ).
cnf(l7_36,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(growth_rate(first_movers,X2),zero)
| growth_rate(efficient_producers,X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_36) ).
cnf(l7_38,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(efficient_producers,X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_38) ).
cnf(prove_l6_43,negated_conjecture,
( ~ greater(zero,growth_rate(efficient_producers,sk2))
| ~ greater(growth_rate(first_movers,sk2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_43) ).
cnf(prove_l6_40,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_40) ).
cnf(l7_37,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),zero)
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(efficient_producers,X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_37) ).
cnf(prove_l6_44,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,sk2))
| ~ greater(growth_rate(efficient_producers,sk2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_44) ).
cnf(prove_l6_42,negated_conjecture,
( growth_rate(efficient_producers,sk2) != zero
| growth_rate(first_movers,sk2) != zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l6_42) ).
cnf(c_0_18,hypothesis,
( ~ constant(resources(X1,X2))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(number_of_organizations(X1,X2)) ),
inference(fof_simplification,[status(thm)],[a6_30]) ).
cnf(c_0_19,hypothesis,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(resources(X1,X2))
| greater(equilibrium(X1),X2) ),
inference(fof_simplification,[status(thm)],[a3_28]) ).
cnf(c_0_20,plain,
( ~ greater(equilibrium(X1),X2)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ environment(X1) ),
inference(fof_simplification,[status(thm)],[mp_equilibrium_26]) ).
cnf(c_0_21,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(growth_rate(first_movers,X2),zero)
| growth_rate(first_movers,X2) = zero ),
inference(fof_simplification,[status(thm)],[l7_32]) ).
cnf(c_0_22,hypothesis,
( ~ constant(resources(X1,X2))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(number_of_organizations(X1,X2)) ),
c_0_18 ).
cnf(c_0_23,hypothesis,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(resources(X1,X2))
| greater(equilibrium(X1),X2) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_time_point_occur_24]) ).
cnf(c_0_25,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(number_of_organizations(X1,X2),zero) ),
inference(fof_simplification,[status(thm)],[mp_positive_number_of_organizations_25]) ).
cnf(c_0_26,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(first_movers,X2) = zero ),
inference(fof_simplification,[status(thm)],[l7_34]) ).
cnf(c_0_27,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),zero)
| greater(growth_rate(first_movers,X2),zero)
| growth_rate(first_movers,X2) = zero ),
inference(fof_simplification,[status(thm)],[l7_31]) ).
cnf(c_0_28,plain,
( ~ greater(equilibrium(X1),X2)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ environment(X1) ),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
greater_or_equal(sk2,equilibrium(sk1)),
prove_l6_41 ).
cnf(c_0_30,negated_conjecture,
environment(sk1),
prove_l6_39 ).
cnf(c_0_31,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(growth_rate(first_movers,X2),zero)
| growth_rate(first_movers,X2) = zero ),
c_0_21 ).
cnf(c_0_32,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero)
| greater(equilibrium(X1),X2)
| constant(number_of_organizations(X1,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_33,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
c_0_24 ).
cnf(c_0_34,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(number_of_organizations(X1,X2),zero) ),
c_0_25 ).
cnf(c_0_35,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(first_movers,X2) = zero ),
c_0_26 ).
cnf(c_0_36,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),zero)
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(first_movers,X2) = zero ),
inference(fof_simplification,[status(thm)],[l7_33]) ).
cnf(c_0_37,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(growth_rate(first_movers,X2),zero)
| growth_rate(efficient_producers,X2) = zero ),
inference(fof_simplification,[status(thm)],[l7_36]) ).
cnf(c_0_38,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(efficient_producers,X2) = zero ),
inference(fof_simplification,[status(thm)],[l7_38]) ).
cnf(c_0_39,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),zero)
| greater(growth_rate(first_movers,X2),zero)
| growth_rate(first_movers,X2) = zero ),
c_0_27 ).
cnf(c_0_40,negated_conjecture,
( ~ greater(zero,growth_rate(efficient_producers,sk2))
| ~ greater(growth_rate(first_movers,sk2),zero) ),
inference(fof_simplification,[status(thm)],[prove_l6_43]) ).
cnf(c_0_41,negated_conjecture,
~ greater(equilibrium(sk1),sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_42,hypothesis,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(equilibrium(X2),X1)
| greater(growth_rate(first_movers,X1),zero)
| greater(zero,growth_rate(first_movers,X1))
| growth_rate(first_movers,X1) = zero ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_43,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
prove_l6_40 ).
cnf(c_0_44,hypothesis,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(equilibrium(X2),X1)
| greater(zero,growth_rate(efficient_producers,X1))
| greater(zero,growth_rate(first_movers,X1))
| growth_rate(first_movers,X1) = zero ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_45,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),zero)
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(first_movers,X2) = zero ),
c_0_36 ).
cnf(c_0_46,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),zero)
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(efficient_producers,X2) = zero ),
inference(fof_simplification,[status(thm)],[l7_37]) ).
cnf(c_0_47,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(growth_rate(first_movers,X2),zero)
| growth_rate(efficient_producers,X2) = zero ),
c_0_37 ).
cnf(c_0_48,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(first_movers,X2))
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(efficient_producers,X2) = zero ),
c_0_38 ).
cnf(c_0_49,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,sk2))
| ~ greater(growth_rate(efficient_producers,sk2),zero) ),
inference(fof_simplification,[status(thm)],[prove_l6_44]) ).
cnf(c_0_50,hypothesis,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(equilibrium(X2),X1)
| greater(growth_rate(efficient_producers,X1),zero)
| greater(growth_rate(first_movers,X1),zero)
| growth_rate(first_movers,X1) = zero ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_51,negated_conjecture,
( ~ greater(zero,growth_rate(efficient_producers,sk2))
| ~ greater(growth_rate(first_movers,sk2),zero) ),
c_0_40 ).
cnf(c_0_52,negated_conjecture,
( greater(zero,growth_rate(first_movers,sk2))
| greater(growth_rate(first_movers,sk2),zero)
| growth_rate(first_movers,sk2) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_30])]) ).
cnf(c_0_53,negated_conjecture,
( greater(zero,growth_rate(first_movers,sk2))
| greater(zero,growth_rate(efficient_producers,sk2))
| growth_rate(first_movers,sk2) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_44]),c_0_43]),c_0_30])]) ).
cnf(c_0_54,hypothesis,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(equilibrium(X2),X1)
| greater(growth_rate(efficient_producers,X1),zero)
| greater(zero,growth_rate(efficient_producers,X1))
| growth_rate(first_movers,X1) = zero ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_55,hypothesis,
( ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(growth_rate(efficient_producers,X2),zero)
| greater(zero,growth_rate(efficient_producers,X2))
| growth_rate(efficient_producers,X2) = zero ),
c_0_46 ).
cnf(c_0_56,hypothesis,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(equilibrium(X2),X1)
| greater(growth_rate(first_movers,X1),zero)
| greater(zero,growth_rate(first_movers,X1))
| growth_rate(efficient_producers,X1) = zero ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_57,hypothesis,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(equilibrium(X2),X1)
| greater(zero,growth_rate(efficient_producers,X1))
| greater(zero,growth_rate(first_movers,X1))
| growth_rate(efficient_producers,X1) = zero ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_58,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,sk2))
| ~ greater(growth_rate(efficient_producers,sk2),zero) ),
c_0_49 ).
cnf(c_0_59,negated_conjecture,
( greater(growth_rate(first_movers,sk2),zero)
| greater(growth_rate(efficient_producers,sk2),zero)
| growth_rate(first_movers,sk2) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_50]),c_0_43]),c_0_30])]) ).
cnf(c_0_60,negated_conjecture,
( greater(zero,growth_rate(first_movers,sk2))
| growth_rate(first_movers,sk2) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,sk2))
| greater(growth_rate(efficient_producers,sk2),zero)
| growth_rate(first_movers,sk2) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_54]),c_0_43]),c_0_30])]) ).
cnf(c_0_62,hypothesis,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(equilibrium(X2),X1)
| greater(growth_rate(efficient_producers,X1),zero)
| greater(zero,growth_rate(efficient_producers,X1))
| growth_rate(efficient_producers,X1) = zero ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_63,negated_conjecture,
( greater(zero,growth_rate(first_movers,sk2))
| greater(growth_rate(first_movers,sk2),zero)
| growth_rate(efficient_producers,sk2) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_56]),c_0_43]),c_0_30])]) ).
cnf(c_0_64,negated_conjecture,
( greater(zero,growth_rate(first_movers,sk2))
| greater(zero,growth_rate(efficient_producers,sk2))
| growth_rate(efficient_producers,sk2) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_57]),c_0_43]),c_0_30])]) ).
cnf(c_0_65,negated_conjecture,
( growth_rate(efficient_producers,sk2) != zero
| growth_rate(first_movers,sk2) != zero ),
inference(fof_simplification,[status(thm)],[prove_l6_42]) ).
cnf(c_0_66,negated_conjecture,
( greater(growth_rate(first_movers,sk2),zero)
| growth_rate(first_movers,sk2) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,sk2))
| growth_rate(first_movers,sk2) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_61]),c_0_60]) ).
cnf(c_0_68,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,sk2))
| greater(growth_rate(efficient_producers,sk2),zero)
| growth_rate(efficient_producers,sk2) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_62]),c_0_43]),c_0_30])]) ).
cnf(c_0_69,negated_conjecture,
( greater(zero,growth_rate(first_movers,sk2))
| growth_rate(efficient_producers,sk2) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_63]),c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( growth_rate(efficient_producers,sk2) != zero
| growth_rate(first_movers,sk2) != zero ),
c_0_65 ).
cnf(c_0_71,negated_conjecture,
growth_rate(first_movers,sk2) = zero,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_66]),c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,sk2))
| growth_rate(efficient_producers,sk2) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_68]),c_0_69]) ).
cnf(c_0_73,negated_conjecture,
growth_rate(efficient_producers,sk2) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_74,negated_conjecture,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(sr,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_75,negated_conjecture,
greater(zero,zero),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_71]),c_0_73]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_71]),c_0_74]),c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT024-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 01:24:50 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % new_bool_1 with pid 252506 completed with status 0
% 0.15/0.44 % Result found by new_bool_1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % SubtermCWHack with pid 252509 completed with status 0
% 0.15/0.44 % Result found by SubtermCWHack
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % Preprocessing time : 0.002 s
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Unsatisfiable
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 21
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 21
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 21
% 0.15/0.44 % Processed clauses : 49
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 0
% 0.15/0.44 % ...remaining for further processing : 48
% 0.15/0.44 % Other redundant clauses eliminated : 0
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 7
% 0.15/0.44 % Backward-rewritten : 7
% 0.15/0.44 % Generated clauses : 26
% 0.15/0.44 % ...of the previous two non-redundant : 30
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 22
% 0.15/0.44 % Paramodulations : 25
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 0
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 28
% 0.15/0.44 % ...of those cached : 23
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 33
% 0.15/0.44 % Positive orientable unit clauses : 6
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 2
% 0.15/0.44 % Non-unit-clauses : 25
% 0.15/0.44 % Current number of unprocessed clauses: 2
% 0.15/0.44 % ...number of literals in the above : 5
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 15
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 482
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 45
% 0.15/0.44 % Non-unit clause-clause subsumptions : 29
% 0.15/0.44 % Unit Clause-clause subsumption calls : 44
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 1
% 0.15/0.44 % BW rewrite match successes : 1
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 2159
% 0.15/0.44 % Search garbage collected termcells : 72
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.006 s
% 0.15/0.44 % System time : 0.003 s
% 0.15/0.44 % Total time : 0.008 s
% 0.15/0.44 % Maximum resident set size: 3648 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.008 s
% 0.15/0.44 % System time : 0.007 s
% 0.15/0.44 % Total time : 0.015 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------