%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL674+1.005 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n002.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:16 AM UTC 2026
% Result : Theorem 15.89s 4.24s
% Output : CNFRefutation 15.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 15 unt; 6 nHn; 30 RR)
% Number of literals : 71 ( 0 equ; 37 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk1_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_5) ).
cnf(i_0_1,plain,
r1(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_1) ).
cnf(i_0_32,plain,
( p101(X1)
| r1(X1,esk10_1(X1))
| ~ p100(X1)
| ~ epred1_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_32) ).
cnf(i_0_3,negated_conjecture,
p100(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_3) ).
cnf(i_0_4,negated_conjecture,
~ p101(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_4) ).
cnf(i_0_29,plain,
( p101(X1)
| p101(esk10_1(X1))
| ~ p100(X1)
| ~ epred1_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_29) ).
cnf(i_0_30,plain,
( p101(X1)
| ~ p100(X1)
| ~ epred1_1(X1)
| ~ p102(esk10_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_30) ).
cnf(i_0_40,plain,
( p102(X1)
| r1(X1,esk8_1(X1))
| ~ p101(X1)
| ~ epred1_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_40) ).
cnf(i_0_2,plain,
( r1(X1,X2)
| ~ r1(X3,X2)
| ~ r1(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_2) ).
cnf(i_0_39,plain,
( p102(X1)
| ~ p101(X1)
| ~ epred1_1(X1)
| ~ p3(esk8_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_39) ).
cnf(i_0_6,negated_conjecture,
( p3(X1)
| ~ r1(esk1_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cj5758fh/input.p',i_0_6) ).
cnf(c_0_52,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk1_0,X1) ),
i_0_5 ).
cnf(c_0_53,plain,
r1(X1,X1),
i_0_1 ).
cnf(c_0_54,plain,
( p101(X1)
| r1(X1,esk10_1(X1))
| ~ p100(X1)
| ~ epred1_1(X1) ),
i_0_32 ).
cnf(c_0_55,plain,
epred1_1(esk1_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
p100(esk1_0),
i_0_3 ).
cnf(c_0_57,negated_conjecture,
~ p101(esk1_0),
i_0_4 ).
cnf(c_0_58,plain,
r1(esk1_0,esk10_1(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),c_0_57]) ).
cnf(c_0_59,plain,
( p101(X1)
| p101(esk10_1(X1))
| ~ p100(X1)
| ~ epred1_1(X1) ),
i_0_29 ).
cnf(c_0_60,plain,
( p101(X1)
| ~ p100(X1)
| ~ epred1_1(X1)
| ~ p102(esk10_1(X1)) ),
i_0_30 ).
cnf(c_0_61,plain,
( p102(X1)
| r1(X1,esk8_1(X1))
| ~ p101(X1)
| ~ epred1_1(X1) ),
i_0_40 ).
cnf(c_0_62,negated_conjecture,
epred1_1(esk10_1(esk1_0)),
inference(spm,[status(thm)],[c_0_52,c_0_58]) ).
cnf(c_0_63,plain,
p101(esk10_1(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_55]),c_0_56])]),c_0_57]) ).
cnf(c_0_64,plain,
~ p102(esk10_1(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_55]),c_0_56])]),c_0_57]) ).
cnf(c_0_65,plain,
( r1(X1,X2)
| ~ r1(X3,X2)
| ~ r1(X1,X3) ),
i_0_2 ).
cnf(c_0_66,plain,
r1(esk10_1(esk1_0),esk8_1(esk10_1(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]),c_0_64]) ).
cnf(c_0_67,plain,
( r1(X1,esk8_1(esk10_1(esk1_0)))
| ~ r1(X1,esk10_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_68,plain,
( p102(X1)
| ~ p101(X1)
| ~ epred1_1(X1)
| ~ p3(esk8_1(X1)) ),
i_0_39 ).
cnf(c_0_69,negated_conjecture,
( p3(X1)
| ~ r1(esk1_0,X1) ),
i_0_6 ).
cnf(c_0_70,plain,
r1(esk1_0,esk8_1(esk10_1(esk1_0))),
inference(spm,[status(thm)],[c_0_67,c_0_58]) ).
cnf(c_0_71,plain,
~ p3(esk8_1(esk10_1(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_62]),c_0_63])]),c_0_64]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL674+1.005 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 5 02:08:07 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.12/0.45 # ENIGMATIC: Selected complete mode:
% 15.89/4.24 # ENIGMATIC: Solved by autoschedule:
% 15.89/4.24 # No SInE strategy applied
% 15.89/4.24 # Trying AutoSched0 for 150 seconds
% 15.89/4.24 # AutoSched0-Mode selected heuristic G_E___107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 15.89/4.24 # and selection function SelectCQArEqLast.
% 15.89/4.24 #
% 15.89/4.24 # Preprocessing time : 0.025 s
% 15.89/4.24 # Presaturation interreduction done
% 15.89/4.24
% 15.89/4.24 # Proof found!
% 15.89/4.24 # SZS status Theorem
% 15.89/4.24 # SZS output start CNFRefutation
% See solution above
% 15.89/4.24 # Training examples: 0 positive, 0 negative
% 15.89/4.24
% 15.89/4.24 # -------------------------------------------------
% 15.89/4.24 # User time : 0.035 s
% 15.89/4.24 # System time : 0.004 s
% 15.89/4.24 # Total time : 0.039 s
% 15.89/4.24 # Maximum resident set size: 3584 pages
% 15.89/4.24
%------------------------------------------------------------------------------