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

% Computer : n029.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:22 EDT 2022

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

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

cnf(i_0_4,negated_conjecture,
    ( g(X1)
    | c(f(X1))
    | ~ e(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-365hk0m3/input.p',i_0_4) ).

cnf(i_0_3,negated_conjecture,
    ( p(X1)
    | ~ s(esk1_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-365hk0m3/input.p',i_0_3) ).

cnf(i_0_5,negated_conjecture,
    ( g(X1)
    | s(X1,f(X1))
    | ~ e(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-365hk0m3/input.p',i_0_5) ).

cnf(i_0_6,negated_conjecture,
    e(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-365hk0m3/input.p',i_0_6) ).

cnf(i_0_2,negated_conjecture,
    ( ~ p(X1)
    | ~ g(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-365hk0m3/input.p',i_0_2) ).

cnf(i_0_7,negated_conjecture,
    p(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-365hk0m3/input.p',i_0_7) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p(X1)
    | ~ c(X1) ),
    i_0_1 ).

cnf(c_0_16,negated_conjecture,
    ( g(X1)
    | c(f(X1))
    | ~ e(X1) ),
    i_0_4 ).

cnf(c_0_17,negated_conjecture,
    ( p(X1)
    | ~ s(esk1_0,X1) ),
    i_0_3 ).

cnf(c_0_18,negated_conjecture,
    ( g(X1)
    | s(X1,f(X1))
    | ~ e(X1) ),
    i_0_5 ).

cnf(c_0_19,negated_conjecture,
    e(esk1_0),
    i_0_6 ).

cnf(c_0_20,negated_conjecture,
    ( g(X1)
    | ~ e(X1)
    | ~ p(f(X1)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ( g(esk1_0)
    | p(f(esk1_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p(X1)
    | ~ g(X1) ),
    i_0_2 ).

cnf(c_0_23,negated_conjecture,
    g(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19])]) ).

cnf(c_0_24,negated_conjecture,
    p(esk1_0),
    i_0_7 ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN943+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n029.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 : Mon Jul 11 11:54:04 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.70/2.25  # ENIGMATIC: Solved by autoschedule:
% 7.70/2.25  # No SInE strategy applied
% 7.70/2.25  # Trying AutoSched0 for 150 seconds
% 7.70/2.25  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.70/2.25  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.70/2.25  #
% 7.70/2.25  # Preprocessing time       : 0.023 s
% 7.70/2.25  
% 7.70/2.25  # Proof found!
% 7.70/2.25  # SZS status Theorem
% 7.70/2.25  # SZS output start CNFRefutation
% See solution above
% 7.70/2.25  # Training examples: 0 positive, 0 negative
% 7.70/2.25  
% 7.70/2.25  # -------------------------------------------------
% 7.70/2.25  # User time                : 0.026 s
% 7.70/2.25  # System time              : 0.003 s
% 7.70/2.25  # Total time               : 0.029 s
% 7.70/2.25  # Maximum resident set size: 7120 pages
% 7.70/2.25  
%------------------------------------------------------------------------------