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

% Computer : n003.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:03 EDT 2022

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

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

cnf(i_0_2,negated_conjecture,
    f(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bej737ju/lgb.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    ( h(esk1_0)
    | ~ g(esk1_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bej737ju/lgb.p',i_0_3) ).

cnf(i_0_1,negated_conjecture,
    ~ h(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bej737ju/lgb.p',i_0_1) ).

cnf(c_0_9,negated_conjecture,
    ( g(esk1_0)
    | ~ f(esk1_0) ),
    i_0_4 ).

cnf(c_0_10,negated_conjecture,
    f(esk1_0),
    i_0_2 ).

cnf(c_0_11,negated_conjecture,
    ( h(esk1_0)
    | ~ g(esk1_0) ),
    i_0_3 ).

cnf(c_0_12,negated_conjecture,
    g(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_13,negated_conjecture,
    ~ h(esk1_0),
    i_0_1 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN403+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n003.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 : Tue Jul 12 04:36:47 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.66/2.33  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.66/2.33  # No SInE strategy applied
% 7.66/2.33  # Trying AutoSched0 for 150 seconds
% 7.66/2.33  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
% 7.66/2.33  # and selection function PSelectComplexExceptRRHorn.
% 7.66/2.33  #
% 7.66/2.33  # Preprocessing time       : 0.012 s
% 7.66/2.33  
% 7.66/2.33  # Proof found!
% 7.66/2.33  # SZS status Theorem
% 7.66/2.33  # SZS output start CNFRefutation
% See solution above
% 7.66/2.33  # Training examples: 0 positive, 0 negative
% 7.66/2.33  
% 7.66/2.33  # -------------------------------------------------
% 7.66/2.33  # User time                : 0.011 s
% 7.66/2.33  # System time              : 0.004 s
% 7.66/2.33  # Total time               : 0.016 s
% 7.66/2.33  # Maximum resident set size: 7124 pages
% 7.66/2.33  
%------------------------------------------------------------------------------