## TSTP Solution File: LCL666+1.001 by Enigma---0.5.1

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 09:31:28 EDT 2022

% Result   : Theorem 8.32s 2.50s
% Output   : CNFRefutation 8.32s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    9 (   7 unt;   0 nHn;   7 RR)
%            Number of literals    :   13 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    4 (   0 sgn)

%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( ~ p201(X1)
| ~ p101(X1)
| ~ r1(esk1_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tpq96fl9/lgb.p',i_0_4) ).

cnf(i_0_1,plain,
r1(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tpq96fl9/lgb.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
p101(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tpq96fl9/lgb.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
p201(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tpq96fl9/lgb.p',i_0_3) ).

cnf(c_0_9,negated_conjecture,
( ~ p201(X1)
| ~ p101(X1)
| ~ r1(esk1_0,X1) ),
i_0_4 ).

cnf(c_0_10,plain,
r1(X1,X1),
i_0_1 ).

cnf(c_0_11,negated_conjecture,
p101(esk1_0),
i_0_2 ).

cnf(c_0_12,negated_conjecture,
p201(esk1_0),
i_0_3 ).

cnf(c_0_13,plain,
\$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n004.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul  4 22:18:09 EDT 2022
% 0.12/0.34  % CPUTime  :
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 8.32/2.50  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.32/2.50  # No SInE strategy applied
% 8.32/2.50  # Trying AutoSched0 for 150 seconds
% 8.32/2.50  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 8.32/2.50  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.32/2.50  #
% 8.32/2.50  # Preprocessing time       : 0.023 s
% 8.32/2.50
% 8.32/2.50  # Proof found!
% 8.32/2.50  # SZS status Theorem
% 8.32/2.50  # SZS output start CNFRefutation
% See solution above
% 8.32/2.50  # Training examples: 0 positive, 0 negative
% 8.32/2.50
% 8.32/2.50  # -------------------------------------------------
% 8.32/2.50  # User time                : 0.025 s
% 8.32/2.50  # System time              : 0.004 s
% 8.32/2.50  # Total time               : 0.029 s
% 8.32/2.50  # Maximum resident set size: 7128 pages
% 8.32/2.50
%------------------------------------------------------------------------------
```