%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN398+1 : TPTP v8.1.0. Released v2.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 : Thu Jul 21 04:52:01 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
    ( ~ p
    | ~ f(esk1_0)
    | ~ f(esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cqbwc0it/lgb.p',i_0_5) ).

cnf(i_0_4,negated_conjecture,
    p,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cqbwc0it/lgb.p',i_0_4) ).

cnf(i_0_1,negated_conjecture,
    ( f(X1)
    | f(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cqbwc0it/lgb.p',i_0_1) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p
    | ~ f(esk1_0)
    | ~ f(esk2_0) ),
    i_0_5 ).

cnf(c_0_10,negated_conjecture,
    p,
    i_0_4 ).

cnf(c_0_11,negated_conjecture,
    ( ~ f(esk1_0)
    | ~ f(esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_12,negated_conjecture,
    ( f(X1)
    | f(X2) ),
    i_0_1 ).

cnf(c_0_13,negated_conjecture,
    f(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_13]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN398+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 20:18:25 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.90/2.47  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.90/2.47  # No SInE strategy applied
% 7.90/2.47  # Trying AutoSched0 for 150 seconds
% 7.90/2.47  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.90/2.47  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.90/2.47  #
% 7.90/2.47  # Preprocessing time       : 0.023 s
% 7.90/2.47  
% 7.90/2.47  # Proof found!
% 7.90/2.47  # SZS status Theorem
% 7.90/2.47  # SZS output start CNFRefutation
% See solution above
% 7.90/2.47  # Training examples: 0 positive, 0 negative
% 7.90/2.47  
% 7.90/2.47  # -------------------------------------------------
% 7.90/2.47  # User time                : 0.023 s
% 7.90/2.47  # System time              : 0.009 s
% 7.90/2.47  # Total time               : 0.032 s
% 7.90/2.47  # Maximum resident set size: 7124 pages
% 7.90/2.47  
%------------------------------------------------------------------------------