%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT037+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:27:58 PM UTC 2026
% Result : Theorem 0.24s 0.79s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 83 ( 10 unt; 0 def)
% Number of atoms : 345 ( 42 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 449 ( 187 ~; 175 |; 57 &)
% ( 0 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-2 aty)
% Number of variables : 151 ( 0 sgn 79 !; 3 ?)
% 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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',a3) ).
fof(mp_constant_not_decrease,axiom,
! [X4] :
( constant(X4)
=> ~ decreases(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_constant_not_decrease) ).
fof(mp_non_decreasing,axiom,
! [X1,X2] :
( ( ~ decreases(number_of_organizations(X1,X2))
& in_environment(X1,X2)
& environment(X1) )
=> ? [X4] :
( ~ greater(zero,growth_rate(X4,X2))
& greater(cardinality_at_time(X4,X2),zero)
& subpopulation(X4,X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_decreasing) ).
fof(prove_t6,conjecture,
! [X1,X2] :
( ( greater_or_equal(X2,appear(efficient_producers,X1))
& in_environment(X1,X2)
& environment(X1) )
=> greater(cardinality_at_time(efficient_producers,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t6) ).
fof(a9,hypothesis,
! [X1,X4,X2] :
( ( greater(cardinality_at_time(X4,X2),zero)
& subpopulation(X4,X1,X2)
& environment(X1) )
=> ( X4 = first_movers
| X4 = efficient_producers ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a9) ).
fof(a12,hypothesis,
! [X1,X6,X7,X2] :
( ( greater(resilience(X7),resilience(X6))
& ~ greater(zero,growth_rate(X6,X2))
& in_environment(X1,X2)
& environment(X1) )
=> ~ greater(zero,growth_rate(X7,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a12) ).
fof(mp_efficient_producers_exist,axiom,
! [X1,X2] :
( ( in_environment(X1,X2)
& environment(X1) )
=> ( greater(cardinality_at_time(efficient_producers,X2),zero)
| cardinality_at_time(efficient_producers,X2) = zero ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_efficient_producers_exist) ).
fof(mp_previous_negative_growth,axiom,
! [X1,X2] :
( ( cardinality_at_time(efficient_producers,X2) = zero
& greater_or_equal(X2,appear(efficient_producers,X1))
& environment(X1) )
=> ? [X3] :
( greater(zero,growth_rate(efficient_producers,X3))
& greater(X2,X3)
& in_environment(X1,X3)
& greater(X3,appear(efficient_producers,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_previous_negative_growth) ).
fof(a2,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2) ).
fof(a1,hypothesis,
! [X1,X2] :
( ( greater_or_equal(X2,appear(an_organisation,X1))
& in_environment(X1,X2)
& environment(X1) )
=> greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
fof(mp_environment_inequality,axiom,
! [X1,X2] :
( ( in_environment(X1,X2)
& environment(X1) )
=> ( greater(appear(an_organisation,X1),X2)
| greater_or_equal(X2,appear(an_organisation,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_environment_inequality) ).
fof(mp_empty_not_decreasing,axiom,
! [X5,X2] :
( cardinality_at_time(X5,X2) = zero
=> ~ greater(zero,growth_rate(X5,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_empty_not_decreasing) ).
fof(mp_no_members,axiom,
! [X1,X2,X4] :
( ( subpopulation(X4,X1,X2)
& number_of_organizations(X1,X2) = zero
& in_environment(X1,X2)
& environment(X1) )
=> cardinality_at_time(X4,X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_no_members) ).
fof(mp_subpopulations,axiom,
! [X1,X2] :
( ( in_environment(X1,X2)
& environment(X1) )
=> ( subpopulation(efficient_producers,X1,X2)
& subpopulation(first_movers,X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_subpopulations) ).
fof(mp_start_of_organizations,axiom,
! [X1,X2] :
( ( greater(appear(an_organisation,X1),X2)
& in_environment(X1,X2)
& environment(X1) )
=> number_of_organizations(X1,X2) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_start_of_organizations) ).
fof(c_0_16,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_17,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_18,plain,
! [X4] :
( constant(X4)
=> ~ decreases(X4) ),
inference(fof_simplification,[status(thm)],[mp_constant_not_decrease]) ).
fof(c_0_19,hypothesis,
! [X12,X13] :
( ( ~ in_environment(X12,X13)
| ~ environment(X12)
| constant(number_of_organizations(X12,X13))
| ~ constant(resources(X12,X13)) )
& ( ~ in_environment(X12,X13)
| ~ environment(X12)
| ~ decreases(number_of_organizations(X12,X13))
| ~ decreases(resources(X12,X13)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_20,hypothesis,
! [X8,X9] :
( ( ~ greater(number_of_organizations(X8,X9),zero)
| ~ in_environment(X8,X9)
| ~ environment(X8)
| constant(resources(X8,X9))
| greater(equilibrium(X8),X9) )
& ( ~ greater(number_of_organizations(X8,X9),zero)
| ~ in_environment(X8,X9)
| ~ environment(X8)
| decreases(resources(X8,X9))
| ~ greater(equilibrium(X8),X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
fof(c_0_21,plain,
! [X1,X2] :
( ( ~ decreases(number_of_organizations(X1,X2))
& in_environment(X1,X2)
& environment(X1) )
=> ? [X4] :
( ~ greater(zero,growth_rate(X4,X2))
& greater(cardinality_at_time(X4,X2),zero)
& subpopulation(X4,X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mp_non_decreasing]) ).
fof(c_0_22,negated_conjecture,
~ ! [X1,X2] :
( ( greater_or_equal(X2,appear(efficient_producers,X1))
& in_environment(X1,X2)
& environment(X1) )
=> greater(cardinality_at_time(efficient_producers,X2),zero) ),
inference(assume_negation,[status(cth)],[prove_t6]) ).
fof(c_0_23,plain,
! [X23] :
( ~ decreases(X23)
| ~ constant(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
cnf(c_0_24,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ constant(resources(X1,X2))
| constant(number_of_organizations(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,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_20]) ).
cnf(c_0_26,hypothesis,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ decreases(number_of_organizations(X1,X2))
| ~ decreases(resources(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ greater(equilibrium(X1),X2)
| decreases(resources(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_28,hypothesis,
! [X18,X19,X20] :
( X19 = first_movers
| X19 = efficient_producers
| ~ greater(cardinality_at_time(X19,X20),zero)
| ~ subpopulation(X19,X18,X20)
| ~ environment(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a9])])]) ).
fof(c_0_29,plain,
! [X24,X25] :
( ( decreases(number_of_organizations(X24,X25))
| ~ in_environment(X24,X25)
| ~ environment(X24)
| ~ greater(zero,growth_rate(esk3_2(X24,X25),X25)) )
& ( decreases(number_of_organizations(X24,X25))
| ~ in_environment(X24,X25)
| ~ environment(X24)
| greater(cardinality_at_time(esk3_2(X24,X25),X25),zero) )
& ( decreases(number_of_organizations(X24,X25))
| ~ in_environment(X24,X25)
| ~ environment(X24)
| subpopulation(esk3_2(X24,X25),X24,X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])]) ).
fof(c_0_30,hypothesis,
! [X1,X6,X7,X2] :
( ( greater(resilience(X7),resilience(X6))
& ~ greater(zero,growth_rate(X6,X2))
& in_environment(X1,X2)
& environment(X1) )
=> ~ greater(zero,growth_rate(X7,X2)) ),
inference(fof_simplification,[status(thm)],[a12]) ).
fof(c_0_31,plain,
! [X41,X42] :
( greater(cardinality_at_time(efficient_producers,X42),zero)
| cardinality_at_time(efficient_producers,X42) = zero
| ~ in_environment(X41,X42)
| ~ environment(X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_efficient_producers_exist])])]) ).
fof(c_0_32,negated_conjecture,
( ~ greater(cardinality_at_time(efficient_producers,esk2_0),zero)
& greater_or_equal(esk2_0,appear(efficient_producers,esk1_0))
& in_environment(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_22])])])]) ).
cnf(c_0_33,plain,
( ~ decreases(X1)
| ~ constant(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,hypothesis,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| greater(equilibrium(X1),X2)
| constant(number_of_organizations(X1,X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,hypothesis,
( ~ environment(X1)
| ~ greater(equilibrium(X1),X2)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ decreases(number_of_organizations(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,hypothesis,
( ~ greater(cardinality_at_time(X2,X3),zero)
| ~ subpopulation(X2,X1,X3)
| ~ environment(X1)
| X2 = first_movers
| X2 = efficient_producers ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| decreases(number_of_organizations(X1,X2))
| subpopulation(esk3_2(X1,X2),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| decreases(number_of_organizations(X1,X2))
| greater(cardinality_at_time(esk3_2(X1,X2),X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_39,hypothesis,
! [X14,X15,X16,X17] :
( ~ greater(zero,growth_rate(X16,X17))
| ~ greater(resilience(X16),resilience(X15))
| greater(zero,growth_rate(X15,X17))
| ~ in_environment(X14,X17)
| ~ environment(X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
fof(c_0_40,plain,
! [X30,X31] :
( ( cardinality_at_time(efficient_producers,X31) != zero
| ~ greater_or_equal(X31,appear(efficient_producers,X30))
| ~ environment(X30)
| greater(zero,growth_rate(efficient_producers,esk4_2(X30,X31))) )
& ( cardinality_at_time(efficient_producers,X31) != zero
| ~ greater_or_equal(X31,appear(efficient_producers,X30))
| ~ environment(X30)
| greater(X31,esk4_2(X30,X31)) )
& ( cardinality_at_time(efficient_producers,X31) != zero
| ~ greater_or_equal(X31,appear(efficient_producers,X30))
| ~ environment(X30)
| in_environment(X30,esk4_2(X30,X31)) )
& ( cardinality_at_time(efficient_producers,X31) != zero
| ~ greater_or_equal(X31,appear(efficient_producers,X30))
| ~ environment(X30)
| greater(esk4_2(X30,X31),appear(efficient_producers,X30)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_previous_negative_growth])])])])]) ).
cnf(c_0_41,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(cardinality_at_time(efficient_producers,X2),zero)
| cardinality_at_time(efficient_producers,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,negated_conjecture,
in_environment(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,negated_conjecture,
~ greater(cardinality_at_time(efficient_producers,esk2_0),zero),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,hypothesis,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ decreases(number_of_organizations(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_46,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| decreases(number_of_organizations(X1,X2))
| esk3_2(X1,X2) = first_movers
| esk3_2(X1,X2) = efficient_producers ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_47,hypothesis,
( ~ greater(zero,growth_rate(X4,X2))
| ~ greater(resilience(X4),resilience(X3))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
( cardinality_at_time(efficient_producers,X2) != zero
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ environment(X1)
| greater(zero,growth_rate(efficient_producers,esk4_2(X1,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_49,plain,
( cardinality_at_time(efficient_producers,X2) != zero
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ environment(X1)
| in_environment(X1,esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_50,negated_conjecture,
greater_or_equal(esk2_0,appear(efficient_producers,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_51,negated_conjecture,
cardinality_at_time(efficient_producers,esk2_0) = zero,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_52,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ greater(zero,growth_rate(esk3_2(X1,X2),X2))
| decreases(number_of_organizations(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_53,hypothesis,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| esk3_2(X1,X2) = efficient_producers
| esk3_2(X1,X2) = first_movers ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,hypothesis,
( ~ environment(X2)
| ~ environment(X4)
| ~ greater_or_equal(X3,appear(efficient_producers,X2))
| ~ greater(resilience(efficient_producers),resilience(X1))
| ~ in_environment(X4,esk4_2(X2,X3))
| cardinality_at_time(efficient_producers,X3) != zero
| greater(zero,growth_rate(X1,esk4_2(X2,X3))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
in_environment(esk1_0,esk4_2(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_43])]) ).
cnf(c_0_56,hypothesis,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ greater(zero,growth_rate(first_movers,X2))
| ~ in_environment(X1,X2)
| esk3_2(X1,X2) = efficient_producers ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_45]) ).
cnf(c_0_57,negated_conjecture,
( ~ greater(resilience(efficient_producers),resilience(X1))
| greater(zero,growth_rate(X1,esk4_2(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_51]),c_0_50]),c_0_43])]) ).
cnf(c_0_58,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(split_conjunct,[status(thm)],[a2]) ).
cnf(c_0_59,negated_conjecture,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,esk4_2(esk1_0,esk2_0)),zero)
| ~ in_environment(X1,esk4_2(esk1_0,esk2_0))
| esk3_2(X1,esk4_2(esk1_0,esk2_0)) = efficient_producers ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
fof(c_0_60,hypothesis,
! [X10,X11] :
( greater(number_of_organizations(X10,X11),zero)
| ~ greater_or_equal(X11,appear(an_organisation,X10))
| ~ in_environment(X10,X11)
| ~ environment(X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1])])]) ).
fof(c_0_61,plain,
! [X33,X34] :
( greater(appear(an_organisation,X33),X34)
| greater_or_equal(X34,appear(an_organisation,X33))
| ~ in_environment(X33,X34)
| ~ environment(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_environment_inequality])])]) ).
fof(c_0_62,plain,
! [X5,X2] :
( cardinality_at_time(X5,X2) = zero
=> ~ greater(zero,growth_rate(X5,X2)) ),
inference(fof_simplification,[status(thm)],[mp_empty_not_decreasing]) ).
cnf(c_0_63,negated_conjecture,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,esk4_2(esk1_0,esk2_0)),zero)
| ~ greater(zero,growth_rate(efficient_producers,esk4_2(esk1_0,esk2_0)))
| ~ in_environment(X1,esk4_2(esk1_0,esk2_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_59]),c_0_45]) ).
cnf(c_0_64,hypothesis,
( ~ greater_or_equal(X2,appear(an_organisation,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(number_of_organizations(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_65,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(appear(an_organisation,X1),X2)
| greater_or_equal(X2,appear(an_organisation,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
fof(c_0_66,plain,
! [X37,X38] :
( ~ greater(zero,growth_rate(X37,X38))
| cardinality_at_time(X37,X38) != zero ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_62])])]) ).
fof(c_0_67,plain,
! [X27,X28,X29] :
( cardinality_at_time(X29,X28) = zero
| ~ subpopulation(X29,X27,X28)
| number_of_organizations(X27,X28) != zero
| ~ in_environment(X27,X28)
| ~ environment(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_no_members])])]) ).
fof(c_0_68,plain,
! [X39,X40] :
( ( ~ in_environment(X39,X40)
| ~ environment(X39)
| subpopulation(efficient_producers,X39,X40) )
& ( ~ in_environment(X39,X40)
| ~ environment(X39)
| subpopulation(first_movers,X39,X40) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_subpopulations])])])]) ).
fof(c_0_69,plain,
! [X35,X36] :
( number_of_organizations(X35,X36) = zero
| ~ greater(appear(an_organisation,X35),X36)
| ~ in_environment(X35,X36)
| ~ environment(X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_start_of_organizations])])]) ).
cnf(c_0_70,negated_conjecture,
( ~ environment(X1)
| ~ greater(number_of_organizations(X1,esk4_2(esk1_0,esk2_0)),zero)
| ~ in_environment(X1,esk4_2(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_48]),c_0_51]),c_0_50]),c_0_43])]) ).
cnf(c_0_71,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| greater(number_of_organizations(X1,X2),zero)
| greater(appear(an_organisation,X1),X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,plain,
( ~ greater(zero,growth_rate(X1,X2))
| cardinality_at_time(X1,X2) != zero ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_73,plain,
( ~ subpopulation(X3,X1,X2)
| number_of_organizations(X1,X2) != zero
| ~ in_environment(X1,X2)
| ~ environment(X1)
| cardinality_at_time(X3,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_74,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(first_movers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_75,plain,
( ~ greater(appear(an_organisation,X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| number_of_organizations(X1,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_76,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,esk4_2(esk1_0,esk2_0))
| greater(appear(an_organisation,X1),esk4_2(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( ~ greater(resilience(efficient_producers),resilience(X1))
| cardinality_at_time(X1,esk4_2(esk1_0,esk2_0)) != zero ),
inference(spm,[status(thm)],[c_0_72,c_0_57]) ).
cnf(c_0_78,plain,
( ~ environment(X2)
| ~ in_environment(X2,X1)
| number_of_organizations(X2,X1) != zero
| cardinality_at_time(first_movers,X1) = zero ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_79,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,esk4_2(esk1_0,esk2_0))
| number_of_organizations(X1,esk4_2(esk1_0,esk2_0)) = zero ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_80,hypothesis,
cardinality_at_time(first_movers,esk4_2(esk1_0,esk2_0)) != zero,
inference(spm,[status(thm)],[c_0_77,c_0_58]) ).
cnf(c_0_81,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,esk4_2(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_55]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT037+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.66 % Computer : n008.cluster.edu
% 0.20/0.66 % Model : x86_64 x86_64
% 0.20/0.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.66 % Memory : 8046.5625MB
% 0.20/0.66 % OS : Linux 6.8.0-71-generic
% 0.20/0.66 % CPULimit : 300
% 0.20/0.66 % WCLimit : 300
% 0.20/0.66 % DateTime : Mon Sep 21 01:24:09 UTC 2026
% 0.20/0.67 % CPUTime :
% 0.20/0.67 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.72 Running first-order theorem proving
% 0.24/0.73 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.24/0.79 % Version: 3.5.1
% 0.24/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.79 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.79 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.79 % Starting sh5l with 300s (1) cores
% 0.24/0.79 % new_bool_1 with pid 4047626 completed with status 0
% 0.24/0.79 % Result found by new_bool_1
% 0.24/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.79 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.79 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.79 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.79 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.79 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.24/0.79 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.79 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.79 % SubtermCWHack with pid 4047628 completed with status 0
% 0.24/0.79 % Result found by SubtermCWHack
% 0.24/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.79 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.79 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.79 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.79 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.79 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.24/0.79 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.79 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.79 % Preprocessing time : 0.003 s
% 0.24/0.79
% 0.24/0.79 % Proof found!
% 0.24/0.79 % SZS status Theorem
% 0.24/0.79 % SZS output start CNFRefutation
% See solution above
% 0.24/0.79 % Parsed axioms : 16
% 0.24/0.79 % Removed by relevancy pruning/SinE : 0
% 0.24/0.79 % Initial clauses : 27
% 0.24/0.79 % Removed in clause preprocessing : 0
% 0.24/0.79 % Initial clauses in saturation : 27
% 0.24/0.79 % Processed clauses : 95
% 0.24/0.79 % ...of these trivial : 0
% 0.24/0.79 % ...subsumed : 9
% 0.24/0.79 % ...remaining for further processing : 86
% 0.24/0.79 % Other redundant clauses eliminated : 0
% 0.24/0.79 % Clauses deleted for lack of memory : 0
% 0.24/0.79 % Backward-subsumed : 19
% 0.24/0.79 % Backward-rewritten : 1
% 0.24/0.79 % Generated clauses : 89
% 0.24/0.79 % ...of the previous two non-redundant : 87
% 0.24/0.79 % ...aggressively subsumed : 0
% 0.24/0.79 % Contextual simplify-reflections : 12
% 0.24/0.79 % Paramodulations : 88
% 0.24/0.79 % Factorizations : 1
% 0.24/0.79 % NegExts : 0
% 0.24/0.79 % Equation resolutions : 0
% 0.24/0.79 % Disequality decompositions : 0
% 0.24/0.79 % Total rewrite steps : 25
% 0.24/0.79 % ...of those cached : 21
% 0.24/0.79 % Propositional unsat checks : 0
% 0.24/0.79 % Propositional check models : 0
% 0.24/0.79 % Propositional check unsatisfiable : 0
% 0.24/0.79 % Propositional clauses : 0
% 0.24/0.79 % Propositional clauses after purity: 0
% 0.24/0.79 % Propositional unsat core size : 0
% 0.24/0.79 % Propositional preprocessing time : 0.000
% 0.24/0.79 % Propositional encoding time : 0.000
% 0.24/0.79 % Propositional solver time : 0.000
% 0.24/0.79 % Success case prop preproc time : 0.000
% 0.24/0.79 % Success case prop encoding time : 0.000
% 0.24/0.79 % Success case prop solver time : 0.000
% 0.24/0.79 % Current number of processed clauses : 66
% 0.24/0.79 % Positive orientable unit clauses : 7
% 0.24/0.79 % Positive unorientable unit clauses: 0
% 0.24/0.79 % Negative unit clauses : 2
% 0.24/0.79 % Non-unit-clauses : 57
% 0.24/0.79 % Current number of unprocessed clauses: 19
% 0.24/0.79 % ...number of literals in the above : 89
% 0.24/0.79 % Current number of archived formulas : 0
% 0.24/0.79 % Current number of archived clauses : 20
% 0.24/0.79 % Clause-clause subsumption calls (NU) : 1142
% 0.24/0.79 % Rec. Clause-clause subsumption calls : 87
% 0.24/0.79 % Non-unit clause-clause subsumptions : 40
% 0.24/0.79 % Unit Clause-clause subsumption calls : 11
% 0.24/0.79 % Rewrite failures with RHS unbound : 0
% 0.24/0.79 % BW rewrite match attempts : 1
% 0.24/0.79 % BW rewrite match successes : 1
% 0.24/0.79 % Condensation attempts : 0
% 0.24/0.79 % Condensation successes : 0
% 0.24/0.79 % Termbank termtop insertions : 5631
% 0.24/0.79 % Search garbage collected termcells : 429
% 0.24/0.79
% 0.24/0.79 % -------------------------------------------------
% 0.24/0.79 % User time : 0.017 s
% 0.24/0.79 % System time : 0.008 s
% 0.24/0.79 % Total time : 0.025 s
% 0.24/0.79 % Maximum resident set size: 3656 pages
% 0.24/0.79
% 0.24/0.79 % -------------------------------------------------
% 0.24/0.79 % User time : 0.019 s
% 0.24/0.79 % System time : 0.013 s
% 0.24/0.79 % Total time : 0.032 s
% 0.24/0.79 % Maximum resident set size: 4864 pages
% 0.24/0.79 % E exiting
%------------------------------------------------------------------------------