%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT036+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:56 AM UTC 2026
% Result : Theorem 14.64s 4.10s
% Output : CNFRefutation 14.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 33 ( 16 unt; 0 nHn; 30 RR)
% Number of literals : 72 ( 0 equ; 43 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( subpopulations(X1,X2,X3,X4)
| ~ environment(X3)
| ~ subpopulations(X2,X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_1) ).
cnf(i_0_13,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_13) ).
cnf(i_0_14,negated_conjecture,
environment(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_14) ).
cnf(i_0_7,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ environment(X3)
| ~ outcompetes(X4,X1,X2)
| ~ subpopulations(X1,X4,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_7) ).
cnf(i_0_12,negated_conjecture,
outcompetes(first_movers,efficient_producers,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_12) ).
cnf(i_0_6,plain,
( environment(X1)
| ~ greater(zero,growth_rate(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_6) ).
cnf(i_0_8,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ environment(X3)
| ~ outcompetes(X1,X4,X2)
| ~ subpopulations(X4,X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_8) ).
cnf(i_0_11,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ environment(X3)
| ~ in_environment(X3,X2)
| ~ greater(zero,growth_rate(X4,X2))
| ~ greater(resilience(X4),resilience(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_11) ).
cnf(i_0_4,plain,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_4) ).
cnf(i_0_2,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_2) ).
cnf(i_0_10,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bjuvda89/input.p',i_0_10) ).
cnf(c_0_26,plain,
( subpopulations(X1,X2,X3,X4)
| ~ environment(X3)
| ~ subpopulations(X2,X1,X3,X4) ),
i_0_1 ).
cnf(c_0_27,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
i_0_13 ).
cnf(c_0_28,negated_conjecture,
environment(esk1_0),
i_0_14 ).
cnf(c_0_29,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ environment(X3)
| ~ outcompetes(X4,X1,X2)
| ~ subpopulations(X1,X4,X3,X2) ),
i_0_7 ).
cnf(c_0_30,negated_conjecture,
subpopulations(efficient_producers,first_movers,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
outcompetes(first_movers,efficient_producers,esk2_0),
i_0_12 ).
cnf(c_0_32,plain,
( environment(X1)
| ~ greater(zero,growth_rate(X2,X3)) ),
i_0_6 ).
cnf(c_0_33,hypothesis,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_28])]) ).
cnf(c_0_34,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ environment(X3)
| ~ outcompetes(X1,X4,X2)
| ~ subpopulations(X4,X1,X3,X2) ),
i_0_8 ).
cnf(c_0_35,plain,
environment(X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ environment(X3)
| ~ in_environment(X3,X2)
| ~ greater(zero,growth_rate(X4,X2))
| ~ greater(resilience(X4),resilience(X1)) ),
i_0_11 ).
cnf(c_0_37,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ subpopulations(X3,X1,X4,X2)
| ~ outcompetes(X1,X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_38,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ in_environment(X3,X2)
| ~ greater(zero,growth_rate(X4,X2))
| ~ greater(resilience(X4),resilience(X1)) ),
inference(csr,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_39,plain,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
i_0_4 ).
cnf(c_0_40,negated_conjecture,
greater_or_equal(growth_rate(first_movers,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_30]),c_0_31])]) ).
cnf(c_0_41,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
i_0_2 ).
cnf(c_0_42,hypothesis,
( greater(zero,growth_rate(X1,esk2_0))
| ~ in_environment(X2,esk2_0)
| ~ greater(resilience(efficient_producers),resilience(X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_43,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
i_0_10 ).
cnf(c_0_44,plain,
~ greater(zero,growth_rate(first_movers,esk2_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
in_environment(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_27]),c_0_28])]) ).
cnf(c_0_46,hypothesis,
~ in_environment(X1,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_45,c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT036+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 7 12:40:42 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.23/0.47 # ENIGMATIC: Selected complete mode:
% 14.64/4.10 # ENIGMATIC: Solved by autoschedule:
% 14.64/4.10 # No SInE strategy applied
% 14.64/4.10 # Trying AutoSched0 for 150 seconds
% 14.64/4.10 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S033N
% 14.64/4.10 # and selection function PSelectUnlessUniqMax.
% 14.64/4.10 #
% 14.64/4.10 # Preprocessing time : 0.023 s
% 14.64/4.10 # Presaturation interreduction done
% 14.64/4.10
% 14.64/4.10 # Proof found!
% 14.64/4.10 # SZS status Theorem
% 14.64/4.10 # SZS output start CNFRefutation
% See solution above
% 14.64/4.10 # Training examples: 0 positive, 0 negative
% 14.64/4.10
% 14.64/4.10 # -------------------------------------------------
% 14.64/4.10 # User time : 0.025 s
% 14.64/4.10 # System time : 0.005 s
% 14.64/4.10 # Total time : 0.030 s
% 14.64/4.10 # Maximum resident set size: 3328 pages
% 14.64/4.10
%------------------------------------------------------------------------------