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