%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL666+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n001.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:48:06 AM UTC 2026
% Result : Theorem 14.98s 4.06s
% Output : CNFRefutation 14.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 7 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 : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 4 ( 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-0dgaz7ov/input.p',i_0_4) ).
cnf(i_0_1,plain,
r1(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0dgaz7ov/input.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
p101(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0dgaz7ov/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
p201(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0dgaz7ov/input.p',i_0_3) ).
cnf(c_0_9,negated_conjecture,
( ~ p201(X1)
| ~ p101(X1)
| ~ r1(esk1_0,X1) ),
i_0_4 ).
cnf(c_0_10,plain,
r1(X1,X1),
i_0_1 ).
cnf(c_0_11,negated_conjecture,
p101(esk1_0),
i_0_2 ).
cnf(c_0_12,negated_conjecture,
p201(esk1_0),
i_0_3 ).
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 : LCL666+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.35 % Computer : n001.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 : Sat Sep 5 21:23:49 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.12/0.45 # ENIGMATIC: Selected complete mode:
% 14.98/4.06 # ENIGMATIC: Solved by autoschedule:
% 14.98/4.06 # No SInE strategy applied
% 14.98/4.06 # Trying AutoSched0 for 150 seconds
% 14.98/4.06 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0e
% 14.98/4.06 # and selection function SelectLargestNegLit.
% 14.98/4.06 #
% 14.98/4.06 # Preprocessing time : 0.024 s
% 14.98/4.06
% 14.98/4.06 # Proof found!
% 14.98/4.06 # SZS status Theorem
% 14.98/4.06 # SZS output start CNFRefutation
% See solution above
% 14.98/4.06 # Training examples: 0 positive, 0 negative
% 14.98/4.06
% 14.98/4.06 # -------------------------------------------------
% 14.98/4.06 # User time : 0.021 s
% 14.98/4.06 # System time : 0.006 s
% 14.98/4.06 # Total time : 0.027 s
% 14.98/4.06 # Maximum resident set size: 3328 pages
% 14.98/4.06
%------------------------------------------------------------------------------