%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n002.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 : Mon Sep 7 11:47:07 AM UTC 2026
% Result : Theorem 16.36s 5.12s
% Output : CNFRefutation 16.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( ~ p201(X1)
| ~ p101(X1)
| ~ r1(esk1_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0kxkimqe/input.p',i_0_4) ).
cnf(i_0_3,negated_conjecture,
r1(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0kxkimqe/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
p101(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0kxkimqe/input.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
p201(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0kxkimqe/input.p',i_0_2) ).
cnf(c_0_9,negated_conjecture,
( ~ p201(X1)
| ~ p101(X1)
| ~ r1(esk1_0,X1) ),
i_0_4 ).
cnf(c_0_10,negated_conjecture,
r1(esk1_0,esk2_0),
i_0_3 ).
cnf(c_0_11,negated_conjecture,
p101(esk2_0),
i_0_1 ).
cnf(c_0_12,negated_conjecture,
p201(esk2_0),
i_0_2 ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.37 % Computer : n002.cluster.edu
% 0.07/0.37 % Model : x86_64 x86_64
% 0.07/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.37 % Memory : 8046.5625MB
% 0.07/0.37 % OS : Linux 6.8.0-71-generic
% 0.07/0.37 % CPULimit : 300
% 0.07/0.37 % WCLimit : 300
% 0.07/0.37 % DateTime : Fri Sep 4 12:29:37 UTC 2026
% 0.07/0.37 % CPUTime :
% 0.19/0.47 # ENIGMATIC: Selected complete mode:
% 16.36/5.12 # ENIGMATIC: Solved by autoschedule:
% 16.36/5.12 # No SInE strategy applied
% 16.36/5.12 # Trying AutoSched0 for 149 seconds
% 16.36/5.12 # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 16.36/5.12 # and selection function SelectMaxLComplexAvoidPosPred.
% 16.36/5.12 #
% 16.36/5.12 # Preprocessing time : 0.023 s
% 16.36/5.12
% 16.36/5.12 # Proof found!
% 16.36/5.12 # SZS status Theorem
% 16.36/5.12 # SZS output start CNFRefutation
% See solution above
% 16.36/5.12 # Training examples: 0 positive, 0 negative
% 16.36/5.12
% 16.36/5.12 # -------------------------------------------------
% 16.36/5.12 # User time : 0.024 s
% 16.36/5.12 # System time : 0.002 s
% 16.36/5.12 # Total time : 0.026 s
% 16.36/5.12 # Maximum resident set size: 3328 pages
% 16.36/5.12
%------------------------------------------------------------------------------