%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL678+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:18 AM UTC 2026
% Result : Theorem 23.28s 6.94s
% Output : CNFRefutation 23.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 4 unt; 0 nHn; 10 RR)
% Number of literals : 22 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 13 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
( p1(X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk2_1(X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1yb3eb77/lgb.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
( r1(esk2_1(X1),esk3_1(X1))
| ~ r1(esk1_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1yb3eb77/lgb.p',i_0_5) ).
cnf(i_0_4,negated_conjecture,
( ~ p1(esk3_1(X1))
| ~ r1(esk1_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1yb3eb77/lgb.p',i_0_4) ).
cnf(i_0_6,negated_conjecture,
( r1(X1,esk2_1(X1))
| ~ r1(esk1_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1yb3eb77/lgb.p',i_0_6) ).
cnf(i_0_1,plain,
r1(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1yb3eb77/lgb.p',i_0_1) ).
cnf(c_0_12,negated_conjecture,
( p1(X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk2_1(X2),X1) ),
i_0_3 ).
cnf(c_0_13,negated_conjecture,
( r1(esk2_1(X1),esk3_1(X1))
| ~ r1(esk1_0,X1) ),
i_0_5 ).
cnf(c_0_14,negated_conjecture,
( ~ p1(esk3_1(X1))
| ~ r1(esk1_0,X1) ),
i_0_4 ).
cnf(c_0_15,negated_conjecture,
~ r1(esk1_0,X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( r1(X1,esk2_1(X1))
| ~ r1(esk1_0,X1) ),
i_0_6 ).
cnf(c_0_17,plain,
r1(X1,X1),
i_0_1 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL678+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : enigmatic-eprover.py %s %d 1
% 0.18/0.48 % Computer : n001.cluster.edu
% 0.18/0.48 % Model : x86_64 x86_64
% 0.18/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.48 % Memory : 8046.5625MB
% 0.18/0.48 % OS : Linux 6.8.0-71-generic
% 0.18/0.48 % CPULimit : 300
% 0.18/0.48 % WCLimit : 300
% 0.18/0.48 % DateTime : Sun Sep 6 00:01:04 UTC 2026
% 0.18/0.49 % CPUTime :
% 0.32/0.64 # ENIGMATIC: Selected complete mode:
% 23.28/6.94 # ENIGMATIC: Solved by autoschedule-lgb:
% 23.28/6.94 # No SInE strategy applied
% 23.28/6.94 # Trying AutoSched0 for 149 seconds
% 23.28/6.94 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 23.28/6.94 # and selection function SelectMaxLComplexAvoidPosPred.
% 23.28/6.94 #
% 23.28/6.94 # Preprocessing time : 0.048 s
% 23.28/6.94 # Presaturation interreduction done
% 23.28/6.94
% 23.28/6.94 # Proof found!
% 23.28/6.94 # SZS status Theorem
% 23.28/6.94 # SZS output start CNFRefutation
% See solution above
% 23.28/6.94 # Training examples: 0 positive, 0 negative
% 23.28/6.94
% 23.28/6.94 # -------------------------------------------------
% 23.28/6.94 # User time : 0.047 s
% 23.28/6.94 # System time : 0.008 s
% 23.28/6.94 # Total time : 0.055 s
% 23.28/6.94 # Maximum resident set size: 3328 pages
% 23.28/6.95
%------------------------------------------------------------------------------