%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT032+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 : Tue Sep 8 06:07:45 AM UTC 2026
% Result : Theorem 13.31s 3.89s
% Output : CNFRefutation 13.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 10 unt; 0 nHn; 23 RR)
% Number of literals : 49 ( 0 equ; 28 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,hypothesis,
( in_environment(X1,esk1_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yz6dg7k9/lgb.p',i_0_3) ).
cnf(i_0_7,negated_conjecture,
stable(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yz6dg7k9/lgb.p',i_0_7) ).
cnf(i_0_8,negated_conjecture,
environment(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yz6dg7k9/lgb.p',i_0_8) ).
cnf(i_0_6,negated_conjecture,
( subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X1))
| ~ in_environment(esk2_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yz6dg7k9/lgb.p',i_0_6) ).
cnf(i_0_5,negated_conjecture,
( greater_or_equal(esk3_1(X1),X1)
| ~ in_environment(esk2_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yz6dg7k9/lgb.p',i_0_5) ).
cnf(i_0_2,hypothesis,
( greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ stable(X2)
| ~ greater_or_equal(X1,esk1_1(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yz6dg7k9/lgb.p',i_0_2) ).
cnf(i_0_1,plain,
( selection_favors(X1,X2,X3)
| ~ environment(X4)
| ~ subpopulations(X2,X1,X4,X3)
| ~ greater(growth_rate(X1,X3),growth_rate(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yz6dg7k9/lgb.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
( ~ in_environment(esk2_0,X1)
| ~ selection_favors(efficient_producers,first_movers,esk3_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yz6dg7k9/lgb.p',i_0_4) ).
cnf(c_0_17,hypothesis,
( in_environment(X1,esk1_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
i_0_3 ).
cnf(c_0_18,negated_conjecture,
stable(esk2_0),
i_0_7 ).
cnf(c_0_19,negated_conjecture,
environment(esk2_0),
i_0_8 ).
cnf(c_0_20,negated_conjecture,
( subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X1))
| ~ in_environment(esk2_0,X1) ),
i_0_6 ).
cnf(c_0_21,negated_conjecture,
in_environment(esk2_0,esk1_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
( greater_or_equal(esk3_1(X1),X1)
| ~ in_environment(esk2_0,X1) ),
i_0_5 ).
cnf(c_0_23,hypothesis,
( greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ environment(X2)
| ~ stable(X2)
| ~ greater_or_equal(X1,esk1_1(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
i_0_2 ).
cnf(c_0_24,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(esk1_1(esk2_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
greater_or_equal(esk3_1(esk1_1(esk2_0)),esk1_1(esk2_0)),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,plain,
( selection_favors(X1,X2,X3)
| ~ environment(X4)
| ~ subpopulations(X2,X1,X4,X3)
| ~ greater(growth_rate(X1,X3),growth_rate(X2,X3)) ),
i_0_1 ).
cnf(c_0_27,hypothesis,
greater(growth_rate(efficient_producers,esk3_1(esk1_1(esk2_0))),growth_rate(first_movers,esk3_1(esk1_1(esk2_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]),c_0_19]),c_0_25])]) ).
cnf(c_0_28,plain,
( selection_favors(efficient_producers,first_movers,esk3_1(esk1_1(esk2_0)))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,esk3_1(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( ~ in_environment(esk2_0,X1)
| ~ selection_favors(efficient_producers,first_movers,esk3_1(X1)) ),
i_0_4 ).
cnf(c_0_30,negated_conjecture,
selection_favors(efficient_producers,first_movers,esk3_1(esk1_1(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_19])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT032+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.36 % Computer : n010.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 7 12:22:15 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.41 # ENIGMATIC: Selected complete mode:
% 13.31/3.89 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.31/3.89 # No SInE strategy applied
% 13.31/3.89 # Trying AutoSched0 for 150 seconds
% 13.31/3.89 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S031N
% 13.31/3.89 # and selection function PSelectStrongRRNonRROptimalLit.
% 13.31/3.89 #
% 13.31/3.89 # Preprocessing time : 0.012 s
% 13.31/3.89 # Presaturation interreduction done
% 13.31/3.89
% 13.31/3.89 # Proof found!
% 13.31/3.89 # SZS status Theorem
% 13.31/3.89 # SZS output start CNFRefutation
% See solution above
% 13.31/3.89 # Training examples: 0 positive, 0 negative
% 13.31/3.89
% 13.31/3.89 # -------------------------------------------------
% 13.31/3.89 # User time : 0.013 s
% 13.31/3.89 # System time : 0.002 s
% 13.31/3.89 # Total time : 0.015 s
% 13.31/3.89 # Maximum resident set size: 3328 pages
% 13.31/3.89
%------------------------------------------------------------------------------