TSTP Solution File: MGT028+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : MGT028+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n024.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:06:20 EDT 2022

% Result   : Theorem 7.70s 2.38s
% Output   : CNFRefutation 7.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   42 (  12 unt;  12 nHn;  42 RR)
%            Number of literals    :  134 (   0 equ;  85 neg)
%            Maximal clause size   :    7 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ( greater_or_equal(esk1_2(X1,X2),X2)
    | greater(esk2_1(X1),appear(efficient_producers,X1))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ in_environment(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_4) ).

cnf(i_0_9,hypothesis,
    ( in_environment(X1,esk3_1(X1))
    | ~ environment(X1)
    | ~ stable(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_9) ).

cnf(i_0_6,plain,
    ( greater(esk2_1(X1),appear(efficient_producers,X1))
    | subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,X2))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ in_environment(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_6) ).

cnf(i_0_7,hypothesis,
    ( greater(zero,growth_rate(first_movers,X1))
    | ~ environment(X2)
    | ~ stable(X2)
    | ~ greater_or_equal(X1,esk3_1(X2))
    | ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_7) ).

cnf(i_0_13,negated_conjecture,
    stable(esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_13) ).

cnf(i_0_14,negated_conjecture,
    environment(esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_14) ).

cnf(i_0_2,plain,
    ( greater(esk2_1(X1),appear(efficient_producers,X1))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ in_environment(X1,X2)
    | ~ greater(zero,growth_rate(first_movers,esk1_2(X1,X2))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_2) ).

cnf(i_0_11,negated_conjecture,
    ( greater_or_equal(esk5_1(X1),X1)
    | ~ greater(X1,appear(efficient_producers,esk4_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_11) ).

cnf(i_0_12,negated_conjecture,
    ( subpopulations(first_movers,efficient_producers,esk4_0,esk5_1(X1))
    | ~ greater(X1,appear(efficient_producers,esk4_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_12) ).

cnf(i_0_10,negated_conjecture,
    ( ~ greater(X1,appear(efficient_producers,esk4_0))
    | ~ greater(zero,growth_rate(first_movers,esk5_1(X1))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_10) ).

cnf(i_0_3,plain,
    ( greater_or_equal(esk1_2(X1,X2),X2)
    | greater(zero,growth_rate(first_movers,X3))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ in_environment(X1,X2)
    | ~ greater_or_equal(X3,esk2_1(X1))
    | ~ subpopulations(first_movers,efficient_producers,X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_3) ).

cnf(i_0_1,plain,
    ( greater(zero,growth_rate(first_movers,X1))
    | ~ environment(X2)
    | ~ stable(X2)
    | ~ in_environment(X2,X3)
    | ~ greater_or_equal(X1,esk2_1(X2))
    | ~ subpopulations(first_movers,efficient_producers,X2,X1)
    | ~ greater(zero,growth_rate(first_movers,esk1_2(X2,X3))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_1) ).

cnf(i_0_5,plain,
    ( greater(zero,growth_rate(first_movers,X1))
    | subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X3))
    | ~ environment(X2)
    | ~ stable(X2)
    | ~ in_environment(X2,X3)
    | ~ greater_or_equal(X1,esk2_1(X2))
    | ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ap5q3mvj/input.p',i_0_5) ).

cnf(c_0_28,plain,
    ( greater_or_equal(esk1_2(X1,X2),X2)
    | greater(esk2_1(X1),appear(efficient_producers,X1))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ in_environment(X1,X2) ),
    i_0_4 ).

cnf(c_0_29,hypothesis,
    ( in_environment(X1,esk3_1(X1))
    | ~ environment(X1)
    | ~ stable(X1) ),
    i_0_9 ).

cnf(c_0_30,plain,
    ( greater(esk2_1(X1),appear(efficient_producers,X1))
    | subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,X2))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ in_environment(X1,X2) ),
    i_0_6 ).

cnf(c_0_31,hypothesis,
    ( greater(zero,growth_rate(first_movers,X1))
    | ~ environment(X2)
    | ~ stable(X2)
    | ~ greater_or_equal(X1,esk3_1(X2))
    | ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
    i_0_7 ).

cnf(c_0_32,hypothesis,
    ( greater(esk2_1(X1),appear(efficient_producers,X1))
    | greater_or_equal(esk1_2(X1,esk3_1(X1)),esk3_1(X1))
    | ~ stable(X1)
    | ~ environment(X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,hypothesis,
    ( subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,esk3_1(X1)))
    | greater(esk2_1(X1),appear(efficient_producers,X1))
    | ~ stable(X1)
    | ~ environment(X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_29]) ).

cnf(c_0_34,hypothesis,
    ( greater(zero,growth_rate(first_movers,esk1_2(X1,esk3_1(X1))))
    | greater(esk2_1(X1),appear(efficient_producers,X1))
    | ~ stable(X1)
    | ~ environment(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).

cnf(c_0_35,negated_conjecture,
    stable(esk4_0),
    i_0_13 ).

cnf(c_0_36,negated_conjecture,
    environment(esk4_0),
    i_0_14 ).

cnf(c_0_37,plain,
    ( greater(esk2_1(X1),appear(efficient_producers,X1))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ in_environment(X1,X2)
    | ~ greater(zero,growth_rate(first_movers,esk1_2(X1,X2))) ),
    i_0_2 ).

cnf(c_0_38,negated_conjecture,
    ( greater(zero,growth_rate(first_movers,esk1_2(esk4_0,esk3_1(esk4_0))))
    | greater(esk2_1(esk4_0),appear(efficient_producers,esk4_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).

cnf(c_0_39,plain,
    ( greater(esk2_1(esk4_0),appear(efficient_producers,esk4_0))
    | ~ in_environment(esk4_0,esk3_1(esk4_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35]),c_0_36])]) ).

cnf(c_0_40,negated_conjecture,
    ( greater_or_equal(esk5_1(X1),X1)
    | ~ greater(X1,appear(efficient_producers,esk4_0)) ),
    i_0_11 ).

cnf(c_0_41,hypothesis,
    greater(esk2_1(esk4_0),appear(efficient_producers,esk4_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_35]),c_0_36])]) ).

cnf(c_0_42,negated_conjecture,
    ( subpopulations(first_movers,efficient_producers,esk4_0,esk5_1(X1))
    | ~ greater(X1,appear(efficient_producers,esk4_0)) ),
    i_0_12 ).

cnf(c_0_43,negated_conjecture,
    ( ~ greater(X1,appear(efficient_producers,esk4_0))
    | ~ greater(zero,growth_rate(first_movers,esk5_1(X1))) ),
    i_0_10 ).

cnf(c_0_44,plain,
    ( greater_or_equal(esk1_2(X1,X2),X2)
    | greater(zero,growth_rate(first_movers,X3))
    | ~ environment(X1)
    | ~ stable(X1)
    | ~ in_environment(X1,X2)
    | ~ greater_or_equal(X3,esk2_1(X1))
    | ~ subpopulations(first_movers,efficient_producers,X1,X3) ),
    i_0_3 ).

cnf(c_0_45,negated_conjecture,
    greater_or_equal(esk5_1(esk2_1(esk4_0)),esk2_1(esk4_0)),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_46,negated_conjecture,
    subpopulations(first_movers,efficient_producers,esk4_0,esk5_1(esk2_1(esk4_0))),
    inference(spm,[status(thm)],[c_0_42,c_0_41]) ).

cnf(c_0_47,negated_conjecture,
    ~ greater(zero,growth_rate(first_movers,esk5_1(esk2_1(esk4_0)))),
    inference(spm,[status(thm)],[c_0_43,c_0_41]) ).

cnf(c_0_48,plain,
    ( greater(zero,growth_rate(first_movers,X1))
    | ~ environment(X2)
    | ~ stable(X2)
    | ~ in_environment(X2,X3)
    | ~ greater_or_equal(X1,esk2_1(X2))
    | ~ subpopulations(first_movers,efficient_producers,X2,X1)
    | ~ greater(zero,growth_rate(first_movers,esk1_2(X2,X3))) ),
    i_0_1 ).

cnf(c_0_49,plain,
    ( greater(zero,growth_rate(first_movers,X1))
    | subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X3))
    | ~ environment(X2)
    | ~ stable(X2)
    | ~ in_environment(X2,X3)
    | ~ greater_or_equal(X1,esk2_1(X2))
    | ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
    i_0_5 ).

cnf(c_0_50,plain,
    ( greater_or_equal(esk1_2(esk4_0,X1),X1)
    | ~ in_environment(esk4_0,X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_35]),c_0_36])]),c_0_47]) ).

cnf(c_0_51,plain,
    ( ~ greater(zero,growth_rate(first_movers,esk1_2(esk4_0,X1)))
    | ~ in_environment(esk4_0,X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_45]),c_0_46]),c_0_35]),c_0_36])]),c_0_47]) ).

cnf(c_0_52,plain,
    ( subpopulations(first_movers,efficient_producers,esk4_0,esk1_2(esk4_0,X1))
    | ~ in_environment(esk4_0,X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_46]),c_0_35]),c_0_36])]),c_0_47]) ).

cnf(c_0_53,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_50,c_0_29]),c_0_35]),c_0_36])]) ).

cnf(c_0_54,hypothesis,
    ~ greater(zero,growth_rate(first_movers,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_51,c_0_29]),c_0_35]),c_0_36])]) ).

cnf(c_0_55,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_52,c_0_29]),c_0_35]),c_0_36])]) ).

cnf(c_0_56,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_53]),c_0_35]),c_0_36])]),c_0_54]),c_0_55])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : MGT028+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n024.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 09:36:21 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.70/2.38  # ENIGMATIC: Solved by autoschedule:
% 7.70/2.38  # No SInE strategy applied
% 7.70/2.38  # Trying AutoSched0 for 150 seconds
% 7.70/2.38  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 7.70/2.38  # and selection function SelectNewComplexAHP.
% 7.70/2.38  #
% 7.70/2.38  # Preprocessing time       : 0.024 s
% 7.70/2.38  # Presaturation interreduction done
% 7.70/2.38  
% 7.70/2.38  # Proof found!
% 7.70/2.38  # SZS status Theorem
% 7.70/2.38  # SZS output start CNFRefutation
% See solution above
% 7.70/2.38  # Training examples: 0 positive, 0 negative
% 7.70/2.38  
% 7.70/2.38  # -------------------------------------------------
% 7.70/2.38  # User time                : 0.025 s
% 7.70/2.38  # System time              : 0.008 s
% 7.70/2.38  # Total time               : 0.034 s
% 7.70/2.38  # Maximum resident set size: 7120 pages
% 7.70/2.38  
%------------------------------------------------------------------------------