%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT024+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 9 unt; 0 def)
% Number of atoms : 302 ( 46 equ)
% Maximal formula atoms : 48 ( 4 avg)
% Number of connectives : 357 ( 117 ~; 178 |; 43 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a6,hypothesis,
! [X1,X2] :
( ( in_environment(X1,X2)
& environment(X1) )
=> ( ( constant(resources(X1,X2))
=> constant(number_of_organizations(X1,X2)) )
& ( decreases(resources(X1,X2))
=> ~ decreases(number_of_organizations(X1,X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a6) ).
fof(a3,hypothesis,
! [X1,X2] :
( ( greater(number_of_organizations(X1,X2),zero)
& in_environment(X1,X2)
& environment(X1) )
=> ( ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) )
& ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3) ).
fof(mp_equilibrium,axiom,
! [X1,X2] :
( ( greater_or_equal(X2,equilibrium(X1))
& environment(X1) )
=> ~ greater(equilibrium(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_equilibrium) ).
fof(prove_l6,conjecture,
! [X1,X2] :
( ( greater_or_equal(X2,equilibrium(X1))
& subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ( ( greater(zero,growth_rate(first_movers,X2))
& greater(growth_rate(efficient_producers,X2),zero) )
| ( greater(zero,growth_rate(efficient_producers,X2))
& greater(growth_rate(first_movers,X2),zero) )
| ( growth_rate(efficient_producers,X2) = zero
& growth_rate(first_movers,X2) = zero ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_l6) ).
fof(l7,hypothesis,
! [X1,X2] :
( ( 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(efficient_producers,X2),zero) )
| ( greater(zero,growth_rate(efficient_producers,X2))
& greater(growth_rate(first_movers,X2),zero) )
| ( growth_rate(efficient_producers,X2) = zero
& growth_rate(first_movers,X2) = zero ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7) ).
fof(mp_time_point_occur,axiom,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_point_occur) ).
fof(mp_positive_number_of_organizations,axiom,
! [X1,X2] :
( ( subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_positive_number_of_organizations) ).
fof(c_0_7,hypothesis,
! [X1,X2] :
( ( in_environment(X1,X2)
& environment(X1) )
=> ( ( constant(resources(X1,X2))
=> constant(number_of_organizations(X1,X2)) )
& ( decreases(resources(X1,X2))
=> ~ decreases(number_of_organizations(X1,X2)) ) ) ),
inference(fof_simplification,[status(thm)],[a6]) ).
fof(c_0_8,hypothesis,
! [X1,X2] :
( ( greater(number_of_organizations(X1,X2),zero)
& in_environment(X1,X2)
& environment(X1) )
=> ( ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) )
& ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) ) ) ),
inference(fof_simplification,[status(thm)],[a3]) ).
fof(c_0_9,plain,
! [X1,X2] :
( ( greater_or_equal(X2,equilibrium(X1))
& environment(X1) )
=> ~ greater(equilibrium(X1),X2) ),
inference(fof_simplification,[status(thm)],[mp_equilibrium]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2] :
( ( greater_or_equal(X2,equilibrium(X1))
& subpopulations(first_movers,efficient_producers,X1,X2)
& environment(X1) )
=> ( ( greater(zero,growth_rate(first_movers,X2))
& greater(growth_rate(efficient_producers,X2),zero) )
| ( greater(zero,growth_rate(efficient_producers,X2))
& greater(growth_rate(first_movers,X2),zero) )
| ( growth_rate(efficient_producers,X2) = zero
& growth_rate(first_movers,X2) = zero ) ) ),
inference(assume_negation,[status(cth)],[prove_l6]) ).
fof(c_0_11,hypothesis,
! [X15,X16] :
( ( ~ in_environment(X15,X16)
| ~ environment(X15)
| constant(number_of_organizations(X15,X16))
| ~ constant(resources(X15,X16)) )
& ( ~ in_environment(X15,X16)
| ~ environment(X15)
| ~ decreases(number_of_organizations(X15,X16))
| ~ decreases(resources(X15,X16)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_12,hypothesis,
! [X9,X10] :
( ( ~ greater(number_of_organizations(X9,X10),zero)
| ~ in_environment(X9,X10)
| ~ environment(X9)
| constant(resources(X9,X10))
| greater(equilibrium(X9),X10) )
& ( ~ greater(number_of_organizations(X9,X10),zero)
| ~ in_environment(X9,X10)
| ~ environment(X9)
| decreases(resources(X9,X10))
| ~ greater(equilibrium(X9),X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_13,plain,
! [X7,X8] :
( ~ greater(equilibrium(X7),X8)
| ~ greater_or_equal(X8,equilibrium(X7))
| ~ environment(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_14,negated_conjecture,
( ( ~ greater(zero,growth_rate(first_movers,esk2_0))
| ~ greater(growth_rate(efficient_producers,esk2_0),zero) )
& ( ~ greater(zero,growth_rate(efficient_producers,esk2_0))
| ~ greater(growth_rate(first_movers,esk2_0),zero) )
& ( growth_rate(efficient_producers,esk2_0) != zero
| growth_rate(first_movers,esk2_0) != zero )
& greater_or_equal(esk2_0,equilibrium(esk1_0))
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& environment(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_15,hypothesis,
! [X11,X12] :
( ( ~ constant(number_of_organizations(X11,X12))
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ environment(X11)
| growth_rate(efficient_producers,X12) = zero
| greater(zero,growth_rate(efficient_producers,X12))
| greater(zero,growth_rate(first_movers,X12)) )
& ( ~ constant(number_of_organizations(X11,X12))
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ environment(X11)
| growth_rate(efficient_producers,X12) = zero
| greater(zero,growth_rate(efficient_producers,X12))
| greater(growth_rate(efficient_producers,X12),zero) )
& ( ~ constant(number_of_organizations(X11,X12))
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ environment(X11)
| growth_rate(efficient_producers,X12) = zero
| greater(growth_rate(first_movers,X12),zero)
| greater(zero,growth_rate(first_movers,X12)) )
& ( ~ constant(number_of_organizations(X11,X12))
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ environment(X11)
| growth_rate(efficient_producers,X12) = zero
| greater(growth_rate(first_movers,X12),zero)
| greater(growth_rate(efficient_producers,X12),zero) )
& ( ~ constant(number_of_organizations(X11,X12))
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ environment(X11)
| growth_rate(first_movers,X12) = zero
| greater(zero,growth_rate(efficient_producers,X12))
| greater(zero,growth_rate(first_movers,X12)) )
& ( ~ constant(number_of_organizations(X11,X12))
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ environment(X11)
| growth_rate(first_movers,X12) = zero
| greater(zero,growth_rate(efficient_producers,X12))
| greater(growth_rate(efficient_producers,X12),zero) )
& ( ~ constant(number_of_organizations(X11,X12))
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ environment(X11)
| growth_rate(first_movers,X12) = zero
| greater(growth_rate(first_movers,X12),zero)
| greater(zero,growth_rate(first_movers,X12)) )
& ( ~ constant(number_of_organizations(X11,X12))
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| ~ environment(X11)
| growth_rate(first_movers,X12) = zero
| greater(growth_rate(first_movers,X12),zero)
| greater(growth_rate(efficient_producers,X12),zero) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l7])])])]) ).
cnf(c_0_16,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ constant(resources(X1,X2))
| constant(number_of_organizations(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(resources(X1,X2))
| greater(equilibrium(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X13,X14] :
( in_environment(X13,X14)
| ~ subpopulations(first_movers,efficient_producers,X13,X14)
| ~ environment(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occur])])]) ).
fof(c_0_19,plain,
! [X5,X6] :
( greater(number_of_organizations(X5,X6),zero)
| ~ subpopulations(first_movers,efficient_producers,X5,X6)
| ~ environment(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_positive_number_of_organizations])])]) ).
cnf(c_0_20,plain,
( ~ greater(equilibrium(X1),X2)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
greater_or_equal(esk2_0,equilibrium(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(first_movers,X1) = zero
| greater(growth_rate(first_movers,X1),zero)
| greater(zero,growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,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_16,c_0_17]) ).
cnf(c_0_25,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater(number_of_organizations(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(first_movers,X1) = zero
| greater(zero,growth_rate(efficient_producers,X1))
| greater(zero,growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(first_movers,X1) = zero
| greater(growth_rate(first_movers,X1),zero)
| greater(growth_rate(efficient_producers,X1),zero) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,negated_conjecture,
~ greater(equilibrium(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_30,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_23,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,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_27,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_33,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(first_movers,X1) = zero
| greater(zero,growth_rate(efficient_producers,X1))
| greater(growth_rate(efficient_producers,X1),zero) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_34,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(efficient_producers,X1) = zero
| greater(growth_rate(first_movers,X1),zero)
| greater(zero,growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(efficient_producers,X1) = zero
| greater(zero,growth_rate(efficient_producers,X1))
| greater(zero,growth_rate(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,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_28,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_37,negated_conjecture,
( ~ greater(zero,growth_rate(efficient_producers,esk2_0))
| ~ greater(growth_rate(first_movers,esk2_0),zero) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_38,negated_conjecture,
( greater(zero,growth_rate(first_movers,esk2_0))
| greater(growth_rate(first_movers,esk2_0),zero)
| growth_rate(first_movers,esk2_0) = zero ),
inference(cn,[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_22])]) ).
cnf(c_0_39,negated_conjecture,
( greater(zero,growth_rate(first_movers,esk2_0))
| greater(zero,growth_rate(efficient_producers,esk2_0))
| growth_rate(first_movers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_32]),c_0_31]),c_0_22])]) ).
cnf(c_0_40,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_33,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_41,hypothesis,
( ~ constant(number_of_organizations(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2)
| growth_rate(efficient_producers,X1) = zero
| greater(zero,growth_rate(efficient_producers,X1))
| greater(growth_rate(efficient_producers,X1),zero) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
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(efficient_producers,X1) = zero ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_43,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_35,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_44,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,esk2_0))
| ~ greater(growth_rate(efficient_producers,esk2_0),zero) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,negated_conjecture,
( greater(growth_rate(first_movers,esk2_0),zero)
| greater(growth_rate(efficient_producers,esk2_0),zero)
| growth_rate(first_movers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_36]),c_0_31]),c_0_22])]) ).
cnf(c_0_46,negated_conjecture,
( greater(zero,growth_rate(first_movers,esk2_0))
| growth_rate(first_movers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| greater(growth_rate(efficient_producers,esk2_0),zero)
| growth_rate(first_movers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_40]),c_0_31]),c_0_22])]) ).
cnf(c_0_48,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_41,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_49,negated_conjecture,
( greater(zero,growth_rate(first_movers,esk2_0))
| greater(growth_rate(first_movers,esk2_0),zero)
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_42]),c_0_31]),c_0_22])]) ).
cnf(c_0_50,negated_conjecture,
( greater(zero,growth_rate(first_movers,esk2_0))
| greater(zero,growth_rate(efficient_producers,esk2_0))
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_43]),c_0_31]),c_0_22])]) ).
cnf(c_0_51,negated_conjecture,
( greater(growth_rate(first_movers,esk2_0),zero)
| growth_rate(first_movers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| growth_rate(first_movers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_47]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| greater(growth_rate(efficient_producers,esk2_0),zero)
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_48]),c_0_31]),c_0_22])]) ).
cnf(c_0_54,negated_conjecture,
( greater(zero,growth_rate(first_movers,esk2_0))
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_49]),c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) != zero
| growth_rate(first_movers,esk2_0) != zero ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_56,negated_conjecture,
growth_rate(first_movers,esk2_0) = zero,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_51]),c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| growth_rate(efficient_producers,esk2_0) = zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_53]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
growth_rate(efficient_producers,esk2_0) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_59,negated_conjecture,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(sr,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,negated_conjecture,
greater(zero,zero),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_56]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_56]),c_0_59]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT024+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n026.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:24:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.42 % Version: 3.5.1
% 0.15/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 % Starting sh5l with 300s (1) cores
% 0.15/0.42 % sh5l with pid 1062672 completed with status 0
% 0.15/0.42 % Result found by sh5l
% 0.15/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 % Starting sh5l with 300s (1) cores
% 0.15/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.42 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.42 % SubtermCWHack with pid 1062675 completed with status 0
% 0.15/0.42 % Result found by SubtermCWHack
% 0.15/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 % Starting sh5l with 300s (1) cores
% 0.15/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.42 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.42 % Preprocessing time : 0.001 s
% 0.15/0.42
% 0.15/0.42 % Proof found!
% 0.15/0.42 % SZS status Theorem
% 0.15/0.42 % SZS output start CNFRefutation
% See solution above
% 0.15/0.42 % Parsed axioms : 7
% 0.15/0.42 % Removed by relevancy pruning/SinE : 0
% 0.15/0.42 % Initial clauses : 21
% 0.15/0.42 % Removed in clause preprocessing : 0
% 0.15/0.42 % Initial clauses in saturation : 21
% 0.15/0.42 % Processed clauses : 49
% 0.15/0.42 % ...of these trivial : 0
% 0.15/0.42 % ...subsumed : 0
% 0.15/0.42 % ...remaining for further processing : 48
% 0.15/0.42 % Other redundant clauses eliminated : 0
% 0.15/0.42 % Clauses deleted for lack of memory : 0
% 0.15/0.42 % Backward-subsumed : 7
% 0.15/0.42 % Backward-rewritten : 7
% 0.15/0.42 % Generated clauses : 26
% 0.15/0.42 % ...of the previous two non-redundant : 30
% 0.15/0.42 % ...aggressively subsumed : 0
% 0.15/0.42 % Contextual simplify-reflections : 22
% 0.15/0.42 % Paramodulations : 25
% 0.15/0.42 % Factorizations : 0
% 0.15/0.42 % NegExts : 0
% 0.15/0.42 % Equation resolutions : 0
% 0.15/0.42 % Disequality decompositions : 0
% 0.15/0.42 % Total rewrite steps : 28
% 0.15/0.42 % ...of those cached : 23
% 0.15/0.42 % Propositional unsat checks : 0
% 0.15/0.42 % Propositional check models : 0
% 0.15/0.42 % Propositional check unsatisfiable : 0
% 0.15/0.42 % Propositional clauses : 0
% 0.15/0.42 % Propositional clauses after purity: 0
% 0.15/0.42 % Propositional unsat core size : 0
% 0.15/0.42 % Propositional preprocessing time : 0.000
% 0.15/0.42 % Propositional encoding time : 0.000
% 0.15/0.42 % Propositional solver time : 0.000
% 0.15/0.42 % Success case prop preproc time : 0.000
% 0.15/0.42 % Success case prop encoding time : 0.000
% 0.15/0.42 % Success case prop solver time : 0.000
% 0.15/0.42 % Current number of processed clauses : 33
% 0.15/0.42 % Positive orientable unit clauses : 6
% 0.15/0.42 % Positive unorientable unit clauses: 0
% 0.15/0.42 % Negative unit clauses : 2
% 0.15/0.42 % Non-unit-clauses : 25
% 0.15/0.42 % Current number of unprocessed clauses: 2
% 0.15/0.42 % ...number of literals in the above : 5
% 0.15/0.42 % Current number of archived formulas : 0
% 0.15/0.42 % Current number of archived clauses : 15
% 0.15/0.42 % Clause-clause subsumption calls (NU) : 482
% 0.15/0.42 % Rec. Clause-clause subsumption calls : 45
% 0.15/0.42 % Non-unit clause-clause subsumptions : 29
% 0.15/0.42 % Unit Clause-clause subsumption calls : 44
% 0.15/0.42 % Rewrite failures with RHS unbound : 0
% 0.15/0.42 % BW rewrite match attempts : 1
% 0.15/0.42 % BW rewrite match successes : 1
% 0.15/0.42 % Condensation attempts : 0
% 0.15/0.42 % Condensation successes : 0
% 0.15/0.42 % Termbank termtop insertions : 2786
% 0.15/0.42 % Search garbage collected termcells : 306
% 0.15/0.42
% 0.15/0.42 % -------------------------------------------------
% 0.15/0.42 % User time : 0.007 s
% 0.15/0.42 % System time : 0.001 s
% 0.15/0.42 % Total time : 0.008 s
% 0.15/0.42 % Maximum resident set size: 3640 pages
% 0.15/0.42
% 0.15/0.42 % -------------------------------------------------
% 0.15/0.42 % User time : 0.010 s
% 0.15/0.42 % System time : 0.004 s
% 0.15/0.42 % Total time : 0.014 s
% 0.15/0.42 % Maximum resident set size: 4608 pages
% 0.15/0.42 % E exiting
%------------------------------------------------------------------------------