↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : MGT030+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 : 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:27:34 PM UTC 2026

% Result   : Theorem 0.12s 0.45s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   49 (   8 unt;   0 def)
%            Number of atoms       :  228 (   0 equ)
%            Maximal formula atoms :   42 (   4 avg)
%            Number of connectives :  285 ( 106   ~; 125   |;  40   &)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   65 (   0 sgn  20   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mp_earliest_time_growth_rate_exceeds,axiom,
    ! [X1] :
      ( ( ? [X2] :
            ( ! [X3] :
                ( ( greater_or_equal(X3,X2)
                  & subpopulations(first_movers,efficient_producers,X1,X3) )
               => greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) )
            & in_environment(X1,X2) )
        & environment(X1) )
     => ? [X2] :
          ( ! [X3] :
              ( ( greater(X3,X2)
                & subpopulations(first_movers,efficient_producers,X1,X3) )
             => greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) )
          & ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
          & in_environment(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_earliest_time_growth_rate_exceeds) ).

fof(l1,hypothesis,
    ! [X1] :
      ( ( stable(X1)
        & environment(X1) )
     => ? [X2] :
          ( ! [X3] :
              ( ( greater_or_equal(X3,X2)
                & subpopulations(first_movers,efficient_producers,X1,X3) )
             => greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) )
          & in_environment(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1) ).

fof(prove_l12,conjecture,
    ! [X1] :
      ( ( stable(X1)
        & environment(X1) )
     => ? [X2] :
          ( ! [X3] :
              ( ( greater(X3,X2)
                & subpopulations(first_movers,efficient_producers,X1,X3) )
             => greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) )
          & ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
          & in_environment(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l12) ).

fof(c_0_3,plain,
    ! [X1] :
      ( ( ? [X2] :
            ( ! [X3] :
                ( ( greater_or_equal(X3,X2)
                  & subpopulations(first_movers,efficient_producers,X1,X3) )
               => greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) )
            & in_environment(X1,X2) )
        & environment(X1) )
     => ? [X2] :
          ( ! [X3] :
              ( ( greater(X3,X2)
                & subpopulations(first_movers,efficient_producers,X1,X3) )
             => greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) )
          & ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
          & in_environment(X1,X2) ) ),
    inference(fof_simplification,[status(thm)],[mp_earliest_time_growth_rate_exceeds]) ).

fof(c_0_4,plain,
    ! [X4,X5,X8] :
      ( ( ~ environment(X4)
        | ~ in_environment(X4,X5)
        | ~ greater(growth_rate(efficient_producers,esk1_2(X4,X5)),growth_rate(first_movers,esk1_2(X4,X5)))
        | greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8))
        | ~ greater(X8,esk2_1(X4))
        | ~ subpopulations(first_movers,efficient_producers,X4,X8) )
      & ( ~ environment(X4)
        | ~ in_environment(X4,X5)
        | ~ greater(growth_rate(efficient_producers,esk1_2(X4,X5)),growth_rate(first_movers,esk1_2(X4,X5)))
        | ~ greater(growth_rate(efficient_producers,esk2_1(X4)),growth_rate(first_movers,esk2_1(X4))) )
      & ( ~ environment(X4)
        | ~ in_environment(X4,X5)
        | ~ greater(growth_rate(efficient_producers,esk1_2(X4,X5)),growth_rate(first_movers,esk1_2(X4,X5)))
        | in_environment(X4,esk2_1(X4)) )
      & ( ~ environment(X4)
        | ~ in_environment(X4,X5)
        | greater_or_equal(esk1_2(X4,X5),X5)
        | greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8))
        | ~ greater(X8,esk2_1(X4))
        | ~ subpopulations(first_movers,efficient_producers,X4,X8) )
      & ( ~ environment(X4)
        | ~ in_environment(X4,X5)
        | greater_or_equal(esk1_2(X4,X5),X5)
        | ~ greater(growth_rate(efficient_producers,esk2_1(X4)),growth_rate(first_movers,esk2_1(X4))) )
      & ( ~ environment(X4)
        | ~ in_environment(X4,X5)
        | greater_or_equal(esk1_2(X4,X5),X5)
        | in_environment(X4,esk2_1(X4)) )
      & ( ~ environment(X4)
        | ~ in_environment(X4,X5)
        | subpopulations(first_movers,efficient_producers,X4,esk1_2(X4,X5))
        | greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8))
        | ~ greater(X8,esk2_1(X4))
        | ~ subpopulations(first_movers,efficient_producers,X4,X8) )
      & ( ~ environment(X4)
        | ~ in_environment(X4,X5)
        | subpopulations(first_movers,efficient_producers,X4,esk1_2(X4,X5))
        | ~ greater(growth_rate(efficient_producers,esk2_1(X4)),growth_rate(first_movers,esk2_1(X4))) )
      & ( ~ environment(X4)
        | ~ in_environment(X4,X5)
        | subpopulations(first_movers,efficient_producers,X4,esk1_2(X4,X5))
        | in_environment(X4,esk2_1(X4)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).

fof(c_0_5,hypothesis,
    ! [X9,X11] :
      ( ( ~ stable(X9)
        | ~ environment(X9)
        | greater(growth_rate(efficient_producers,X11),growth_rate(first_movers,X11))
        | ~ greater_or_equal(X11,esk3_1(X9))
        | ~ subpopulations(first_movers,efficient_producers,X9,X11) )
      & ( ~ stable(X9)
        | ~ environment(X9)
        | in_environment(X9,esk3_1(X9)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l1])])])])])]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( ( stable(X1)
          & environment(X1) )
       => ? [X2] :
            ( ! [X3] :
                ( ( greater(X3,X2)
                  & subpopulations(first_movers,efficient_producers,X1,X3) )
               => greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) )
            & ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
            & in_environment(X1,X2) ) ),
    inference(assume_negation,[status(cth)],[prove_l12]) ).

cnf(c_0_7,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X2)
    | subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,X2))
    | in_environment(X1,esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,hypothesis,
    ( ~ stable(X1)
    | ~ environment(X1)
    | in_environment(X1,esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X2)
    | greater_or_equal(esk1_2(X1,X2),X2)
    | in_environment(X1,esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X1] :
        ( ( stable(X1)
          & environment(X1) )
       => ? [X2] :
            ( ! [X3] :
                ( ( greater(X3,X2)
                  & subpopulations(first_movers,efficient_producers,X1,X3) )
               => greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) )
            & ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
            & in_environment(X1,X2) ) ),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

cnf(c_0_11,hypothesis,
    ( ~ stable(X1)
    | ~ environment(X1)
    | ~ greater_or_equal(X2,esk3_1(X1))
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,hypothesis,
    ( ~ environment(X1)
    | ~ stable(X1)
    | in_environment(X1,esk2_1(X1))
    | subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,esk3_1(X1))) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,hypothesis,
    ( ~ environment(X1)
    | ~ stable(X1)
    | in_environment(X1,esk2_1(X1))
    | greater_or_equal(esk1_2(X1,esk3_1(X1)),esk3_1(X1)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

fof(c_0_14,negated_conjecture,
    ! [X13] :
      ( ( greater(growth_rate(efficient_producers,X13),growth_rate(first_movers,X13))
        | ~ in_environment(esk4_0,X13)
        | ~ greater(growth_rate(efficient_producers,esk5_1(X13)),growth_rate(first_movers,esk5_1(X13))) )
      & ( greater(growth_rate(efficient_producers,X13),growth_rate(first_movers,X13))
        | ~ in_environment(esk4_0,X13)
        | greater(esk5_1(X13),X13) )
      & ( greater(growth_rate(efficient_producers,X13),growth_rate(first_movers,X13))
        | ~ in_environment(esk4_0,X13)
        | subpopulations(first_movers,efficient_producers,esk4_0,esk5_1(X13)) )
      & stable(esk4_0)
      & environment(esk4_0) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])]) ).

cnf(c_0_15,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X2)
    | ~ greater(growth_rate(efficient_producers,esk1_2(X1,X2)),growth_rate(first_movers,esk1_2(X1,X2)))
    | in_environment(X1,esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_16,hypothesis,
    ( ~ environment(X1)
    | ~ stable(X1)
    | in_environment(X1,esk2_1(X1))
    | greater(growth_rate(efficient_producers,esk1_2(X1,esk3_1(X1))),growth_rate(first_movers,esk1_2(X1,esk3_1(X1)))) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ in_environment(esk4_0,X1)
    | greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
    | subpopulations(first_movers,efficient_producers,esk4_0,esk5_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,hypothesis,
    ( ~ environment(X1)
    | ~ stable(X1)
    | in_environment(X1,esk2_1(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_8]) ).

cnf(c_0_19,negated_conjecture,
    stable(esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    environment(esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ in_environment(esk4_0,X1)
    | greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
    | greater(esk5_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X3)
    | ~ greater(X2,esk2_1(X1))
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,X3))
    | greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_23,negated_conjecture,
    ( subpopulations(first_movers,efficient_producers,esk4_0,esk5_1(esk2_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_24,negated_conjecture,
    ( greater(esk5_1(esk2_1(esk4_0)),esk2_1(esk4_0))
    | greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_25,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X3)
    | ~ greater(X2,esk2_1(X1))
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | greater_or_equal(esk1_2(X1,X3),X3)
    | greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ in_environment(esk4_0,X1)
    | subpopulations(first_movers,efficient_producers,esk4_0,esk1_2(esk4_0,X1))
    | greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk5_1(esk2_1(esk4_0))),growth_rate(first_movers,esk5_1(esk2_1(esk4_0)))) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20])]),c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ in_environment(esk4_0,X1)
    | greater_or_equal(esk1_2(esk4_0,X1),X1)
    | greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk5_1(esk2_1(esk4_0))),growth_rate(first_movers,esk5_1(esk2_1(esk4_0)))) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_20])]),c_0_24]) ).

cnf(c_0_28,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X3)
    | ~ greater(growth_rate(efficient_producers,esk1_2(X1,X3)),growth_rate(first_movers,esk1_2(X1,X3)))
    | ~ greater(X2,esk2_1(X1))
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_29,hypothesis,
    ( subpopulations(first_movers,efficient_producers,esk4_0,esk1_2(esk4_0,esk3_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk5_1(esk2_1(esk4_0))),growth_rate(first_movers,esk5_1(esk2_1(esk4_0)))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_8]),c_0_19]),c_0_20])]) ).

cnf(c_0_30,hypothesis,
    ( greater_or_equal(esk1_2(esk4_0,esk3_1(esk4_0)),esk3_1(esk4_0))
    | greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk5_1(esk2_1(esk4_0))),growth_rate(first_movers,esk5_1(esk2_1(esk4_0)))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_8]),c_0_19]),c_0_20])]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ in_environment(esk4_0,X1)
    | ~ greater(growth_rate(efficient_producers,esk1_2(esk4_0,X1)),growth_rate(first_movers,esk1_2(esk4_0,X1)))
    | greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk5_1(esk2_1(esk4_0))),growth_rate(first_movers,esk5_1(esk2_1(esk4_0)))) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_23]),c_0_20])]),c_0_24]) ).

cnf(c_0_32,hypothesis,
    ( greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk5_1(esk2_1(esk4_0))),growth_rate(first_movers,esk5_1(esk2_1(esk4_0))))
    | greater(growth_rate(efficient_producers,esk1_2(esk4_0,esk3_1(esk4_0))),growth_rate(first_movers,esk1_2(esk4_0,esk3_1(esk4_0)))) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_29]),c_0_19]),c_0_20])]),c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ in_environment(esk4_0,esk3_1(esk4_0))
    | greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk5_1(esk2_1(esk4_0))),growth_rate(first_movers,esk5_1(esk2_1(esk4_0)))) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ in_environment(esk4_0,X1)
    | ~ greater(growth_rate(efficient_producers,esk5_1(X1)),growth_rate(first_movers,esk5_1(X1)))
    | greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_35,hypothesis,
    ( greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0)))
    | greater(growth_rate(efficient_producers,esk5_1(esk2_1(esk4_0))),growth_rate(first_movers,esk5_1(esk2_1(esk4_0)))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_8]),c_0_19]),c_0_20])]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ in_environment(esk4_0,esk2_1(esk4_0))
    | greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0))) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X2)
    | ~ greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))
    | subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_38,hypothesis,
    greater(growth_rate(efficient_producers,esk2_1(esk4_0)),growth_rate(first_movers,esk2_1(esk4_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_39,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X2)
    | ~ greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))
    | greater_or_equal(esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_40,hypothesis,
    ( ~ in_environment(esk4_0,X1)
    | subpopulations(first_movers,efficient_producers,esk4_0,esk1_2(esk4_0,X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_20])]) ).

cnf(c_0_41,hypothesis,
    ( ~ in_environment(esk4_0,X1)
    | greater_or_equal(esk1_2(esk4_0,X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_20])]) ).

cnf(c_0_42,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X2)
    | ~ greater(growth_rate(efficient_producers,esk1_2(X1,X2)),growth_rate(first_movers,esk1_2(X1,X2)))
    | ~ greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_43,hypothesis,
    subpopulations(first_movers,efficient_producers,esk4_0,esk1_2(esk4_0,esk3_1(esk4_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_8]),c_0_19]),c_0_20])]) ).

cnf(c_0_44,hypothesis,
    greater_or_equal(esk1_2(esk4_0,esk3_1(esk4_0)),esk3_1(esk4_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_8]),c_0_19]),c_0_20])]) ).

cnf(c_0_45,hypothesis,
    ( ~ in_environment(esk4_0,X1)
    | ~ greater(growth_rate(efficient_producers,esk1_2(esk4_0,X1)),growth_rate(first_movers,esk1_2(esk4_0,X1))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_38]),c_0_20])]) ).

cnf(c_0_46,hypothesis,
    greater(growth_rate(efficient_producers,esk1_2(esk4_0,esk3_1(esk4_0))),growth_rate(first_movers,esk1_2(esk4_0,esk3_1(esk4_0)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_43]),c_0_19]),c_0_20])]),c_0_44])]) ).

cnf(c_0_47,hypothesis,
    ~ in_environment(esk4_0,esk3_1(esk4_0)),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_48,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_8]),c_0_19]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT030+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n015.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 01:25:22 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/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.12/0.45  % Version: 3.5.1
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  % Starting sh5l with 300s (1) cores
% 0.12/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 254115 completed with status 0
% 0.12/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45  % No SInE strategy applied
% 0.12/0.45  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.12/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.12/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 136s (1) cores
% 0.12/0.45  % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 254124 completed with status 0
% 0.12/0.45  % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45  % No SInE strategy applied
% 0.12/0.45  % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.12/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45  % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.12/0.45  % Preprocessing time       : 0.001 s
% 0.12/0.45  
% 0.12/0.45  % Proof found!
% 0.12/0.45  % SZS status Theorem
% 0.12/0.45  % SZS output start CNFRefutation
% See solution above
% 0.12/0.45  % Parsed axioms                        : 3
% 0.12/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.45  % Initial clauses                      : 16
% 0.12/0.45  % Removed in clause preprocessing      : 0
% 0.12/0.45  % Initial clauses in saturation        : 16
% 0.12/0.45  % Processed clauses                    : 65
% 0.12/0.45  % ...of these trivial                  : 1
% 0.12/0.45  % ...subsumed                          : 4
% 0.12/0.45  % ...remaining for further processing  : 60
% 0.12/0.45  % Other redundant clauses eliminated   : 0
% 0.12/0.45  % Clauses deleted for lack of memory   : 0
% 0.12/0.45  % Backward-subsumed                    : 17
% 0.12/0.45  % Backward-rewritten                   : 13
% 0.12/0.45  % Generated clauses                    : 76
% 0.12/0.45  % ...of the previous two non-redundant : 75
% 0.12/0.45  % ...aggressively subsumed             : 0
% 0.12/0.45  % Contextual simplify-reflections      : 7
% 0.12/0.45  % Paramodulations                      : 76
% 0.12/0.45  % Factorizations                       : 0
% 0.12/0.45  % NegExts                              : 0
% 0.12/0.45  % Equation resolutions                 : 0
% 0.12/0.45  % Disequality decompositions           : 0
% 0.12/0.45  % Total rewrite steps                  : 106
% 0.12/0.45  % ...of those cached                   : 100
% 0.12/0.45  % Propositional unsat checks           : 0
% 0.12/0.45  %    Propositional check models        : 0
% 0.12/0.45  %    Propositional check unsatisfiable : 0
% 0.12/0.45  %    Propositional clauses             : 0
% 0.12/0.45  %    Propositional clauses after purity: 0
% 0.12/0.45  %    Propositional unsat core size     : 0
% 0.12/0.45  %    Propositional preprocessing time  : 0.000
% 0.12/0.45  %    Propositional encoding time       : 0.000
% 0.12/0.45  %    Propositional solver time         : 0.000
% 0.12/0.45  %    Success case prop preproc time    : 0.000
% 0.12/0.45  %    Success case prop encoding time   : 0.000
% 0.12/0.45  %    Success case prop solver time     : 0.000
% 0.12/0.45  % Current number of processed clauses  : 30
% 0.12/0.45  %    Positive orientable unit clauses  : 8
% 0.12/0.45  %    Positive unorientable unit clauses: 0
% 0.12/0.45  %    Negative unit clauses             : 1
% 0.12/0.45  %    Non-unit-clauses                  : 21
% 0.12/0.45  % Current number of unprocessed clauses: 8
% 0.12/0.45  % ...number of literals in the above   : 24
% 0.12/0.45  % Current number of archived formulas  : 0
% 0.12/0.45  % Current number of archived clauses   : 30
% 0.12/0.45  % Clause-clause subsumption calls (NU) : 578
% 0.12/0.45  % Rec. Clause-clause subsumption calls : 193
% 0.12/0.45  % Non-unit clause-clause subsumptions  : 27
% 0.12/0.45  % Unit Clause-clause subsumption calls : 48
% 0.12/0.45  % Rewrite failures with RHS unbound    : 0
% 0.12/0.45  % BW rewrite match attempts            : 19
% 0.12/0.45  % BW rewrite match successes           : 2
% 0.12/0.45  % Condensation attempts                : 0
% 0.12/0.45  % Condensation successes               : 0
% 0.12/0.45  % Termbank termtop insertions          : 3951
% 0.12/0.45  % Search garbage collected termcells   : 291
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.007 s
% 0.12/0.45  % System time              : 0.003 s
% 0.12/0.45  % Total time               : 0.010 s
% 0.12/0.45  % Maximum resident set size: 3632 pages
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.026 s
% 0.12/0.45  % System time              : 0.014 s
% 0.12/0.45  % Total time               : 0.040 s
% 0.12/0.45  % Maximum resident set size: 4864 pages
% 0.12/0.45  % E exiting
%------------------------------------------------------------------------------