TSTP Solution File: MGT024+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT024+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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 : 600s
% DateTime : Sun Jul 17 22:09:37 EDT 2022
% Result : Theorem 0.21s 1.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 59 ( 10 unt; 0 def)
% Number of atoms : 272 ( 44 equ)
% Maximal formula atoms : 48 ( 4 avg)
% Number of connectives : 324 ( 111 ~; 164 |; 37 &)
% ( 0 <=>; 12 =>; 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 : 56 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a6,hypothesis,
! [X1,X2] :
( ( environment(X1)
& in_environment(X1,X2) )
=> ( ( decreases(resources(X1,X2))
=> ~ decreases(number_of_organizations(X1,X2)) )
& ( constant(resources(X1,X2))
=> constant(number_of_organizations(X1,X2)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a6) ).
fof(a3,hypothesis,
! [X1,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& greater(number_of_organizations(X1,X2),zero) )
=> ( ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) )
& ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a3) ).
fof(prove_l6,conjecture,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& greater_or_equal(X2,equilibrium(X1)) )
=> ( ( growth_rate(first_movers,X2) = zero
& growth_rate(efficient_producers,X2) = zero )
| ( greater(growth_rate(first_movers,X2),zero)
& greater(zero,growth_rate(efficient_producers,X2)) )
| ( greater(growth_rate(efficient_producers,X2),zero)
& greater(zero,growth_rate(first_movers,X2)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_l6) ).
fof(mp_time_point_occur,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_time_point_occur) ).
fof(mp_positive_number_of_organizations,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_positive_number_of_organizations) ).
fof(mp_equilibrium,axiom,
! [X1,X2] :
( ( environment(X1)
& greater_or_equal(X2,equilibrium(X1)) )
=> ~ greater(equilibrium(X1),X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_equilibrium) ).
fof(l7,hypothesis,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& constant(number_of_organizations(X1,X2)) )
=> ( ( growth_rate(first_movers,X2) = zero
& growth_rate(efficient_producers,X2) = zero )
| ( greater(growth_rate(first_movers,X2),zero)
& greater(zero,growth_rate(efficient_producers,X2)) )
| ( greater(growth_rate(efficient_producers,X2),zero)
& greater(zero,growth_rate(first_movers,X2)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l7) ).
fof(c_0_7,hypothesis,
! [X3,X4] :
( ( ~ decreases(resources(X3,X4))
| ~ decreases(number_of_organizations(X3,X4))
| ~ environment(X3)
| ~ in_environment(X3,X4) )
& ( ~ constant(resources(X3,X4))
| constant(number_of_organizations(X3,X4))
| ~ environment(X3)
| ~ in_environment(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a6])])])]) ).
fof(c_0_8,hypothesis,
! [X3,X4] :
( ( ~ greater(equilibrium(X3),X4)
| decreases(resources(X3,X4))
| ~ environment(X3)
| ~ in_environment(X3,X4)
| ~ greater(number_of_organizations(X3,X4),zero) )
& ( greater(equilibrium(X3),X4)
| constant(resources(X3,X4))
| ~ environment(X3)
| ~ in_environment(X3,X4)
| ~ greater(number_of_organizations(X3,X4),zero) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a3])])])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& greater_or_equal(X2,equilibrium(X1)) )
=> ( ( growth_rate(first_movers,X2) = zero
& growth_rate(efficient_producers,X2) = zero )
| ( greater(growth_rate(first_movers,X2),zero)
& greater(zero,growth_rate(efficient_producers,X2)) )
| ( greater(growth_rate(efficient_producers,X2),zero)
& greater(zero,growth_rate(first_movers,X2)) ) ) ),
inference(assume_negation,[status(cth)],[prove_l6]) ).
cnf(c_0_10,hypothesis,
( constant(number_of_organizations(X1,X2))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ constant(resources(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
( constant(resources(X1,X2))
| greater(equilibrium(X1),X2)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| in_environment(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occur])]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| greater(number_of_organizations(X3,X4),zero) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_positive_number_of_organizations])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ environment(X3)
| ~ greater_or_equal(X4,equilibrium(X3))
| ~ greater(equilibrium(X3),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mp_equilibrium])])]) ).
fof(c_0_15,negated_conjecture,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& greater_or_equal(esk2_0,equilibrium(esk1_0))
& ( growth_rate(first_movers,esk2_0) != zero
| growth_rate(efficient_producers,esk2_0) != zero )
& ( ~ greater(growth_rate(first_movers,esk2_0),zero)
| ~ greater(zero,growth_rate(efficient_producers,esk2_0)) )
& ( ~ greater(growth_rate(efficient_producers,esk2_0),zero)
| ~ greater(zero,growth_rate(first_movers,esk2_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_16,hypothesis,
! [X3,X4] :
( ( greater(growth_rate(efficient_producers,X4),zero)
| greater(growth_rate(first_movers,X4),zero)
| growth_rate(first_movers,X4) = zero
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ constant(number_of_organizations(X3,X4)) )
& ( greater(zero,growth_rate(first_movers,X4))
| greater(growth_rate(first_movers,X4),zero)
| growth_rate(first_movers,X4) = zero
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ constant(number_of_organizations(X3,X4)) )
& ( greater(growth_rate(efficient_producers,X4),zero)
| greater(zero,growth_rate(efficient_producers,X4))
| growth_rate(first_movers,X4) = zero
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ constant(number_of_organizations(X3,X4)) )
& ( greater(zero,growth_rate(first_movers,X4))
| greater(zero,growth_rate(efficient_producers,X4))
| growth_rate(first_movers,X4) = zero
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ constant(number_of_organizations(X3,X4)) )
& ( greater(growth_rate(efficient_producers,X4),zero)
| greater(growth_rate(first_movers,X4),zero)
| growth_rate(efficient_producers,X4) = zero
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ constant(number_of_organizations(X3,X4)) )
& ( greater(zero,growth_rate(first_movers,X4))
| greater(growth_rate(first_movers,X4),zero)
| growth_rate(efficient_producers,X4) = zero
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ constant(number_of_organizations(X3,X4)) )
& ( greater(growth_rate(efficient_producers,X4),zero)
| greater(zero,growth_rate(efficient_producers,X4))
| growth_rate(efficient_producers,X4) = zero
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ constant(number_of_organizations(X3,X4)) )
& ( greater(zero,growth_rate(first_movers,X4))
| greater(zero,growth_rate(efficient_producers,X4))
| growth_rate(efficient_producers,X4) = zero
| ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ constant(number_of_organizations(X3,X4)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l7])])]) ).
cnf(c_0_17,hypothesis,
( constant(number_of_organizations(X1,X2))
| greater(equilibrium(X1),X2)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( greater(number_of_organizations(X1,X2),zero)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ greater(equilibrium(X1),X2)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
greater_or_equal(esk2_0,equilibrium(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(growth_rate(efficient_producers,X2),zero)
| ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,hypothesis,
( constant(number_of_organizations(X1,X2))
| greater(equilibrium(X1),X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_26,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_27,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(zero,growth_rate(first_movers,X2))
| ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(growth_rate(first_movers,esk2_0),zero)
| greater(growth_rate(efficient_producers,esk2_0),zero)
| ~ constant(number_of_organizations(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
constant(number_of_organizations(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_22])]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(zero,growth_rate(first_movers,esk2_0))
| greater(growth_rate(first_movers,esk2_0),zero)
| ~ constant(number_of_organizations(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_22])]) ).
cnf(c_0_31,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_15]) ).
cnf(c_0_32,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(growth_rate(efficient_producers,esk2_0),zero)
| greater(growth_rate(first_movers,esk2_0),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(growth_rate(first_movers,esk2_0),zero)
| greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_29])]) ).
cnf(c_0_34,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(growth_rate(efficient_producers,X2),zero)
| ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_35,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(zero,growth_rate(first_movers,X2))
| ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,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_15]) ).
cnf(c_0_37,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(growth_rate(first_movers,esk2_0),zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_38,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(growth_rate(efficient_producers,X2),zero)
| ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_39,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(zero,growth_rate(first_movers,X2))
| ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_40,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(zero,growth_rate(efficient_producers,esk2_0))
| greater(growth_rate(efficient_producers,esk2_0),zero)
| ~ constant(number_of_organizations(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_22])]) ).
cnf(c_0_41,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(zero,growth_rate(first_movers,esk2_0))
| greater(zero,growth_rate(efficient_producers,esk2_0))
| ~ constant(number_of_organizations(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_24]),c_0_22])]) ).
cnf(c_0_42,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| ~ greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(growth_rate(first_movers,esk2_0),zero)
| greater(growth_rate(efficient_producers,esk2_0),zero)
| ~ constant(number_of_organizations(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_22])]) ).
cnf(c_0_44,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(zero,growth_rate(first_movers,esk2_0))
| greater(growth_rate(first_movers,esk2_0),zero)
| ~ constant(number_of_organizations(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_24]),c_0_22])]) ).
cnf(c_0_45,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(growth_rate(efficient_producers,esk2_0),zero)
| greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_29])]) ).
cnf(c_0_46,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_29])]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(growth_rate(efficient_producers,esk2_0),zero)
| greater(growth_rate(first_movers,esk2_0),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_29])]) ).
cnf(c_0_48,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(growth_rate(first_movers,esk2_0),zero)
| greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_29])]) ).
cnf(c_0_49,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) != zero
| growth_rate(first_movers,esk2_0) != zero ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_50,negated_conjecture,
growth_rate(efficient_producers,esk2_0) = zero,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_45]),c_0_46]),c_0_42]) ).
cnf(c_0_51,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(growth_rate(efficient_producers,X2),zero)
| ~ constant(number_of_organizations(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_52,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(growth_rate(first_movers,esk2_0),zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_47]),c_0_48]) ).
cnf(c_0_53,negated_conjecture,
growth_rate(first_movers,esk2_0) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(zero,growth_rate(efficient_producers,esk2_0))
| greater(growth_rate(efficient_producers,esk2_0),zero)
| ~ constant(number_of_organizations(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_24]),c_0_22])]) ).
cnf(c_0_55,negated_conjecture,
greater(growth_rate(first_movers,esk2_0),zero),
inference(sr,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(growth_rate(efficient_producers,esk2_0),zero)
| greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_29])]) ).
cnf(c_0_57,negated_conjecture,
~ greater(zero,zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_50]),c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_50]),c_0_50])]),c_0_53]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT024+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 07:53:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.41 # Preprocessing time : 0.016 s
% 0.21/1.41
% 0.21/1.41 # Proof found!
% 0.21/1.41 # SZS status Theorem
% 0.21/1.41 # SZS output start CNFRefutation
% See solution above
% 0.21/1.41 # Proof object total steps : 59
% 0.21/1.41 # Proof object clause steps : 44
% 0.21/1.41 # Proof object formula steps : 15
% 0.21/1.41 # Proof object conjectures : 33
% 0.21/1.41 # Proof object clause conjectures : 30
% 0.21/1.41 # Proof object formula conjectures : 3
% 0.21/1.41 # Proof object initial clauses used : 18
% 0.21/1.41 # Proof object initial formulas used : 7
% 0.21/1.41 # Proof object generating inferences : 15
% 0.21/1.41 # Proof object simplifying inferences : 50
% 0.21/1.41 # Training examples: 0 positive, 0 negative
% 0.21/1.41 # Parsed axioms : 7
% 0.21/1.41 # Removed by relevancy pruning/SinE : 0
% 0.21/1.41 # Initial clauses : 21
% 0.21/1.41 # Removed in clause preprocessing : 0
% 0.21/1.41 # Initial clauses in saturation : 21
% 0.21/1.41 # Processed clauses : 56
% 0.21/1.41 # ...of these trivial : 0
% 0.21/1.41 # ...subsumed : 1
% 0.21/1.41 # ...remaining for further processing : 54
% 0.21/1.41 # Other redundant clauses eliminated : 0
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 5
% 0.21/1.41 # Backward-rewritten : 17
% 0.21/1.41 # Generated clauses : 26
% 0.21/1.41 # ...of the previous two non-trivial : 39
% 0.21/1.41 # Contextual simplify-reflections : 6
% 0.21/1.41 # Paramodulations : 24
% 0.21/1.41 # Factorizations : 0
% 0.21/1.41 # Equation resolutions : 0
% 0.21/1.41 # Current number of processed clauses : 30
% 0.21/1.41 # Positive orientable unit clauses : 8
% 0.21/1.41 # Positive unorientable unit clauses: 0
% 0.21/1.41 # Negative unit clauses : 3
% 0.21/1.41 # Non-unit-clauses : 19
% 0.21/1.41 # Current number of unprocessed clauses: 0
% 0.21/1.41 # ...number of literals in the above : 0
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 24
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 258
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 30
% 0.21/1.41 # Non-unit clause-clause subsumptions : 11
% 0.21/1.41 # Unit Clause-clause subsumption calls : 48
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 2
% 0.21/1.41 # BW rewrite match successes : 2
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 2340
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.016 s
% 0.21/1.41 # System time : 0.003 s
% 0.21/1.41 # Total time : 0.019 s
% 0.21/1.41 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------