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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
    ( ~ f(esk1_0)
    | ~ f(esk2_0)
    | ~ f(esk3_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-onosdyhl/lgb.p',i_0_3) ).

cnf(i_0_2,negated_conjecture,
    ( f(X1)
    | f(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-onosdyhl/lgb.p',i_0_2) ).

cnf(c_0_6,negated_conjecture,
    ( ~ f(esk1_0)
    | ~ f(esk2_0)
    | ~ f(esk3_0) ),
    i_0_3 ).

cnf(c_0_7,negated_conjecture,
    ( f(X1)
    | f(X2) ),
    i_0_2 ).

cnf(c_0_8,negated_conjecture,
    f(X1),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_8]),c_0_8]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SYN409+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n010.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 : Tue Jul 12 06:22:32 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 4.61/2.20  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.61/2.20  # No SInE strategy applied
% 4.61/2.20  # Trying AutoSched0 for 150 seconds
% 4.61/2.20  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 4.61/2.20  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.61/2.20  #
% 4.61/2.20  # Preprocessing time       : 0.022 s
% 4.61/2.20  
% 4.61/2.20  # Proof found!
% 4.61/2.20  # SZS status Theorem
% 4.61/2.20  # SZS output start CNFRefutation
% See solution above
% 4.61/2.20  # Training examples: 0 positive, 0 negative
% 4.61/2.20  
% 4.61/2.20  # -------------------------------------------------
% 4.61/2.20  # User time                : 0.021 s
% 4.61/2.20  # System time              : 0.008 s
% 4.61/2.20  # Total time               : 0.029 s
% 4.61/2.20  # Maximum resident set size: 7128 pages
% 4.61/2.20  
%------------------------------------------------------------------------------