%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT021+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:33 AM UTC 2026
% Result : Theorem 12.18s 3.58s
% Output : CNFRefutation 12.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 12 unt; 3 nHn; 27 RR)
% Number of literals : 66 ( 0 equ; 40 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_2) ).
cnf(i_0_10,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_10) ).
cnf(i_0_11,negated_conjecture,
environment(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_11) ).
cnf(i_0_1,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_1) ).
cnf(i_0_5,hypothesis,
( constant(resources(X1,X2))
| greater(equilibrium(X1),X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_5) ).
cnf(i_0_7,hypothesis,
( ~ environment(X1)
| ~ constant(resources(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_7) ).
cnf(i_0_9,negated_conjecture,
decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_9) ).
cnf(i_0_6,hypothesis,
( decreases(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(equilibrium(X1),X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_6) ).
cnf(i_0_8,hypothesis,
( increases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| ~ environment(X2)
| ~ decreases(resources(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_8) ).
cnf(i_0_3,plain,
( ~ increases(X1)
| ~ decreases(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6fjz4e8w/lgb.p',i_0_3) ).
cnf(c_0_22,plain,
( greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
i_0_2 ).
cnf(c_0_23,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
i_0_10 ).
cnf(c_0_24,negated_conjecture,
environment(esk1_0),
i_0_11 ).
cnf(c_0_25,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
i_0_1 ).
cnf(c_0_26,hypothesis,
( constant(resources(X1,X2))
| greater(equilibrium(X1),X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
i_0_5 ).
cnf(c_0_27,negated_conjecture,
greater(number_of_organizations(esk1_0,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
in_environment(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24])]) ).
cnf(c_0_29,hypothesis,
( ~ environment(X1)
| ~ constant(resources(X1,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
i_0_7 ).
cnf(c_0_30,negated_conjecture,
( constant(resources(esk1_0,esk2_0))
| greater(equilibrium(esk1_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
i_0_9 ).
cnf(c_0_32,hypothesis,
( decreases(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(equilibrium(X1),X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
i_0_6 ).
cnf(c_0_33,hypothesis,
greater(equilibrium(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24]),c_0_31]),c_0_23])]) ).
cnf(c_0_34,hypothesis,
( increases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
| ~ environment(X2)
| ~ decreases(resources(X2,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1) ),
i_0_8 ).
cnf(c_0_35,hypothesis,
decreases(resources(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_27]),c_0_24]),c_0_28])]) ).
cnf(c_0_36,plain,
( ~ increases(X1)
| ~ decreases(X1) ),
i_0_3 ).
cnf(c_0_37,hypothesis,
increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24]),c_0_23])]) ).
cnf(c_0_38,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT021+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.36 % Computer : n028.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 7 12:04:33 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected complete mode:
% 12.18/3.58 # ENIGMATIC: Solved by autoschedule-lgb:
% 12.18/3.58 # No SInE strategy applied
% 12.18/3.58 # Trying AutoSched0 for 150 seconds
% 12.18/3.58 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S01BI
% 12.18/3.58 # and selection function PSelectMinOptimalNoXTypePred.
% 12.18/3.58 #
% 12.18/3.58 # Preprocessing time : 0.023 s
% 12.18/3.58 # Presaturation interreduction done
% 12.18/3.58
% 12.18/3.58 # Proof found!
% 12.18/3.58 # SZS status Theorem
% 12.18/3.58 # SZS output start CNFRefutation
% See solution above
% 12.18/3.58 # Training examples: 0 positive, 0 negative
% 12.18/3.58
% 12.18/3.58 # -------------------------------------------------
% 12.18/3.58 # User time : 0.025 s
% 12.18/3.58 # System time : 0.003 s
% 12.18/3.58 # Total time : 0.028 s
% 12.18/3.58 # Maximum resident set size: 3328 pages
% 12.18/3.58
%------------------------------------------------------------------------------