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

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

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

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

cnf(i_0_1,negated_conjecture,
    ( h(X1)
    | ~ f(X1)
    | ~ g(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66k5xd8i/input.p',i_0_1) ).

cnf(i_0_9,negated_conjecture,
    ( f(esk1_0)
    | f(esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66k5xd8i/input.p',i_0_9) ).

cnf(i_0_7,negated_conjecture,
    ( f(esk2_0)
    | g(esk1_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66k5xd8i/input.p',i_0_7) ).

cnf(i_0_3,negated_conjecture,
    ( g(X1)
    | h(X2)
    | ~ f(X2)
    | ~ f(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66k5xd8i/input.p',i_0_3) ).

cnf(i_0_4,negated_conjecture,
    ( ~ g(esk2_0)
    | ~ h(esk1_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66k5xd8i/input.p',i_0_4) ).

cnf(i_0_8,negated_conjecture,
    ( f(esk1_0)
    | ~ g(esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66k5xd8i/input.p',i_0_8) ).

cnf(i_0_6,negated_conjecture,
    ( g(esk1_0)
    | ~ g(esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66k5xd8i/input.p',i_0_6) ).

cnf(i_0_2,negated_conjecture,
    ( g(X1)
    | ~ f(X1)
    | ~ h(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-66k5xd8i/input.p',i_0_2) ).

cnf(c_0_19,negated_conjecture,
    ( f(esk2_0)
    | ~ h(esk1_0) ),
    i_0_5 ).

cnf(c_0_20,negated_conjecture,
    ( h(X1)
    | ~ f(X1)
    | ~ g(X1) ),
    i_0_1 ).

cnf(c_0_21,negated_conjecture,
    ( f(esk1_0)
    | f(esk2_0) ),
    i_0_9 ).

cnf(c_0_22,negated_conjecture,
    ( f(esk2_0)
    | g(esk1_0) ),
    i_0_7 ).

cnf(c_0_23,negated_conjecture,
    ( g(X1)
    | h(X2)
    | ~ f(X2)
    | ~ f(X1) ),
    i_0_3 ).

cnf(c_0_24,negated_conjecture,
    f(esk2_0),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ g(esk2_0)
    | ~ h(esk1_0) ),
    i_0_4 ).

cnf(c_0_26,negated_conjecture,
    ( f(esk1_0)
    | ~ g(esk2_0) ),
    i_0_8 ).

cnf(c_0_27,negated_conjecture,
    ( g(esk1_0)
    | ~ g(esk2_0) ),
    i_0_6 ).

cnf(c_0_28,negated_conjecture,
    ( h(esk2_0)
    | g(X1)
    | ~ f(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    ~ g(esk2_0),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26]),c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( g(X1)
    | ~ f(X1)
    | ~ h(X1) ),
    i_0_2 ).

cnf(c_0_31,negated_conjecture,
    h(esk2_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_29]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN920+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n028.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 : Mon Jul 11 21:47:16 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.00/2.19  # ENIGMATIC: Solved by autoschedule:
% 7.00/2.19  # No SInE strategy applied
% 7.00/2.19  # Trying AutoSched0 for 150 seconds
% 7.00/2.19  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.00/2.19  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.00/2.19  #
% 7.00/2.19  # Preprocessing time       : 0.021 s
% 7.00/2.19  
% 7.00/2.19  # Proof found!
% 7.00/2.19  # SZS status Theorem
% 7.00/2.19  # SZS output start CNFRefutation
% See solution above
% 7.00/2.19  # Training examples: 0 positive, 0 negative
% 7.00/2.19  
% 7.00/2.19  # -------------------------------------------------
% 7.00/2.19  # User time                : 0.022 s
% 7.00/2.19  # System time              : 0.004 s
% 7.00/2.19  # Total time               : 0.027 s
% 7.00/2.19  # Maximum resident set size: 7116 pages
% 7.00/2.19  
%------------------------------------------------------------------------------