%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL686+1.005 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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.35s 3.87s
% Output : CNFRefutation 12.35s
% 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; 27 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_39,plain,
( p1(X1)
| ~ p2(X1)
| ~ epred1_1(X2)
| ~ r1(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o9oomvma/input.p',i_0_39) ).
cnf(i_0_35,plain,
( r1(X1,esk19_1(X1))
| ~ epred1_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o9oomvma/input.p',i_0_35) ).
cnf(i_0_10,plain,
( p1(esk19_1(X1))
| p2(esk19_1(X1))
| ~ epred1_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o9oomvma/input.p',i_0_10) ).
cnf(i_0_38,plain,
( p2(X1)
| ~ p1(X1)
| ~ epred1_1(X2)
| ~ r1(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o9oomvma/input.p',i_0_38) ).
cnf(i_0_3,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk4_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o9oomvma/input.p',i_0_3) ).
cnf(i_0_1,plain,
r1(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o9oomvma/input.p',i_0_1) ).
cnf(i_0_9,plain,
( ~ epred1_1(X1)
| ~ p1(esk19_1(X1))
| ~ p2(esk19_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o9oomvma/input.p',i_0_9) ).
cnf(c_0_47,plain,
( p1(X1)
| ~ p2(X1)
| ~ epred1_1(X2)
| ~ r1(X2,X1) ),
i_0_39 ).
cnf(c_0_48,plain,
( r1(X1,esk19_1(X1))
| ~ epred1_1(X1) ),
i_0_35 ).
cnf(c_0_49,plain,
( p1(esk19_1(X1))
| p2(esk19_1(X1))
| ~ epred1_1(X1) ),
i_0_10 ).
cnf(c_0_50,plain,
( p2(X1)
| ~ p1(X1)
| ~ epred1_1(X2)
| ~ r1(X2,X1) ),
i_0_38 ).
cnf(c_0_51,plain,
( p1(esk19_1(X1))
| ~ epred1_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk4_0,X1) ),
i_0_3 ).
cnf(c_0_53,plain,
r1(X1,X1),
i_0_1 ).
cnf(c_0_54,plain,
( ~ epred1_1(X1)
| ~ p1(esk19_1(X1))
| ~ p2(esk19_1(X1)) ),
i_0_9 ).
cnf(c_0_55,plain,
( p2(esk19_1(X1))
| ~ epred1_1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_51]) ).
cnf(c_0_56,negated_conjecture,
epred1_1(esk4_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
~ epred1_1(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_51]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_56,c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL686+1.005 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.33 % Computer : n007.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.33 % CPULimit : 300
% 0.07/0.33 % WCLimit : 300
% 0.07/0.33 % DateTime : Fri Sep 4 18:44:25 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.11/0.43 # ENIGMATIC: Selected complete mode:
% 12.35/3.87 # ENIGMATIC: Solved by autoschedule:
% 12.35/3.87 # No SInE strategy applied
% 12.35/3.87 # Trying AutoSched0 for 150 seconds
% 12.35/3.87 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 12.35/3.87 # and selection function SelectCQPrecWNTNp.
% 12.35/3.87 #
% 12.35/3.87 # Preprocessing time : 0.025 s
% 12.35/3.87
% 12.35/3.87 # Proof found!
% 12.35/3.87 # SZS status Theorem
% 12.35/3.87 # SZS output start CNFRefutation
% See solution above
% 12.35/3.87 # Training examples: 0 positive, 0 negative
% 12.35/3.87
% 12.35/3.87 # -------------------------------------------------
% 12.35/3.87 # User time : 0.029 s
% 12.35/3.87 # System time : 0.006 s
% 12.35/3.87 # Total time : 0.035 s
% 12.35/3.87 # Maximum resident set size: 3328 pages
% 12.35/3.87
%------------------------------------------------------------------------------