%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.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:58 AM UTC 2026
% Result : Theorem 24.93s 6.87s
% Output : CNFRefutation 24.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 12 unt; 3 nHn; 21 RR)
% Number of literals : 40 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 16 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,negated_conjecture,
( efficient_producer(X1)
| first_mover(X1)
| ~ organisation_at_time(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qjkk7zp6/lgb.p',i_0_8) ).
cnf(i_0_7,hypothesis,
organisation_at_time(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qjkk7zp6/lgb.p',i_0_7) ).
cnf(i_0_4,hypothesis,
~ has_elaborated_routines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qjkk7zp6/lgb.p',i_0_4) ).
cnf(i_0_2,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ efficient_producer(X1)
| ~ organisation_at_time(X1,X2)
| ~ founding_time(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qjkk7zp6/lgb.p',i_0_2) ).
cnf(i_0_6,hypothesis,
founding_time(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qjkk7zp6/lgb.p',i_0_6) ).
cnf(i_0_3,hypothesis,
( number_of_routines(X1,X2,low)
| ~ first_mover(X1)
| ~ organisation_at_time(X1,X2)
| ~ founding_time(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qjkk7zp6/lgb.p',i_0_3) ).
cnf(i_0_1,plain,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qjkk7zp6/lgb.p',i_0_1) ).
cnf(i_0_5,hypothesis,
number_of_routines(esk1_0,esk2_0,high),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qjkk7zp6/lgb.p',i_0_5) ).
cnf(c_0_17,negated_conjecture,
( efficient_producer(X1)
| first_mover(X1)
| ~ organisation_at_time(X1,X2) ),
i_0_8 ).
cnf(c_0_18,hypothesis,
organisation_at_time(esk1_0,esk2_0),
i_0_7 ).
cnf(c_0_19,hypothesis,
~ has_elaborated_routines(esk1_0,esk2_0),
i_0_4 ).
cnf(c_0_20,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ efficient_producer(X1)
| ~ organisation_at_time(X1,X2)
| ~ founding_time(X1,X2) ),
i_0_2 ).
cnf(c_0_21,hypothesis,
founding_time(esk1_0,esk2_0),
i_0_6 ).
cnf(c_0_22,hypothesis,
( efficient_producer(esk1_0)
| first_mover(esk1_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,hypothesis,
~ efficient_producer(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_18])]) ).
cnf(c_0_24,hypothesis,
( number_of_routines(X1,X2,low)
| ~ first_mover(X1)
| ~ organisation_at_time(X1,X2)
| ~ founding_time(X1,X2) ),
i_0_3 ).
cnf(c_0_25,hypothesis,
first_mover(esk1_0),
inference(sr,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
i_0_1 ).
cnf(c_0_27,hypothesis,
number_of_routines(esk1_0,esk2_0,low),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_18])]),c_0_25])]) ).
cnf(c_0_28,hypothesis,
number_of_routines(esk1_0,esk2_0,high),
i_0_5 ).
cnf(c_0_29,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.06 % Command : enigmatic-eprover.py %s %d 1
% 0.20/0.45 % Computer : n020.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 7 13:02:45 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.24/0.61 # ENIGMATIC: Selected complete mode:
% 24.93/6.87 # ENIGMATIC: Solved by autoschedule-lgb:
% 24.93/6.87 # No SInE strategy applied
% 24.93/6.87 # Trying AutoSched0 for 149 seconds
% 24.93/6.87 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 24.93/6.87 # and selection function SelectMaxLComplexAvoidPosPred.
% 24.93/6.87 #
% 24.93/6.87 # Preprocessing time : 0.044 s
% 24.93/6.87 # Presaturation interreduction done
% 24.93/6.87
% 24.93/6.87 # Proof found!
% 24.93/6.87 # SZS status Theorem
% 24.93/6.87 # SZS output start CNFRefutation
% See solution above
% 24.93/6.87 # Training examples: 0 positive, 0 negative
% 24.93/6.87
% 24.93/6.87 # -------------------------------------------------
% 24.93/6.87 # User time : 0.044 s
% 24.93/6.87 # System time : 0.006 s
% 24.93/6.87 # Total time : 0.050 s
% 24.93/6.87 # Maximum resident set size: 3328 pages
% 24.93/6.87
%------------------------------------------------------------------------------