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

% Computer : n014.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:56:47 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( ~ p(X1)
    | ~ l(esk2_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tbum8xjo/lgb.p',i_0_1) ).

cnf(i_0_6,negated_conjecture,
    ( l(X1,g(h(esk1_1(X1))))
    | ~ p(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tbum8xjo/lgb.p',i_0_6) ).

cnf(i_0_2,negated_conjecture,
    p(esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tbum8xjo/lgb.p',i_0_2) ).

cnf(i_0_4,negated_conjecture,
    ( p(g(X1))
    | ~ p(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tbum8xjo/lgb.p',i_0_4) ).

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

cnf(i_0_5,negated_conjecture,
    ( p(esk1_1(X1))
    | ~ p(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tbum8xjo/lgb.p',i_0_5) ).

cnf(c_0_13,negated_conjecture,
    ( ~ p(X1)
    | ~ l(esk2_0,X1) ),
    i_0_1 ).

cnf(c_0_14,negated_conjecture,
    ( l(X1,g(h(esk1_1(X1))))
    | ~ p(X1) ),
    i_0_6 ).

cnf(c_0_15,negated_conjecture,
    p(esk2_0),
    i_0_2 ).

cnf(c_0_16,negated_conjecture,
    ~ p(g(h(esk1_1(esk2_0)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_17,negated_conjecture,
    ( p(g(X1))
    | ~ p(X1) ),
    i_0_4 ).

cnf(c_0_18,negated_conjecture,
    ~ p(h(esk1_1(esk2_0))),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,negated_conjecture,
    ( p(h(X1))
    | ~ p(X1) ),
    i_0_3 ).

cnf(c_0_20,negated_conjecture,
    ~ p(esk1_1(esk2_0)),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    ( p(esk1_1(X1))
    | ~ p(X1) ),
    i_0_5 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15])]),
    [proof] ).

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