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

% Computer : n025.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:32:05 EDT 2022

% Result   : Theorem 7.24s 2.25s
% Output   : CNFRefutation 7.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   10 (   7 unt;   0 nHn;   8 RR)
%            Number of literals    :   18 (   0 equ;  11 neg)
%            Maximal clause size   :    4 (   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   :    7 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
    ( ~ p201(X1)
    | ~ p101(X1)
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bq1w89s5/input.p',i_0_5) ).

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

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

cnf(i_0_4,negated_conjecture,
    p201(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bq1w89s5/input.p',i_0_4) ).

cnf(c_0_10,negated_conjecture,
    ( ~ p201(X1)
    | ~ p101(X1)
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    i_0_5 ).

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

cnf(c_0_12,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p101(X1)
    | ~ p201(X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,negated_conjecture,
    p101(esk1_0),
    i_0_3 ).

cnf(c_0_14,negated_conjecture,
    p201(esk1_0),
    i_0_4 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : LCL684+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul  3 03:39:57 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.24/2.25  # ENIGMATIC: Solved by autoschedule:
% 7.24/2.25  # No SInE strategy applied
% 7.24/2.25  # Trying AutoSched0 for 150 seconds
% 7.24/2.25  # AutoSched0-Mode selected heuristic H_____047_C18_F1_PI_AE_R8_CS_SP_S2S
% 7.24/2.25  # and selection function SelectNewComplexAHP.
% 7.24/2.25  #
% 7.24/2.25  # Preprocessing time       : 0.021 s
% 7.24/2.25  
% 7.24/2.25  # Proof found!
% 7.24/2.25  # SZS status Theorem
% 7.24/2.25  # SZS output start CNFRefutation
% See solution above
% 7.24/2.25  # Training examples: 0 positive, 0 negative
% 7.24/2.25  
% 7.24/2.25  # -------------------------------------------------
% 7.24/2.25  # User time                : 0.020 s
% 7.24/2.25  # System time              : 0.006 s
% 7.24/2.25  # Total time               : 0.027 s
% 7.24/2.25  # Maximum resident set size: 7124 pages
% 7.24/2.25  
%------------------------------------------------------------------------------