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

% Computer : n013.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 4.45s 2.17s
% Output   : CNFRefutation 4.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (   3 unt;   2 nHn;   6 RR)
%            Number of literals    :   19 (   0 equ;   9 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    7 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( p
    | f(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3hh02z_/input.p',i_0_1) ).

cnf(i_0_3,negated_conjecture,
    ( f(X1)
    | ~ p ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3hh02z_/input.p',i_0_3) ).

cnf(i_0_2,negated_conjecture,
    ( ~ p
    | ~ f(esk1_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3hh02z_/input.p',i_0_2) ).

cnf(i_0_4,negated_conjecture,
    ( p
    | ~ f(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3hh02z_/input.p',i_0_4) ).

cnf(c_0_9,negated_conjecture,
    ( p
    | f(X1) ),
    i_0_1 ).

cnf(c_0_10,negated_conjecture,
    ( f(X1)
    | ~ p ),
    i_0_3 ).

cnf(c_0_11,negated_conjecture,
    ( ~ p
    | ~ f(esk1_0) ),
    i_0_2 ).

cnf(c_0_12,negated_conjecture,
    f(X1),
    inference(csr,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ( p
    | ~ f(X1) ),
    i_0_4 ).

cnf(c_0_14,negated_conjecture,
    ~ p,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).

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

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