↑ Up

E---3.5.1.SAT-Sat.s

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

% Computer : n017.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   : Satisfiable 0.14s 0.45s
% Output   : Saturation 0.14s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_34ERROR: Could not build tree for root c_0_40ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_30,plain,
    ( ~ in_environment(X1,critical_point(X1))
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,critical_point(X1)) ),
    c_0_28,
    [final] ).

cnf(c_0_31,negated_conjecture,
    in_environment(sk1,critical_point(sk1)),
    prove_t3_55,
    [final] ).

cnf(c_0_32,negated_conjecture,
    environment(sk1),
    prove_t3_54,
    [final] ).

cnf(c_0_35,hypothesis,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | decreases(difference(founding_rate(first_movers,X2),founding_rate(efficient_producers,X2))) ),
    c_0_29,
    [final] ).

cnf(c_0_36,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_30,c_0_31]),c_0_32])]),
    [final] ).

cnf(c_0_38,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_33,
    [final] ).

cnf(c_0_40,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_34,
    [final] ).

cnf(c_0_41,negated_conjecture,
    decreases(difference(founding_rate(first_movers,critical_point(sk1)),founding_rate(efficient_producers,critical_point(sk1)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32])]),
    [final] ).

cnf(c_0_43,plain,
    ( ~ greater_or_equal(X1,X2)
    | X1 = X2
    | greater(X1,X2) ),
    c_0_37,
    [final] ).

cnf(c_0_44,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_38,c_0_36]),c_0_32])]),
    [final] ).

cnf(c_0_45,plain,
    ( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
    | ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1) ),
    c_0_39,
    [final] ).

cnf(c_0_48,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_42,
    [final] ).

cnf(c_0_49,negated_conjecture,
    ( greater(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero)
    | greater(zero,difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))))
    | difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))) = zero ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]),
    [final] ).

cnf(c_0_51,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_47,
    [final] ).

cnf(c_0_52,negated_conjecture,
    ( greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))
    | greater(zero,difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))))
    | difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))) = zero ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]),
    [final] ).

cnf(c_0_55,negated_conjecture,
    decreases(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_36]),c_0_32])]),
    [final] ).

cnf(c_0_56,negated_conjecture,
    ( greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1)))
    | greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))
    | difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))) = zero ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]),
    [final] ).

cnf(c_0_58,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | subpopulations(efficient_producers,first_movers,X1,X2) ),
    c_0_53,
    [final] ).

cnf(c_0_63,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_54,
    [final] ).

cnf(c_0_64,negated_conjecture,
    ( greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))
    | greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1)))
    | decreases(zero) ),
    inference(spm,[status(thm)],[c_0_55,c_0_56]),
    [final] ).

cnf(c_0_65,negated_conjecture,
    ( ~ greater(zero,zero)
    | greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1)))
    | greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))) ),
    inference(spm,[status(thm)],[c_0_51,c_0_56]),
    [final] ).

cnf(c_0_68,plain,
    ( ~ greater(growth_rate(X3,X4),growth_rate(X2,X4))
    | ~ subpopulations(X2,X3,X1,X4)
    | ~ environment(X1)
    | selection_favors(X3,X2,X4) ),
    c_0_57,
    [final] ).

cnf(c_0_69,negated_conjecture,
    subpopulations(efficient_producers,first_movers,sk1,critical_point(sk1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_36]),c_0_32])]),
    [final] ).

cnf(c_0_70,plain,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X2)
    | ~ environment(X1)
    | greater_or_equal(X2,appear(efficient_producers,X1)) ),
    c_0_59,
    [final] ).

cnf(c_0_71,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_60,
    [final] ).

cnf(c_0_73,plain,
    ( ~ greater_or_equal(X4,X2)
    | ~ greater_or_equal(X3,X4)
    | ~ in_environment(X1,X3)
    | ~ in_environment(X1,X2)
    | ~ environment(X1)
    | in_environment(X1,X4) ),
    c_0_61,
    [final] ).

cnf(c_0_74,plain,
    ( ~ environment(X1)
    | in_environment(X1,start_time(X1)) ),
    c_0_62,
    [final] ).

cnf(c_0_77,negated_conjecture,
    ( ~ environment(X2)
    | ~ greater(X1,critical_point(sk1))
    | ~ in_environment(X2,X1)
    | ~ greater_or_equal(critical_point(sk1),appear(efficient_producers,X2))
    | ~ greater_or_equal(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)
    | greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))
    | greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1))) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_56]),c_0_64]),c_0_65]),
    [final] ).

cnf(c_0_78,plain,
    ( ~ greater(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1))
    | greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero) ),
    c_0_66,
    [final] ).

cnf(c_0_80,negated_conjecture,
    ( ~ greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))
    | selection_favors(first_movers,efficient_producers,critical_point(sk1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_32])]),
    [final] ).

cnf(c_0_81,negated_conjecture,
    ( ~ environment(X2)
    | ~ greater(X1,critical_point(sk1))
    | ~ in_environment(X2,X1)
    | ~ greater_or_equal(critical_point(sk1),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,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero) ),
    inference(spm,[status(thm)],[c_0_63,c_0_55]),
    [final] ).

cnf(c_0_82,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_70,c_0_36]),c_0_32])]),
    [final] ).

cnf(c_0_83,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_71,c_0_36]),c_0_32])]),
    [final] ).

cnf(c_0_84,plain,
    ( ~ greater(X1,X2)
    | greater_or_equal(X1,X2) ),
    c_0_72,
    [final] ).

cnf(c_0_85,negated_conjecture,
    greater(critical_point(sk1),sk2),
    prove_t3_57,
    [final] ).

cnf(c_0_87,plain,
    ( ~ environment(X1)
    | ~ in_environment(X1,X3)
    | ~ greater_or_equal(X2,X3)
    | ~ greater_or_equal(start_time(X1),X2)
    | in_environment(X1,X2) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]),
    [final] ).

cnf(c_0_89,negated_conjecture,
    ( ~ in_environment(sk1,X2)
    | ~ greater_or_equal(X1,X2)
    | ~ greater_or_equal(critical_point(sk1),X1)
    | in_environment(sk1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_31]),c_0_32])]),
    [final] ).

cnf(c_0_91,negated_conjecture,
    ( ~ environment(X1)
    | ~ greater(start_time(X1),critical_point(sk1))
    | ~ greater_or_equal(critical_point(sk1),appear(efficient_producers,X1))
    | ~ greater_or_equal(difference(growth_rate(first_movers,start_time(X1)),growth_rate(efficient_producers,start_time(X1))),zero)
    | greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1)))
    | greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))) ),
    inference(spm,[status(thm)],[c_0_77,c_0_74]),
    [final] ).

cnf(c_0_92,negated_conjecture,
    ( greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1)))
    | greater(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero)
    | decreases(zero) ),
    inference(spm,[status(thm)],[c_0_78,c_0_64]),
    [final] ).

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

cnf(c_0_95,negated_conjecture,
    ( ~ environment(X1)
    | ~ greater(start_time(X1),critical_point(sk1))
    | ~ greater_or_equal(critical_point(sk1),appear(efficient_producers,X1))
    | ~ greater_or_equal(difference(growth_rate(first_movers,start_time(X1)),growth_rate(efficient_producers,start_time(X1))),zero)
    | greater(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero) ),
    inference(spm,[status(thm)],[c_0_81,c_0_74]),
    [final] ).

cnf(c_0_96,negated_conjecture,
    ( ~ greater(critical_point(sk1),critical_point(sk1))
    | ~ 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,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_31]),c_0_82]),c_0_32])]),
    [final] ).

cnf(c_0_97,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_83,c_0_36]),
    [final] ).

cnf(c_0_98,negated_conjecture,
    greater_or_equal(critical_point(sk1),sk2),
    inference(spm,[status(thm)],[c_0_84,c_0_85]),
    [final] ).

cnf(c_0_99,plain,
    ( ~ environment(X1)
    | greater_or_equal(appear(first_movers,X1),start_time(X1)) ),
    c_0_86,
    [final] ).

cnf(c_0_100,negated_conjecture,
    ( ~ greater_or_equal(X1,critical_point(sk1))
    | ~ greater_or_equal(start_time(sk1),X1)
    | in_environment(sk1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_31]),c_0_32])]),
    [final] ).

cnf(c_0_101,plain,
    greater_or_equal(X1,X1),
    inference(er,[status(thm)],[c_0_88]),
    [final] ).

cnf(c_0_102,negated_conjecture,
    ( ~ greater_or_equal(X1,start_time(sk1))
    | ~ greater_or_equal(critical_point(sk1),X1)
    | in_environment(sk1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_74]),c_0_32])]),
    [final] ).

cnf(c_0_103,hypothesis,
    ( ~ environment(X2)
    | ~ subpopulations(first_movers,efficient_producers,X2,X1)
    | ~ greater(X1,critical_point(X2))
    | greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
    inference(er,[status(thm)],[c_0_90]),
    [final] ).

cnf(c_0_104,negated_conjecture,
    ( ~ greater_or_equal(X1,critical_point(sk1))
    | ~ greater_or_equal(critical_point(sk1),X1)
    | in_environment(sk1,X1) ),
    inference(spm,[status(thm)],[c_0_89,c_0_31]),
    [final] ).

cnf(c_0_107,negated_conjecture,
    greater_or_equal(sk2,appear(efficient_producers,sk1)),
    prove_t3_56,
    [final] ).

cnf(c_0_109,negated_conjecture,
    ( ~ greater(start_time(sk1),critical_point(sk1))
    | ~ greater_or_equal(difference(growth_rate(first_movers,start_time(sk1)),growth_rate(efficient_producers,start_time(sk1))),zero)
    | greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))
    | greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_82]),c_0_32])]),
    [final] ).

cnf(c_0_110,negated_conjecture,
    ( greater(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))
    | greater_or_equal(zero,difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))))
    | difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))) = zero ),
    inference(spm,[status(thm)],[c_0_84,c_0_52]),
    [final] ).

cnf(c_0_111,negated_conjecture,
    ( greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1)))
    | decreases(zero)
    | greater_or_equal(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero) ),
    inference(spm,[status(thm)],[c_0_84,c_0_92]),
    [final] ).

cnf(c_0_112,negated_conjecture,
    ( greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1)))
    | decreases(zero)
    | greater_or_equal(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))) ),
    inference(spm,[status(thm)],[c_0_84,c_0_64]),
    [final] ).

cnf(c_0_113,hypothesis,
    ( selection_favors(first_movers,efficient_producers,critical_point(sk1))
    | decreases(zero) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_32])]),
    [final] ).

cnf(c_0_114,negated_conjecture,
    ( ~ greater(start_time(sk1),critical_point(sk1))
    | ~ greater_or_equal(difference(growth_rate(first_movers,start_time(sk1)),growth_rate(efficient_producers,start_time(sk1))),zero)
    | greater(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_95,c_0_82]),c_0_32])]),
    [final] ).

cnf(c_0_115,negated_conjecture,
    ( ~ greater(critical_point(sk1),critical_point(sk1))
    | greater(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero)
    | greater(zero,difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))) ),
    inference(spm,[status(thm)],[c_0_96,c_0_44]),
    [final] ).

cnf(c_0_116,negated_conjecture,
    ( ~ greater_or_equal(appear(efficient_producers,sk1),critical_point(sk1))
    | subpopulations(first_movers,efficient_producers,sk1,appear(efficient_producers,sk1)) ),
    inference(spm,[status(thm)],[c_0_97,c_0_82]),
    [final] ).

cnf(c_0_117,negated_conjecture,
    ( ~ greater_or_equal(sk2,critical_point(sk1))
    | subpopulations(first_movers,efficient_producers,sk1,sk2) ),
    inference(spm,[status(thm)],[c_0_97,c_0_98]),
    [final] ).

cnf(c_0_118,plain,
    ( ~ environment(X1)
    | greater(appear(first_movers,X1),start_time(X1))
    | start_time(X1) = appear(first_movers,X1) ),
    inference(spm,[status(thm)],[c_0_43,c_0_99]),
    [final] ).

cnf(c_0_119,negated_conjecture,
    ( ~ greater_or_equal(start_time(sk1),critical_point(sk1))
    | in_environment(sk1,start_time(sk1)) ),
    inference(spm,[status(thm)],[c_0_100,c_0_101]),
    [final] ).

cnf(c_0_120,negated_conjecture,
    ( ~ greater_or_equal(appear(efficient_producers,sk1),start_time(sk1))
    | in_environment(sk1,appear(efficient_producers,sk1)) ),
    inference(spm,[status(thm)],[c_0_102,c_0_82]),
    [final] ).

cnf(c_0_121,plain,
    ( ~ environment(X1)
    | ~ greater_or_equal(X2,start_time(X1))
    | ~ greater_or_equal(start_time(X1),X2)
    | in_environment(X1,X2) ),
    inference(spm,[status(thm)],[c_0_87,c_0_74]),
    [final] ).

cnf(c_0_122,negated_conjecture,
    ( ~ greater_or_equal(sk2,start_time(sk1))
    | in_environment(sk1,sk2) ),
    inference(spm,[status(thm)],[c_0_102,c_0_98]),
    [final] ).

cnf(c_0_123,negated_conjecture,
    ( ~ greater(critical_point(sk1),critical_point(sk1))
    | greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_36]),c_0_32])]),
    [final] ).

cnf(c_0_124,negated_conjecture,
    ( ~ greater_or_equal(appear(efficient_producers,sk1),critical_point(sk1))
    | in_environment(sk1,appear(efficient_producers,sk1)) ),
    inference(spm,[status(thm)],[c_0_104,c_0_82]),
    [final] ).

cnf(c_0_125,negated_conjecture,
    ( ~ greater_or_equal(sk2,critical_point(sk1))
    | in_environment(sk1,sk2) ),
    inference(spm,[status(thm)],[c_0_104,c_0_98]),
    [final] ).

cnf(c_0_126,plain,
    ( ~ greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
    | greater(zero,difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1))) ),
    c_0_105,
    [final] ).

cnf(c_0_127,negated_conjecture,
    ( ~ greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1)))
    | selection_favors(efficient_producers,first_movers,critical_point(sk1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_36]),c_0_32])]),
    [final] ).

cnf(c_0_128,negated_conjecture,
    ( greater(critical_point(sk1),appear(efficient_producers,sk1))
    | appear(efficient_producers,sk1) = critical_point(sk1) ),
    inference(spm,[status(thm)],[c_0_43,c_0_82]),
    [final] ).

cnf(c_0_129,plain,
    ( ~ in_environment(X1,appear(efficient_producers,X1))
    | ~ environment(X1)
    | subpopulations(first_movers,efficient_producers,X1,appear(efficient_producers,X1)) ),
    c_0_106,
    [final] ).

cnf(c_0_130,negated_conjecture,
    ( greater(sk2,appear(efficient_producers,sk1))
    | appear(efficient_producers,sk1) = sk2 ),
    inference(spm,[status(thm)],[c_0_43,c_0_107]),
    [final] ).

cnf(c_0_131,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sk2),
    c_0_108,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT034-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 01:17:11 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  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.14/0.45  % Version: 3.5.1
% 0.14/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45  % Starting sh5l with 300s (1) cores
% 0.14/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1113170 completed with status 1
% 0.14/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45  % No SInE strategy applied
% 0.14/0.45  % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.14/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.45  % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.14/0.45  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.45  % new_bool_3 with pid 1113182 completed with status 1
% 0.14/0.45  % Result found by new_bool_3
% 0.14/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45  % No SInE strategy applied
% 0.14/0.45  % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.14/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.45  % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.14/0.45  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.45  % Preprocessing time       : 0.002 s
% 0.14/0.45  % Presaturation interreduction done
% 0.14/0.45  
% 0.14/0.45  % No proof found!
% 0.14/0.45  % SZS status Satisfiable
% 0.14/0.45  % SZS output start Saturation
% See solution above
% 0.14/0.45  % Parsed axioms                        : 28
% 0.14/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.45  % Initial clauses                      : 28
% 0.14/0.45  % Removed in clause preprocessing      : 0
% 0.14/0.45  % Initial clauses in saturation        : 28
% 0.14/0.45  % Processed clauses                    : 120
% 0.14/0.45  % ...of these trivial                  : 0
% 0.14/0.45  % ...subsumed                          : 12
% 0.14/0.45  % ...remaining for further processing  : 108
% 0.14/0.45  % Other redundant clauses eliminated   : 3
% 0.14/0.45  % Clauses deleted for lack of memory   : 0
% 0.14/0.45  % Backward-subsumed                    : 1
% 0.14/0.45  % Backward-rewritten                   : 2
% 0.14/0.45  % Generated clauses                    : 75
% 0.14/0.45  % ...of the previous two non-redundant : 67
% 0.14/0.45  % ...aggressively subsumed             : 0
% 0.14/0.45  % Contextual simplify-reflections      : 2
% 0.14/0.45  % Paramodulations                      : 72
% 0.14/0.45  % Factorizations                       : 0
% 0.14/0.45  % NegExts                              : 0
% 0.14/0.45  % Equation resolutions                 : 3
% 0.14/0.45  % Disequality decompositions           : 0
% 0.14/0.45  % Total rewrite steps                  : 34
% 0.14/0.45  % ...of those cached                   : 24
% 0.14/0.45  % Propositional unsat checks           : 0
% 0.14/0.45  %    Propositional check models        : 0
% 0.14/0.45  %    Propositional check unsatisfiable : 0
% 0.14/0.45  %    Propositional clauses             : 0
% 0.14/0.45  %    Propositional clauses after purity: 0
% 0.14/0.45  %    Propositional unsat core size     : 0
% 0.14/0.45  %    Propositional preprocessing time  : 0.000
% 0.14/0.45  %    Propositional encoding time       : 0.000
% 0.14/0.45  %    Propositional solver time         : 0.000
% 0.14/0.45  %    Success case prop preproc time    : 0.000
% 0.14/0.45  %    Success case prop encoding time   : 0.000
% 0.14/0.45  %    Success case prop solver time     : 0.000
% 0.14/0.45  % Current number of processed clauses  : 74
% 0.14/0.45  %    Positive orientable unit clauses  : 11
% 0.14/0.45  %    Positive unorientable unit clauses: 0
% 0.14/0.45  %    Negative unit clauses             : 1
% 0.14/0.45  %    Non-unit-clauses                  : 62
% 0.14/0.45  % Current number of unprocessed clauses: 0
% 0.14/0.45  % ...number of literals in the above   : 0
% 0.14/0.45  % Current number of archived formulas  : 0
% 0.14/0.45  % Current number of archived clauses   : 31
% 0.14/0.45  % Clause-clause subsumption calls (NU) : 1819
% 0.14/0.45  % Rec. Clause-clause subsumption calls : 746
% 0.14/0.45  % Non-unit clause-clause subsumptions  : 15
% 0.14/0.45  % Unit Clause-clause subsumption calls : 1
% 0.14/0.45  % Rewrite failures with RHS unbound    : 0
% 0.14/0.45  % BW rewrite match attempts            : 9
% 0.14/0.45  % BW rewrite match successes           : 1
% 0.14/0.45  % Condensation attempts                : 0
% 0.14/0.45  % Condensation successes               : 0
% 0.14/0.45  % Termbank termtop insertions          : 3635
% 0.14/0.45  % Search garbage collected termcells   : 97
% 0.14/0.45  
% 0.14/0.45  % -------------------------------------------------
% 0.14/0.45  % User time                : 0.011 s
% 0.14/0.45  % System time              : 0.004 s
% 0.14/0.45  % Total time               : 0.015 s
% 0.14/0.45  % Maximum resident set size: 3660 pages
% 0.14/0.45  
% 0.14/0.45  % -------------------------------------------------
% 0.14/0.45  % User time                : 0.060 s
% 0.14/0.45  % System time              : 0.017 s
% 0.14/0.45  % Total time               : 0.077 s
% 0.14/0.45  % Maximum resident set size: 4608 pages
% 0.14/0.45  % E exiting
%------------------------------------------------------------------------------