%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT040+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:57 AM UTC 2026
% Result : CounterSatisfiable 16.82s 5.51s
% Output : Saturation 16.82s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( extreme(X1)
| ~ observational_period(X1)
| ~ environment(X2)
| ~ empty(X2)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_5) ).
cnf(i_0_8,plain,
( in_environment(X1,end_time(X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_8) ).
cnf(i_0_20,negated_conjecture,
~ extreme(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_20) ).
cnf(i_0_22,negated_conjecture,
observational_period(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_22) ).
cnf(i_0_10,plain,
( empty(X1)
| greater_or_equal(end_time(X1),appear(an_organisation,X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_10) ).
cnf(i_0_1,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_1) ).
cnf(i_0_6,plain,
propagation_strategy(first_movers),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_6) ).
cnf(i_0_7,plain,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_7) ).
cnf(i_0_2,plain,
( in_environment(X1,esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_2) ).
cnf(i_0_3,plain,
( environment(esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_3) ).
cnf(i_0_11,plain,
( in_environment(X1,appear(an_organisation,X1))
| ~ environment(X1)
| ~ greater_or_equal(end_time(X1),appear(an_organisation,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_11) ).
cnf(i_0_13,plain,
( in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| ~ environment(X1)
| ~ greater(critical_point(X1),X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_13) ).
cnf(i_0_17,hypothesis,
( selection_favors(first_movers,efficient_producers,X1)
| ~ environment(X2)
| ~ in_environment(X2,critical_point(X2))
| ~ greater(critical_point(X2),X1)
| ~ greater_or_equal(X1,appear(efficient_producers,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_17) ).
cnf(i_0_16,hypothesis,
( selection_favors(first_movers,efficient_producers,X1)
| ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater_or_equal(X1,appear(first_movers,X2))
| ~ greater(appear(efficient_producers,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_16) ).
cnf(i_0_4,plain,
( ~ observational_period(X1)
| ~ environment(X2)
| ~ rapid_change(X1)
| ~ in_environment(X1,X2)
| ~ in_environment(X2,critical_point(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_4) ).
cnf(i_0_18,hypothesis,
( appear(an_organisation,X1) = appear(first_movers,X1)
| ~ environment(X1)
| ~ in_environment(X1,appear(an_organisation,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_18) ).
cnf(i_0_9,plain,
( in_environment(X1,critical_point(X1))
| greater(critical_point(X1),end_time(X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_9) ).
cnf(i_0_15,plain,
( greater_or_equal(X1,appear(efficient_producers,X2))
| greater(appear(efficient_producers,X2),X1)
| ~ in_environment(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_15) ).
cnf(i_0_14,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_14) ).
cnf(i_0_19,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_19) ).
cnf(i_0_21,negated_conjecture,
rapid_change(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-08ltxvt7/input.p',i_0_21) ).
cnf(c_0_44,plain,
( extreme(X1)
| ~ observational_period(X1)
| ~ environment(X2)
| ~ empty(X2)
| ~ in_environment(X1,X2) ),
i_0_5,
[final] ).
cnf(c_0_45,plain,
( in_environment(X1,end_time(X1))
| ~ environment(X1) ),
i_0_8,
[final] ).
cnf(c_0_46,negated_conjecture,
~ extreme(esk2_0),
i_0_20,
[final] ).
cnf(c_0_47,plain,
( extreme(X1)
| ~ empty(end_time(X1))
| ~ environment(end_time(X1))
| ~ environment(X1)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]),
[final] ).
cnf(c_0_48,negated_conjecture,
observational_period(esk2_0),
i_0_22,
[final] ).
cnf(c_0_49,negated_conjecture,
( ~ empty(end_time(esk2_0))
| ~ environment(end_time(esk2_0))
| ~ environment(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),
[final] ).
cnf(c_0_50,plain,
( empty(X1)
| greater_or_equal(end_time(X1),appear(an_organisation,X1))
| ~ environment(X1) ),
i_0_10,
[final] ).
cnf(c_0_51,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1))) ),
i_0_1 ).
cnf(c_0_52,plain,
propagation_strategy(first_movers),
i_0_6,
[final] ).
cnf(c_0_53,plain,
propagation_strategy(efficient_producers),
i_0_7,
[final] ).
cnf(c_0_54,plain,
( in_environment(X1,esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
i_0_2 ).
cnf(c_0_55,plain,
( environment(esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
i_0_3 ).
cnf(c_0_56,plain,
( in_environment(X1,appear(an_organisation,X1))
| ~ environment(X1)
| ~ greater_or_equal(end_time(X1),appear(an_organisation,X1)) ),
i_0_11,
[final] ).
cnf(c_0_57,plain,
( greater_or_equal(end_time(end_time(esk2_0)),appear(an_organisation,end_time(esk2_0)))
| ~ environment(end_time(esk2_0))
| ~ environment(esk2_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]),
[final] ).
cnf(c_0_58,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(X1)))
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),
[final] ).
cnf(c_0_59,plain,
( in_environment(X1,esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_52]),c_0_53])]),
[final] ).
cnf(c_0_60,plain,
( environment(esk1_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_52]),c_0_53])]),
[final] ).
cnf(c_0_61,plain,
( in_environment(end_time(esk2_0),appear(an_organisation,end_time(esk2_0)))
| ~ environment(end_time(esk2_0))
| ~ environment(esk2_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]),
[final] ).
cnf(c_0_62,negated_conjecture,
( selection_favors(efficient_producers,first_movers,esk2_0)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_58,c_0_48]),
[final] ).
cnf(c_0_63,negated_conjecture,
( in_environment(esk2_0,esk1_1(esk2_0))
| selection_favors(efficient_producers,first_movers,esk2_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_48]),
[final] ).
cnf(c_0_64,negated_conjecture,
( environment(esk1_1(esk2_0))
| selection_favors(efficient_producers,first_movers,esk2_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_48]),
[final] ).
cnf(c_0_65,plain,
( in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| ~ environment(X1)
| ~ greater(critical_point(X1),X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1)) ),
i_0_13,
[final] ).
cnf(c_0_66,hypothesis,
( selection_favors(first_movers,efficient_producers,X1)
| ~ environment(X2)
| ~ in_environment(X2,critical_point(X2))
| ~ greater(critical_point(X2),X1)
| ~ greater_or_equal(X1,appear(efficient_producers,X2)) ),
i_0_17,
[final] ).
cnf(c_0_67,hypothesis,
( selection_favors(first_movers,efficient_producers,X1)
| ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater_or_equal(X1,appear(first_movers,X2))
| ~ greater(appear(efficient_producers,X2),X1) ),
i_0_16,
[final] ).
cnf(c_0_68,plain,
( ~ observational_period(X1)
| ~ environment(X2)
| ~ rapid_change(X1)
| ~ in_environment(X1,X2)
| ~ in_environment(X2,critical_point(X2)) ),
i_0_4,
[final] ).
cnf(c_0_69,hypothesis,
( appear(an_organisation,X1) = appear(first_movers,X1)
| ~ environment(X1)
| ~ in_environment(X1,appear(an_organisation,X1)) ),
i_0_18,
[final] ).
cnf(c_0_70,plain,
( in_environment(X1,critical_point(X1))
| greater(critical_point(X1),end_time(X1))
| ~ environment(X1) ),
i_0_9,
[final] ).
cnf(c_0_71,plain,
( greater_or_equal(X1,appear(efficient_producers,X2))
| greater(appear(efficient_producers,X2),X1)
| ~ in_environment(X2,X1) ),
i_0_15,
[final] ).
cnf(c_0_72,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
i_0_14,
[final] ).
cnf(c_0_73,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,esk2_0),
i_0_19,
[final] ).
cnf(c_0_74,negated_conjecture,
rapid_change(esk2_0),
i_0_21,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : MGT040+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.06 % Command : enigmatic-eprover.py %s %d 1
% 0.17/0.42 % Computer : n009.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Mon Sep 7 12:57:24 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.27/0.56 # ENIGMATIC: Selected complete mode:
% 16.82/5.51 # ENIGMATIC: Solved by autoschedule:
% 16.82/5.51 # No SInE strategy applied
% 16.82/5.51 # Trying AutoSched0 for 150 seconds
% 16.82/5.51 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 16.82/5.51 # and selection function SelectMaxLComplexAvoidPosPred.
% 16.82/5.51 #
% 16.82/5.51 # Preprocessing time : 0.046 s
% 16.82/5.51 # Presaturation interreduction done
% 16.82/5.51
% 16.82/5.51 # No proof found!
% 16.82/5.51 # SZS status Satisfiable
% 16.82/5.51 # SZS output start Saturation
% See solution above
% 16.82/5.52
% 16.82/5.52 # -------------------------------------------------
% 16.82/5.52 # User time : 0.048 s
% 16.82/5.52 # System time : 0.008 s
% 16.82/5.52 # Total time : 0.056 s
% 16.82/5.52 # Maximum resident set size: 3328 pages
% 16.82/5.52
%------------------------------------------------------------------------------