↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : MGT034-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n020.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:28 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.45s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   23
% Syntax   : Number of clauses     :   94 (  22 unt;  18 nHn;  93 RR)
%            Number of literals    :  252 (  14 equ; 151 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-4 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :  118 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(mp_critical_point_means_FM_and_EP_35,axiom,
    ( ~ in_environment(X1,critical_point(X1))
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,critical_point(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_critical_point_means_FM_and_EP_35) ).

cnf(mp_critical_time_points_46,axiom,
    ( ~ greater(critical_point(X1),X2)
    | ~ greater_or_equal(X2,appear(efficient_producers,X1))
    | ~ in_environment(X1,critical_point(X1))
    | ~ environment(X1)
    | in_environment(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_critical_time_points_46) ).

cnf(mp_greater_or_equal_52,axiom,
    ( X1 != X2
    | greater_or_equal(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_52) ).

cnf(mp_FM_and_EP_members_EP_appeared_49,axiom,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | greater_or_equal(X2,appear(efficient_producers,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_FM_and_EP_members_EP_appeared_49) ).

cnf(prove_t3_59,negated_conjecture,
    in_environment(sk1,critical_point(sk1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t3_59) ).

cnf(prove_t3_58,negated_conjecture,
    environment(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t3_58) ).

cnf(mp_greater_or_equal_50,axiom,
    ( ~ greater_or_equal(X1,X2)
    | X1 = X2
    | greater(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_50) ).

cnf(a10_56,hypothesis,
    ( ~ greater_or_equal(X3,X4)
    | ~ greater_or_equal(X4,X2)
    | ~ subpopulations(first_movers,efficient_producers,X1,X3)
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a10_56) ).

cnf(mp_FM_and_EP_when_EP_appears_36,axiom,
    ( ~ in_environment(X1,appear(efficient_producers,X1))
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,appear(efficient_producers,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_FM_and_EP_when_EP_appears_36) ).

cnf(mp_greater_or_equal_51,axiom,
    ( ~ greater(X1,X2)
    | greater_or_equal(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_51) ).

cnf(prove_t3_61,negated_conjecture,
    greater(critical_point(sk1),sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t3_61) ).

cnf(prove_t3_60,negated_conjecture,
    greater_or_equal(sk2,appear(efficient_producers,sk1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t3_60) ).

cnf(a12_57,hypothesis,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | decreases(difference(founding_rate(first_movers,X2),founding_rate(efficient_producers,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12_57) ).

cnf(mp_difference_between_founding_rates_37,axiom,
    ( ~ decreases(difference(founding_rate(first_movers,X1),founding_rate(efficient_producers,X1)))
    | decreases(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))
    | decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_difference_between_founding_rates_37) ).

cnf(l3_34,axiom,
    ( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3_34) ).

cnf(mp_decreasing_function_38,axiom,
    ( ~ decreases(difference(growth_rate(first_movers,X3),growth_rate(efficient_producers,X3)))
    | ~ greater(X2,X3)
    | ~ greater_or_equal(X3,appear(efficient_producers,X1))
    | ~ greater_or_equal(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)
    | ~ in_environment(X1,X2)
    | ~ environment(X1)
    | greater(difference(growth_rate(first_movers,X3),growth_rate(efficient_producers,X3)),zero) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_decreasing_function_38) ).

cnf(mp_relationship_of_growth_rates_53,axiom,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | greater_or_equal(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)
    | greater(zero,difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_relationship_of_growth_rates_53) ).

cnf(d1_54,hypothesis,
    ( ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
    | X2 != critical_point(X1)
    | ~ environment(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_54) ).

cnf(mp_negative_growth_rate_difference_39,axiom,
    ( ~ greater(zero,difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))
    | greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_negative_growth_rate_difference_39) ).

cnf(mp_symmetry_of_subpopulations_48,axiom,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | subpopulations(efficient_producers,first_movers,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations_48) ).

cnf(mp1_high_growth_rates_33,axiom,
    ( ~ greater(growth_rate(X3,X4),growth_rate(X2,X4))
    | ~ subpopulations(X2,X3,X1,X4)
    | ~ environment(X1)
    | selection_favors(X3,X2,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp1_high_growth_rates_33) ).

cnf(prove_t3_62,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t3_62) ).

cnf(mp_positive_growth_rate_difference_41,axiom,
    ( ~ greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)
    | greater(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_positive_growth_rate_difference_41) ).

cnf(c_0_23,plain,
    ( ~ in_environment(X1,critical_point(X1))
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,critical_point(X1)) ),
    inference(fof_simplification,[status(thm)],[mp_critical_point_means_FM_and_EP_35]) ).

cnf(c_0_24,plain,
    ( ~ greater(critical_point(X1),X2)
    | ~ greater_or_equal(X2,appear(efficient_producers,X1))
    | ~ in_environment(X1,critical_point(X1))
    | ~ environment(X1)
    | in_environment(X1,X2) ),
    inference(fof_simplification,[status(thm)],[mp_critical_time_points_46]) ).

cnf(c_0_25,plain,
    ( X1 != X2
    | greater_or_equal(X1,X2) ),
    inference(fof_simplification,[status(thm)],[mp_greater_or_equal_52]) ).

cnf(c_0_26,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | greater_or_equal(X2,appear(efficient_producers,X1)) ),
    inference(fof_simplification,[status(thm)],[mp_FM_and_EP_members_EP_appeared_49]) ).

cnf(c_0_27,plain,
    ( ~ in_environment(X1,critical_point(X1))
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,critical_point(X1)) ),
    c_0_23 ).

cnf(c_0_28,negated_conjecture,
    in_environment(sk1,critical_point(sk1)),
    prove_t3_59 ).

cnf(c_0_29,negated_conjecture,
    environment(sk1),
    prove_t3_58 ).

cnf(c_0_30,plain,
    ( ~ greater(critical_point(X1),X2)
    | ~ greater_or_equal(X2,appear(efficient_producers,X1))
    | ~ in_environment(X1,critical_point(X1))
    | ~ environment(X1)
    | in_environment(X1,X2) ),
    c_0_24 ).

cnf(c_0_31,plain,
    ( X1 != X2
    | greater_or_equal(X1,X2) ),
    c_0_25 ).

cnf(c_0_32,plain,
    ( ~ greater_or_equal(X1,X2)
    | X1 = X2
    | greater(X1,X2) ),
    inference(fof_simplification,[status(thm)],[mp_greater_or_equal_50]) ).

cnf(c_0_33,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | greater_or_equal(X2,appear(efficient_producers,X1)) ),
    c_0_26 ).

cnf(c_0_34,negated_conjecture,
    subpopulations(first_movers,efficient_producers,sk1,critical_point(sk1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ greater(critical_point(sk1),X1)
    | ~ greater_or_equal(X1,appear(efficient_producers,sk1))
    | in_environment(sk1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_29])]) ).

cnf(c_0_36,plain,
    greater_or_equal(X1,X1),
    inference(er,[status(thm)],[c_0_31]) ).

cnf(c_0_37,plain,
    ( ~ greater_or_equal(X1,X2)
    | X1 = X2
    | greater(X1,X2) ),
    c_0_32 ).

cnf(c_0_38,negated_conjecture,
    greater_or_equal(critical_point(sk1),appear(efficient_producers,sk1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29])]) ).

cnf(c_0_39,hypothesis,
    ( ~ greater_or_equal(X3,X4)
    | ~ greater_or_equal(X4,X2)
    | ~ subpopulations(first_movers,efficient_producers,X1,X3)
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,X4) ),
    inference(fof_simplification,[status(thm)],[a10_56]) ).

cnf(c_0_40,plain,
    ( ~ in_environment(X1,appear(efficient_producers,X1))
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,appear(efficient_producers,X1)) ),
    inference(fof_simplification,[status(thm)],[mp_FM_and_EP_when_EP_appears_36]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ greater(critical_point(sk1),appear(efficient_producers,sk1))
    | in_environment(sk1,appear(efficient_producers,sk1)) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_42,negated_conjecture,
    ( greater(critical_point(sk1),appear(efficient_producers,sk1))
    | appear(efficient_producers,sk1) = critical_point(sk1) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_43,hypothesis,
    ( ~ greater_or_equal(X3,X4)
    | ~ greater_or_equal(X4,X2)
    | ~ subpopulations(first_movers,efficient_producers,X1,X3)
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,X4) ),
    c_0_39 ).

cnf(c_0_44,plain,
    ( ~ in_environment(X1,appear(efficient_producers,X1))
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,appear(efficient_producers,X1)) ),
    c_0_40 ).

cnf(c_0_45,negated_conjecture,
    ( in_environment(sk1,appear(efficient_producers,sk1))
    | appear(efficient_producers,sk1) = critical_point(sk1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_46,plain,
    ( ~ greater(X1,X2)
    | greater_or_equal(X1,X2) ),
    inference(fof_simplification,[status(thm)],[mp_greater_or_equal_51]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ subpopulations(first_movers,efficient_producers,sk1,X2)
    | ~ greater_or_equal(X1,X2)
    | ~ greater_or_equal(critical_point(sk1),X1)
    | subpopulations(first_movers,efficient_producers,sk1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_29])]) ).

cnf(c_0_48,negated_conjecture,
    ( subpopulations(first_movers,efficient_producers,sk1,appear(efficient_producers,sk1))
    | appear(efficient_producers,sk1) = critical_point(sk1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_29])]) ).

cnf(c_0_49,plain,
    ( ~ greater(X1,X2)
    | greater_or_equal(X1,X2) ),
    c_0_46 ).

cnf(c_0_50,negated_conjecture,
    greater(critical_point(sk1),sk2),
    prove_t3_61 ).

cnf(c_0_51,negated_conjecture,
    ( ~ greater_or_equal(critical_point(sk1),X1)
    | ~ greater_or_equal(X1,appear(efficient_producers,sk1))
    | subpopulations(first_movers,efficient_producers,sk1,X1)
    | appear(efficient_producers,sk1) = critical_point(sk1) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_52,negated_conjecture,
    greater_or_equal(critical_point(sk1),sk2),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_53,negated_conjecture,
    greater_or_equal(sk2,appear(efficient_producers,sk1)),
    prove_t3_60 ).

cnf(c_0_54,negated_conjecture,
    ( ~ greater_or_equal(X1,critical_point(sk1))
    | ~ greater_or_equal(critical_point(sk1),X1)
    | subpopulations(first_movers,efficient_producers,sk1,X1) ),
    inference(spm,[status(thm)],[c_0_47,c_0_34]) ).

cnf(c_0_55,hypothesis,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | decreases(difference(founding_rate(first_movers,X2),founding_rate(efficient_producers,X2))) ),
    inference(fof_simplification,[status(thm)],[a12_57]) ).

cnf(c_0_56,negated_conjecture,
    ( subpopulations(first_movers,efficient_producers,sk1,sk2)
    | appear(efficient_producers,sk1) = critical_point(sk1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).

cnf(c_0_57,negated_conjecture,
    ( ~ greater_or_equal(sk2,critical_point(sk1))
    | subpopulations(first_movers,efficient_producers,sk1,sk2) ),
    inference(spm,[status(thm)],[c_0_54,c_0_52]) ).

cnf(c_0_58,plain,
    ( ~ decreases(difference(founding_rate(first_movers,X1),founding_rate(efficient_producers,X1)))
    | decreases(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))
    | decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))) ),
    inference(fof_simplification,[status(thm)],[mp_difference_between_founding_rates_37]) ).

cnf(c_0_59,hypothesis,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | decreases(difference(founding_rate(first_movers,X2),founding_rate(efficient_producers,X2))) ),
    c_0_55 ).

cnf(c_0_60,negated_conjecture,
    subpopulations(first_movers,efficient_producers,sk1,sk2),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_56]),c_0_57]) ).

cnf(c_0_61,plain,
    ( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1) ),
    inference(fof_simplification,[status(thm)],[l3_34]) ).

cnf(c_0_62,plain,
    ( ~ decreases(difference(founding_rate(first_movers,X1),founding_rate(efficient_producers,X1)))
    | decreases(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))
    | decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))) ),
    c_0_58 ).

cnf(c_0_63,hypothesis,
    decreases(difference(founding_rate(first_movers,sk2),founding_rate(efficient_producers,sk2))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_29])]) ).

cnf(c_0_64,plain,
    ( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1) ),
    c_0_61 ).

cnf(c_0_65,hypothesis,
    ( decreases(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)))
    | decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_66,plain,
    ( ~ decreases(difference(growth_rate(first_movers,X3),growth_rate(efficient_producers,X3)))
    | ~ greater(X2,X3)
    | ~ greater_or_equal(X3,appear(efficient_producers,X1))
    | ~ greater_or_equal(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)
    | ~ in_environment(X1,X2)
    | ~ environment(X1)
    | greater(difference(growth_rate(first_movers,X3),growth_rate(efficient_producers,X3)),zero) ),
    inference(fof_simplification,[status(thm)],[mp_decreasing_function_38]) ).

cnf(c_0_67,hypothesis,
    ( ~ environment(X1)
    | ~ subpopulations(first_movers,efficient_producers,X1,sk2)
    | decreases(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2))) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_68,plain,
    ( ~ decreases(difference(growth_rate(first_movers,X3),growth_rate(efficient_producers,X3)))
    | ~ greater(X2,X3)
    | ~ greater_or_equal(X3,appear(efficient_producers,X1))
    | ~ greater_or_equal(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)
    | ~ in_environment(X1,X2)
    | ~ environment(X1)
    | greater(difference(growth_rate(first_movers,X3),growth_rate(efficient_producers,X3)),zero) ),
    c_0_66 ).

cnf(c_0_69,negated_conjecture,
    decreases(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_60]),c_0_29])]) ).

cnf(c_0_70,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | greater_or_equal(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)
    | greater(zero,difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2))) ),
    inference(fof_simplification,[status(thm)],[mp_relationship_of_growth_rates_53]) ).

cnf(c_0_71,negated_conjecture,
    ( ~ environment(X2)
    | ~ greater(X1,sk2)
    | ~ in_environment(X2,X1)
    | ~ greater_or_equal(sk2,appear(efficient_producers,X2))
    | ~ greater_or_equal(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)
    | greater(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)),zero) ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_72,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | greater_or_equal(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)
    | greater(zero,difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2))) ),
    c_0_70 ).

cnf(c_0_73,hypothesis,
    ( ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
    | X2 != critical_point(X1)
    | ~ environment(X1) ),
    inference(fof_simplification,[status(thm)],[d1_54]) ).

cnf(c_0_74,plain,
    ( ~ greater(zero,difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))
    | greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
    inference(fof_simplification,[status(thm)],[mp_negative_growth_rate_difference_39]) ).

cnf(c_0_75,negated_conjecture,
    ( ~ greater_or_equal(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero)
    | greater(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)),zero) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_28]),c_0_53]),c_0_50]),c_0_29])]) ).

cnf(c_0_76,negated_conjecture,
    ( greater(zero,difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))))
    | greater_or_equal(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_34]),c_0_29])]) ).

cnf(c_0_77,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | subpopulations(efficient_producers,first_movers,X1,X2) ),
    inference(fof_simplification,[status(thm)],[mp_symmetry_of_subpopulations_48]) ).

cnf(c_0_78,hypothesis,
    ( ~ greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
    | X2 != critical_point(X1)
    | ~ environment(X1) ),
    c_0_73 ).

cnf(c_0_79,plain,
    ( ~ greater(zero,difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))
    | greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
    c_0_74 ).

cnf(c_0_80,negated_conjecture,
    ( greater(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)),zero)
    | greater(zero,difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))) ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_81,plain,
    ( ~ greater(growth_rate(X3,X4),growth_rate(X2,X4))
    | ~ subpopulations(X2,X3,X1,X4)
    | ~ environment(X1)
    | selection_favors(X3,X2,X4) ),
    inference(fof_simplification,[status(thm)],[mp1_high_growth_rates_33]) ).

cnf(c_0_82,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | subpopulations(efficient_producers,first_movers,X1,X2) ),
    c_0_77 ).

cnf(c_0_83,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sk2),
    inference(fof_simplification,[status(thm)],[prove_t3_62]) ).

cnf(c_0_84,plain,
    ( ~ greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)
    | greater(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)) ),
    inference(fof_simplification,[status(thm)],[mp_positive_growth_rate_difference_41]) ).

cnf(c_0_85,hypothesis,
    ( ~ environment(X1)
    | ~ greater(growth_rate(efficient_producers,critical_point(X1)),growth_rate(first_movers,critical_point(X1))) ),
    inference(er,[status(thm)],[c_0_78]) ).

cnf(c_0_86,negated_conjecture,
    ( greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1)))
    | greater(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)),zero) ),
    inference(spm,[status(thm)],[c_0_79,c_0_80]) ).

cnf(c_0_87,plain,
    ( ~ greater(growth_rate(X3,X4),growth_rate(X2,X4))
    | ~ subpopulations(X2,X3,X1,X4)
    | ~ environment(X1)
    | selection_favors(X3,X2,X4) ),
    c_0_81 ).

cnf(c_0_88,negated_conjecture,
    subpopulations(efficient_producers,first_movers,sk1,sk2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_60]),c_0_29])]) ).

cnf(c_0_89,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sk2),
    c_0_83 ).

cnf(c_0_90,plain,
    ( ~ greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)
    | greater(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)) ),
    c_0_84 ).

cnf(c_0_91,hypothesis,
    greater(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)),zero),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_29])]) ).

cnf(c_0_92,negated_conjecture,
    ~ greater(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_29])]),c_0_89]) ).

cnf(c_0_93,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT034-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n020.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 01:23:17 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.41  Running first-order theorem proving
% 0.15/0.41  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.45  % Version: 3.5.1
% 0.15/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45  % Starting sh5l with 300s (1) cores
% 0.15/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1691973 completed with status 0
% 0.15/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45  % No SInE strategy applied
% 0.15/0.45  % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45  % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.15/0.45  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45  % new_bool_3 with pid 1691983 completed with status 0
% 0.15/0.45  % Result found by new_bool_3
% 0.15/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45  % No SInE strategy applied
% 0.15/0.45  % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45  % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.15/0.45  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45  % Preprocessing time       : 0.002 s
% 0.15/0.45  % Presaturation interreduction done
% 0.15/0.45  
% 0.15/0.45  % Proof found!
% 0.15/0.45  % SZS status Unsatisfiable
% 0.15/0.45  % SZS output start CNFRefutation
% See solution above
% 0.15/0.45  % Parsed axioms                        : 30
% 0.15/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.45  % Initial clauses                      : 30
% 0.15/0.45  % Removed in clause preprocessing      : 0
% 0.15/0.45  % Initial clauses in saturation        : 30
% 0.15/0.45  % Processed clauses                    : 158
% 0.15/0.45  % ...of these trivial                  : 0
% 0.15/0.45  % ...subsumed                          : 12
% 0.15/0.45  % ...remaining for further processing  : 146
% 0.15/0.45  % Other redundant clauses eliminated   : 3
% 0.15/0.45  % Clauses deleted for lack of memory   : 0
% 0.15/0.45  % Backward-subsumed                    : 0
% 0.15/0.45  % Backward-rewritten                   : 11
% 0.15/0.45  % Generated clauses                    : 153
% 0.15/0.45  % ...of the previous two non-redundant : 111
% 0.15/0.45  % ...aggressively subsumed             : 0
% 0.15/0.45  % Contextual simplify-reflections      : 1
% 0.15/0.45  % Paramodulations                      : 150
% 0.15/0.45  % Factorizations                       : 0
% 0.15/0.45  % NegExts                              : 0
% 0.15/0.45  % Equation resolutions                 : 3
% 0.15/0.45  % Disequality decompositions           : 0
% 0.15/0.45  % Total rewrite steps                  : 128
% 0.15/0.45  % ...of those cached                   : 113
% 0.15/0.45  % Propositional unsat checks           : 0
% 0.15/0.45  %    Propositional check models        : 0
% 0.15/0.45  %    Propositional check unsatisfiable : 0
% 0.15/0.45  %    Propositional clauses             : 0
% 0.15/0.45  %    Propositional clauses after purity: 0
% 0.15/0.45  %    Propositional unsat core size     : 0
% 0.15/0.45  %    Propositional preprocessing time  : 0.000
% 0.15/0.45  %    Propositional encoding time       : 0.000
% 0.15/0.45  %    Propositional solver time         : 0.000
% 0.15/0.45  %    Success case prop preproc time    : 0.000
% 0.15/0.45  %    Success case prop encoding time   : 0.000
% 0.15/0.45  %    Success case prop solver time     : 0.000
% 0.15/0.45  % Current number of processed clauses  : 102
% 0.15/0.45  %    Positive orientable unit clauses  : 16
% 0.15/0.45  %    Positive unorientable unit clauses: 0
% 0.15/0.45  %    Negative unit clauses             : 2
% 0.15/0.45  %    Non-unit-clauses                  : 84
% 0.15/0.45  % Current number of unprocessed clauses: 10
% 0.15/0.45  % ...number of literals in the above   : 28
% 0.15/0.45  % Current number of archived formulas  : 0
% 0.15/0.45  % Current number of archived clauses   : 41
% 0.15/0.45  % Clause-clause subsumption calls (NU) : 1245
% 0.15/0.45  % Rec. Clause-clause subsumption calls : 534
% 0.15/0.45  % Non-unit clause-clause subsumptions  : 13
% 0.15/0.45  % Unit Clause-clause subsumption calls : 16
% 0.15/0.45  % Rewrite failures with RHS unbound    : 0
% 0.15/0.45  % BW rewrite match attempts            : 29
% 0.15/0.45  % BW rewrite match successes           : 3
% 0.15/0.45  % Condensation attempts                : 0
% 0.15/0.45  % Condensation successes               : 0
% 0.15/0.45  % Termbank termtop insertions          : 5471
% 0.15/0.45  % Search garbage collected termcells   : 110
% 0.15/0.45  
% 0.15/0.45  % -------------------------------------------------
% 0.15/0.45  % User time                : 0.016 s
% 0.15/0.45  % System time              : 0.002 s
% 0.15/0.45  % Total time               : 0.018 s
% 0.15/0.45  % Maximum resident set size: 3664 pages
% 0.15/0.45  
% 0.15/0.45  % -------------------------------------------------
% 0.15/0.45  % User time                : 0.076 s
% 0.15/0.45  % System time              : 0.015 s
% 0.15/0.45  % Total time               : 0.091 s
% 0.15/0.45  % Maximum resident set size: 4864 pages
% 0.15/0.45  % E exiting
%------------------------------------------------------------------------------