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

% Computer : n008.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:29:51 EDT 2022

% Result   : Theorem 7.36s 2.22s
% Output   : CNFRefutation 7.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   14 (   7 unt;   2 nHn;  12 RR)
%            Number of literals    :   31 (   0 equ;  17 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   :    9 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p2(esk2_1(X1))
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rpe5aszl/input.p',i_0_16) ).

cnf(i_0_18,negated_conjecture,
    ( p2(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rpe5aszl/input.p',i_0_18) ).

cnf(i_0_17,negated_conjecture,
    ( p101(X1)
    | r1(X1,esk2_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rpe5aszl/input.p',i_0_17) ).

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

cnf(i_0_2,negated_conjecture,
    p100(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rpe5aszl/input.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    ~ p101(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rpe5aszl/input.p',i_0_3) ).

cnf(c_0_25,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p2(esk2_1(X1))
    | ~ r1(esk1_0,X1) ),
    i_0_16 ).

cnf(c_0_26,negated_conjecture,
    ( p2(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_18 ).

cnf(c_0_27,negated_conjecture,
    ( p101(X1)
    | ~ r1(esk1_0,esk2_1(X1))
    | ~ r1(esk1_0,X1)
    | ~ p100(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    ( p101(X1)
    | r1(X1,esk2_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_17 ).

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

cnf(c_0_30,negated_conjecture,
    p100(esk1_0),
    i_0_2 ).

cnf(c_0_31,negated_conjecture,
    ~ p101(esk1_0),
    i_0_3 ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL656+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul  3 07:25:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.36/2.22  # ENIGMATIC: Solved by autoschedule:
% 7.36/2.22  # No SInE strategy applied
% 7.36/2.22  # Trying AutoSched0 for 150 seconds
% 7.36/2.22  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 7.36/2.22  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.36/2.22  #
% 7.36/2.22  # Preprocessing time       : 0.021 s
% 7.36/2.22  
% 7.36/2.22  # Proof found!
% 7.36/2.22  # SZS status Theorem
% 7.36/2.22  # SZS output start CNFRefutation
% See solution above
% 7.36/2.22  # Training examples: 0 positive, 0 negative
% 7.36/2.22  
% 7.36/2.22  # -------------------------------------------------
% 7.36/2.22  # User time                : 0.021 s
% 7.36/2.22  # System time              : 0.008 s
% 7.36/2.22  # Total time               : 0.030 s
% 7.36/2.22  # Maximum resident set size: 7120 pages
% 7.36/2.22  
%------------------------------------------------------------------------------