%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL686+1.010 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:22 AM UTC 2026
% Result : Theorem 16.82s 4.35s
% Output : CNFRefutation 16.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 5 unt; 2 nHn; 17 RR)
% Number of literals : 45 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 21 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_69,plain,
( p1(X1)
| ~ p2(X1)
| ~ epred1_1(X2)
| ~ r1(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl3r7m1z/input.p',i_0_69) ).
cnf(i_0_65,plain,
( r1(X1,esk34_1(X1))
| ~ epred1_1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl3r7m1z/input.p',i_0_65) ).
cnf(i_0_10,plain,
( p1(esk34_1(X1))
| p2(esk34_1(X1))
| ~ epred1_1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl3r7m1z/input.p',i_0_10) ).
cnf(i_0_9,plain,
( ~ epred1_1(X1)
| ~ p1(esk34_1(X1))
| ~ p2(esk34_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl3r7m1z/input.p',i_0_9) ).
cnf(i_0_3,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk4_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl3r7m1z/input.p',i_0_3) ).
cnf(i_0_1,plain,
r1(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl3r7m1z/input.p',i_0_1) ).
cnf(i_0_68,plain,
( p2(X1)
| ~ p1(X1)
| ~ epred1_1(X2)
| ~ r1(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl3r7m1z/input.p',i_0_68) ).
cnf(c_0_77,plain,
( p1(X1)
| ~ p2(X1)
| ~ epred1_1(X2)
| ~ r1(X2,X1) ),
i_0_69 ).
cnf(c_0_78,plain,
( r1(X1,esk34_1(X1))
| ~ epred1_1(X1) ),
i_0_65 ).
cnf(c_0_79,plain,
( p1(esk34_1(X1))
| p2(esk34_1(X1))
| ~ epred1_1(X1) ),
i_0_10 ).
cnf(c_0_80,plain,
( ~ epred1_1(X1)
| ~ p1(esk34_1(X1))
| ~ p2(esk34_1(X1)) ),
i_0_9 ).
cnf(c_0_81,plain,
( p1(esk34_1(X1))
| ~ epred1_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_82,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk4_0,X1) ),
i_0_3 ).
cnf(c_0_83,plain,
r1(X1,X1),
i_0_1 ).
cnf(c_0_84,plain,
( p2(X1)
| ~ p1(X1)
| ~ epred1_1(X2)
| ~ r1(X2,X1) ),
i_0_68 ).
cnf(c_0_85,plain,
( ~ p2(esk34_1(X1))
| ~ epred1_1(X1) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_86,plain,
epred1_1(esk4_0),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_87,plain,
~ epred1_1(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_78]),c_0_81]),c_0_85]) ).
cnf(c_0_88,plain,
$false,
inference(sr,[status(thm)],[c_0_86,c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL686+1.010 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n006.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 5 16:24:18 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.45 # ENIGMATIC: Selected complete mode:
% 16.82/4.35 # ENIGMATIC: Solved by autoschedule:
% 16.82/4.35 # No SInE strategy applied
% 16.82/4.35 # Trying AutoSched0 for 150 seconds
% 16.82/4.35 # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SP_CO_S0Y
% 16.82/4.35 # and selection function SelectMaxLComplexAvoidPosPred.
% 16.82/4.35 #
% 16.82/4.35 # Preprocessing time : 0.025 s
% 16.82/4.35
% 16.82/4.35 # Proof found!
% 16.82/4.35 # SZS status Theorem
% 16.82/4.35 # SZS output start CNFRefutation
% See solution above
% 16.82/4.35 # Training examples: 0 positive, 0 negative
% 16.82/4.35
% 16.82/4.35 # -------------------------------------------------
% 16.82/4.35 # User time : 0.038 s
% 16.82/4.35 # System time : 0.006 s
% 16.82/4.35 # Total time : 0.044 s
% 16.82/4.35 # Maximum resident set size: 3584 pages
% 16.82/4.35
%------------------------------------------------------------------------------