%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT038+1 : TPTP v9.3.0. Bugfixed v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 9.42s 3.47s
% Output : Saturation 9.42s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,hypothesis,
( greater(appear(efficient_producers,X1),appear(first_movers,X1))
| ~ environment(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_9) ).
cnf(i_0_12,negated_conjecture,
environment(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_12) ).
cnf(i_0_6,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_6) ).
cnf(i_0_8,hypothesis,
( greater(esk2_1(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_8) ).
cnf(i_0_11,negated_conjecture,
stable(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_11) ).
cnf(i_0_4,plain,
( greater(esk1_2(X1,X2),X2)
| ~ finite_set(X1)
| ~ contracts_from(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_4) ).
cnf(i_0_7,hypothesis,
( contracts_from(esk2_1(X1),first_movers)
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_7) ).
cnf(i_0_1,plain,
finite_set(first_movers),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_1) ).
cnf(i_0_5,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X3)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_5) ).
cnf(i_0_2,plain,
( in_environment(X1,appear(first_movers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_2) ).
cnf(i_0_3,plain,
( cardinality_at_time(s,esk1_2(X1,X2)) = zero
| ~ finite_set(X1)
| ~ contracts_from(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_3) ).
cnf(i_0_10,negated_conjecture,
( cardinality_at_time(first_movers,X1) != zero
| ~ in_environment(esk3_0,X1)
| ~ greater(X1,appear(first_movers,esk3_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q1pskj4o/input.p',i_0_10) ).
cnf(c_0_25,hypothesis,
( greater(appear(efficient_producers,X1),appear(first_movers,X1))
| ~ environment(X1) ),
i_0_9,
[final] ).
cnf(c_0_26,negated_conjecture,
environment(esk3_0),
i_0_12,
[final] ).
cnf(c_0_27,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
i_0_6,
[final] ).
cnf(c_0_28,negated_conjecture,
greater(appear(efficient_producers,esk3_0),appear(first_movers,esk3_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]),
[final] ).
cnf(c_0_29,plain,
( greater(X1,appear(first_movers,esk3_0))
| ~ greater(X1,appear(efficient_producers,esk3_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[final] ).
cnf(c_0_30,plain,
( greater(X1,appear(first_movers,esk3_0))
| ~ greater(X2,appear(efficient_producers,esk3_0))
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_29]),
[final] ).
cnf(c_0_31,hypothesis,
( greater(esk2_1(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
i_0_8,
[final] ).
cnf(c_0_32,negated_conjecture,
stable(esk3_0),
i_0_11,
[final] ).
cnf(c_0_33,plain,
( greater(esk1_2(X1,X2),X2)
| ~ finite_set(X1)
| ~ contracts_from(X2,X1) ),
i_0_4,
[final] ).
cnf(c_0_34,hypothesis,
( contracts_from(esk2_1(X1),first_movers)
| ~ environment(X1)
| ~ stable(X1) ),
i_0_7,
[final] ).
cnf(c_0_35,plain,
finite_set(first_movers),
i_0_1,
[final] ).
cnf(c_0_36,hypothesis,
( greater(X1,appear(first_movers,esk3_0))
| ~ greater(X1,esk2_1(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_26])]),
[final] ).
cnf(c_0_37,hypothesis,
( greater(esk1_2(first_movers,esk2_1(X1)),esk2_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[final] ).
cnf(c_0_38,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X3)
| ~ greater(X2,X3) ),
i_0_5,
[final] ).
cnf(c_0_39,plain,
( in_environment(X1,appear(first_movers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
i_0_2,
[final] ).
cnf(c_0_40,plain,
( greater(X1,appear(efficient_producers,X2))
| ~ greater(X1,esk2_1(X2))
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_31]),
[final] ).
cnf(c_0_41,hypothesis,
greater(esk1_2(first_movers,esk2_1(esk3_0)),appear(first_movers,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32]),c_0_26])]),
[final] ).
cnf(c_0_42,plain,
( in_environment(X1,appear(efficient_producers,esk3_0))
| ~ in_environment(X1,appear(first_movers,esk3_0))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_28]),
[final] ).
cnf(c_0_43,negated_conjecture,
in_environment(esk3_0,appear(first_movers,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_26])]),
[final] ).
cnf(c_0_44,plain,
( greater(esk1_2(first_movers,esk2_1(X1)),appear(efficient_producers,X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_37]),
[final] ).
cnf(c_0_45,plain,
( in_environment(X1,X2)
| ~ greater(X2,appear(efficient_producers,esk3_0))
| ~ in_environment(X1,appear(first_movers,esk3_0))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_29]),
[final] ).
cnf(c_0_46,plain,
( cardinality_at_time(s,esk1_2(X1,X2)) = zero
| ~ finite_set(X1)
| ~ contracts_from(X2,X1) ),
i_0_3,
[final] ).
cnf(c_0_47,plain,
( in_environment(X1,esk1_2(first_movers,esk2_1(esk3_0)))
| ~ in_environment(X1,appear(first_movers,esk3_0))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_41]),
[final] ).
cnf(c_0_48,hypothesis,
( in_environment(X1,esk2_1(X2))
| ~ in_environment(X1,appear(efficient_producers,X2))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_31]),
[final] ).
cnf(c_0_49,negated_conjecture,
in_environment(esk3_0,appear(efficient_producers,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32]),c_0_43]),c_0_26])]),
[final] ).
cnf(c_0_50,plain,
( in_environment(X1,esk1_2(first_movers,esk2_1(X2)))
| ~ in_environment(X1,appear(efficient_producers,X2))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_44]),
[final] ).
cnf(c_0_51,plain,
( in_environment(X1,esk1_2(first_movers,esk2_1(X2)))
| ~ in_environment(X1,esk2_1(X2))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]),
[final] ).
cnf(c_0_52,plain,
( greater(X1,appear(efficient_producers,X2))
| ~ greater(X1,esk1_2(first_movers,esk2_1(X2)))
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_44]),
[final] ).
cnf(c_0_53,plain,
( greater(X1,esk2_1(X2))
| ~ greater(X1,esk1_2(first_movers,esk2_1(X2)))
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_37]),
[final] ).
cnf(c_0_54,hypothesis,
( in_environment(X1,esk2_1(esk3_0))
| ~ in_environment(X1,appear(first_movers,esk3_0))
| ~ stable(X1)
| ~ environment(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_31]),c_0_32]),c_0_26])]),
[final] ).
cnf(c_0_55,plain,
( greater(X1,appear(first_movers,esk3_0))
| ~ greater(X1,esk1_2(first_movers,esk2_1(esk3_0))) ),
inference(spm,[status(thm)],[c_0_27,c_0_41]),
[final] ).
cnf(c_0_56,hypothesis,
( cardinality_at_time(s,esk1_2(first_movers,esk2_1(X1))) = zero
| ~ stable(X1)
| ~ environment(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_34]),c_0_35])]),
[final] ).
cnf(c_0_57,negated_conjecture,
( cardinality_at_time(first_movers,X1) != zero
| ~ in_environment(esk3_0,X1)
| ~ greater(X1,appear(first_movers,esk3_0)) ),
i_0_10,
[final] ).
cnf(c_0_58,negated_conjecture,
in_environment(esk3_0,esk1_2(first_movers,esk2_1(esk3_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_43]),c_0_32]),c_0_26])]),
[final] ).
cnf(c_0_59,negated_conjecture,
in_environment(esk3_0,esk2_1(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_32]),c_0_26])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT038+1 : TPTP v9.3.0. Bugfixed v9.3.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.35 % Computer : n020.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 7 12:47:45 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.13/0.40 # ENIGMATIC: Selected complete mode:
% 9.42/3.47 # ENIGMATIC: Solved by autoschedule:
% 9.42/3.47 # No SInE strategy applied
% 9.42/3.47 # Trying AutoSched0 for 150 seconds
% 9.42/3.47 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S04CN
% 9.42/3.47 # and selection function MSelectComplexExceptUniqMaxHorn.
% 9.42/3.47 #
% 9.42/3.47 # Preprocessing time : 0.023 s
% 9.42/3.47 # Presaturation interreduction done
% 9.42/3.47
% 9.42/3.47 # No proof found!
% 9.42/3.47 # SZS status Satisfiable
% 9.42/3.47 # SZS output start Saturation
% See solution above
% 9.42/3.47
% 9.42/3.47 # -------------------------------------------------
% 9.42/3.47 # User time : 0.025 s
% 9.42/3.47 # System time : 0.005 s
% 9.42/3.47 # Total time : 0.030 s
% 9.42/3.47 # Maximum resident set size: 3328 pages
% 9.42/3.47
%------------------------------------------------------------------------------