%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL686+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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 12.43s 3.85s
% Output : CNFRefutation 12.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 3 unt; 2 nHn; 15 RR)
% Number of literals : 46 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(X2,X1)
| ~ r1(esk4_0,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4rt7s8n/input.p',i_0_9) ).
cnf(i_0_1,plain,
r1(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4rt7s8n/input.p',i_0_1) ).
cnf(i_0_8,negated_conjecture,
( p2(X1)
| ~ p1(X1)
| ~ r1(X2,X1)
| ~ r1(esk4_0,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4rt7s8n/input.p',i_0_8) ).
cnf(i_0_4,negated_conjecture,
( p1(esk7_1(X1))
| p2(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4rt7s8n/input.p',i_0_4) ).
cnf(i_0_3,negated_conjecture,
( ~ p1(esk7_1(X1))
| ~ p2(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4rt7s8n/input.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g4rt7s8n/input.p',i_0_5) ).
cnf(c_0_16,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(X2,X1)
| ~ r1(esk4_0,X2) ),
i_0_9 ).
cnf(c_0_17,plain,
r1(X1,X1),
i_0_1 ).
cnf(c_0_18,negated_conjecture,
( p2(X1)
| ~ p1(X1)
| ~ r1(X2,X1)
| ~ r1(esk4_0,X2) ),
i_0_8 ).
cnf(c_0_19,plain,
( p1(X1)
| ~ p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( p1(esk7_1(X1))
| p2(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
i_0_4 ).
cnf(c_0_21,negated_conjecture,
( ~ p1(esk7_1(X1))
| ~ p2(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
i_0_3 ).
cnf(c_0_22,plain,
( p2(X1)
| ~ r1(esk4_0,X1)
| ~ p1(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( p1(esk7_1(X1))
| ~ r1(esk4_0,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ r1(esk4_0,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
i_0_5 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL686+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.35 % Computer : n009.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sat Sep 5 09:49:08 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.11/0.45 # ENIGMATIC: Selected complete mode:
% 12.43/3.85 # ENIGMATIC: Solved by autoschedule:
% 12.43/3.85 # No SInE strategy applied
% 12.43/3.85 # Trying AutoSched0 for 150 seconds
% 12.43/3.85 # AutoSched0-Mode selected heuristic G_____0010_evo
% 12.43/3.85 # and selection function SelectMaxLComplexAvoidPosPred.
% 12.43/3.85 #
% 12.43/3.85 # Preprocessing time : 0.023 s
% 12.43/3.85
% 12.43/3.85 # Proof found!
% 12.43/3.85 # SZS status Theorem
% 12.43/3.85 # SZS output start CNFRefutation
% See solution above
% 12.43/3.85 # Training examples: 0 positive, 0 negative
% 12.43/3.85
% 12.43/3.85 # -------------------------------------------------
% 12.43/3.85 # User time : 0.023 s
% 12.43/3.85 # System time : 0.006 s
% 12.43/3.85 # Total time : 0.028 s
% 12.43/3.85 # Maximum resident set size: 3328 pages
% 12.43/3.85
%------------------------------------------------------------------------------