%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL682+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:19 AM UTC 2026
% Result : Theorem 12.51s 3.27s
% Output : CNFRefutation 12.51s
% 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,negated_conjecture,
( p12(X1)
| ~ r1(X2,X1)
| ~ r1(esk1_0,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfiekx7b/input.p',i_0_15) ).
cnf(i_0_7,negated_conjecture,
r1(esk6_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfiekx7b/input.p',i_0_7) ).
cnf(i_0_8,negated_conjecture,
r1(esk1_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfiekx7b/input.p',i_0_8) ).
cnf(i_0_6,negated_conjecture,
~ p12(esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfiekx7b/input.p',i_0_6) ).
cnf(c_0_20,negated_conjecture,
( p12(X1)
| ~ r1(X2,X1)
| ~ r1(esk1_0,X2) ),
i_0_15 ).
cnf(c_0_21,negated_conjecture,
r1(esk6_0,esk7_0),
i_0_7 ).
cnf(c_0_22,negated_conjecture,
r1(esk1_0,esk6_0),
i_0_8 ).
cnf(c_0_23,negated_conjecture,
~ p12(esk7_0),
i_0_6 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL682+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.37 % Computer : n003.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 4 16:07:21 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected complete mode:
% 12.51/3.27 # ENIGMATIC: Solved by autoschedule:
% 12.51/3.27 # No SInE strategy applied
% 12.51/3.27 # Trying AutoSched0 for 150 seconds
% 12.51/3.27 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 12.51/3.27 # and selection function SelectCQPrecWNTNp.
% 12.51/3.27 #
% 12.51/3.27 # Preprocessing time : 0.023 s
% 12.51/3.27
% 12.51/3.27 # Proof found!
% 12.51/3.27 # SZS status Theorem
% 12.51/3.27 # SZS output start CNFRefutation
% See solution above
% 12.51/3.27 # Training examples: 0 positive, 0 negative
% 12.51/3.27
% 12.51/3.27 # -------------------------------------------------
% 12.51/3.27 # User time : 0.023 s
% 12.51/3.27 # System time : 0.004 s
% 12.51/3.27 # Total time : 0.027 s
% 12.51/3.27 # Maximum resident set size: 3328 pages
% 12.51/3.27
%------------------------------------------------------------------------------