%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT019+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:32 AM UTC 2026
% Result : CounterSatisfiable 15.94s 4.08s
% Output : Saturation 15.94s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| ~ greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_4) ).
cnf(i_0_5,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_5) ).
cnf(i_0_8,negated_conjecture,
( ~ in_environment(esk4_0,X1)
| ~ greater(growth_rate(efficient_producers,esk5_1(X1)),growth_rate(first_movers,esk5_1(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_8) ).
cnf(i_0_6,hypothesis,
( greater_or_equal(founding_rate(efficient_producers,X1),founding_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/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_6) ).
cnf(i_0_9,negated_conjecture,
( greater_or_equal(esk5_1(X1),X1)
| ~ in_environment(esk4_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_9) ).
cnf(i_0_1,plain,
~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_1) ).
cnf(i_0_7,hypothesis,
( in_environment(X1,esk3_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_7) ).
cnf(i_0_10,negated_conjecture,
( subpopulations(first_movers,efficient_producers,esk4_0,esk5_1(X1))
| ~ in_environment(esk4_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_10) ).
cnf(i_0_2,plain,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_2) ).
cnf(i_0_3,plain,
environment(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_3) ).
cnf(i_0_11,negated_conjecture,
stable(esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_11) ).
cnf(i_0_12,negated_conjecture,
environment(esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nnyrrdbj/input.p',i_0_12) ).
cnf(c_0_25,plain,
( greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))
| ~ greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1)) ),
i_0_4,
[final] ).
cnf(c_0_26,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
i_0_5,
[final] ).
cnf(c_0_27,negated_conjecture,
( ~ in_environment(esk4_0,X1)
| ~ greater(growth_rate(efficient_producers,esk5_1(X1)),growth_rate(first_movers,esk5_1(X1))) ),
i_0_8,
[final] ).
cnf(c_0_28,plain,
( disbanding_rate(efficient_producers,X1) = disbanding_rate(first_movers,X1)
| greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))
| ~ greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1))
| ~ greater_or_equal(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]),
[final] ).
cnf(c_0_29,hypothesis,
( greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1))
| ~ environment(X2)
| ~ stable(X2)
| ~ greater_or_equal(X1,esk3_1(X2))
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
i_0_6,
[final] ).
cnf(c_0_30,negated_conjecture,
( greater_or_equal(esk5_1(X1),X1)
| ~ in_environment(esk4_0,X1) ),
i_0_9,
[final] ).
cnf(c_0_31,negated_conjecture,
( disbanding_rate(efficient_producers,esk5_1(X1)) = disbanding_rate(first_movers,esk5_1(X1))
| ~ greater_or_equal(founding_rate(efficient_producers,esk5_1(X1)),founding_rate(first_movers,esk5_1(X1)))
| ~ greater_or_equal(disbanding_rate(first_movers,esk5_1(X1)),disbanding_rate(efficient_producers,esk5_1(X1)))
| ~ in_environment(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[final] ).
cnf(c_0_32,negated_conjecture,
( greater_or_equal(founding_rate(efficient_producers,esk5_1(esk3_1(X1))),founding_rate(first_movers,esk5_1(esk3_1(X1))))
| ~ in_environment(esk4_0,esk3_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,esk5_1(esk3_1(X1)))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]),
[final] ).
cnf(c_0_33,plain,
~ greater(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)),
i_0_1,
[final] ).
cnf(c_0_34,negated_conjecture,
( disbanding_rate(efficient_producers,esk5_1(esk3_1(X1))) = disbanding_rate(first_movers,esk5_1(esk3_1(X1)))
| ~ greater_or_equal(disbanding_rate(first_movers,esk5_1(esk3_1(X1))),disbanding_rate(efficient_producers,esk5_1(esk3_1(X1))))
| ~ in_environment(esk4_0,esk3_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,esk5_1(esk3_1(X1)))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]),
[final] ).
cnf(c_0_35,plain,
( growth_rate(efficient_producers,esk5_1(X1)) = growth_rate(first_movers,esk5_1(X1))
| ~ greater_or_equal(growth_rate(efficient_producers,esk5_1(X1)),growth_rate(first_movers,esk5_1(X1)))
| ~ in_environment(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_26]),
[final] ).
cnf(c_0_36,plain,
( disbanding_rate(efficient_producers,esk2_0) = disbanding_rate(first_movers,esk2_0)
| ~ greater_or_equal(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_26]),
[final] ).
cnf(c_0_37,hypothesis,
( in_environment(X1,esk3_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
i_0_7,
[final] ).
cnf(c_0_38,negated_conjecture,
( subpopulations(first_movers,efficient_producers,esk4_0,esk5_1(X1))
| ~ in_environment(esk4_0,X1) ),
i_0_10,
[final] ).
cnf(c_0_39,plain,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
i_0_2,
[final] ).
cnf(c_0_40,plain,
environment(esk1_0),
i_0_3,
[final] ).
cnf(c_0_41,negated_conjecture,
stable(esk4_0),
i_0_11,
[final] ).
cnf(c_0_42,negated_conjecture,
environment(esk4_0),
i_0_12,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT019+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.37 % Computer : n007.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 7 11:56:44 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.24/0.47 # ENIGMATIC: Selected complete mode:
% 15.94/4.08 # ENIGMATIC: Solved by autoschedule:
% 15.94/4.08 # No SInE strategy applied
% 15.94/4.08 # Trying AutoSched0 for 150 seconds
% 15.94/4.08 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 15.94/4.08 # and selection function SelectMaxLComplexAvoidPosPred.
% 15.94/4.08 #
% 15.94/4.08 # Preprocessing time : 0.024 s
% 15.94/4.08 # Presaturation interreduction done
% 15.94/4.08
% 15.94/4.08 # No proof found!
% 15.94/4.08 # SZS status Satisfiable
% 15.94/4.08 # SZS output start Saturation
% See solution above
% 15.94/4.08
% 15.94/4.08 # -------------------------------------------------
% 15.94/4.08 # User time : 0.025 s
% 15.94/4.08 # System time : 0.004 s
% 15.94/4.08 # Total time : 0.029 s
% 15.94/4.08 # Maximum resident set size: 3328 pages
% 15.94/4.08
%------------------------------------------------------------------------------