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

% Computer : n008.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:51:45 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2,negated_conjecture,
    ( big_p(X1,esk1_1(X1),f(esk1_1(X1)))
    | big_p(a,esk1_1(X1),h(esk1_1(X1))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rjelprcc/lgb.p',i_0_2) ).

cnf(i_0_1,negated_conjecture,
    ~ big_p(X1,esk1_1(X1),X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rjelprcc/lgb.p',i_0_1) ).

cnf(c_0_5,negated_conjecture,
    ( big_p(X1,esk1_1(X1),f(esk1_1(X1)))
    | big_p(a,esk1_1(X1),h(esk1_1(X1))) ),
    i_0_2 ).

cnf(c_0_6,negated_conjecture,
    ~ big_p(X1,esk1_1(X1),X2),
    i_0_1 ).

cnf(c_0_7,negated_conjecture,
    big_p(a,esk1_1(X1),h(esk1_1(X1))),
    inference(sr,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_6,c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN370+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n008.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 18:21:55 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.47/2.31  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.47/2.31  # No SInE strategy applied
% 7.47/2.31  # Trying AutoSched0 for 150 seconds
% 7.47/2.31  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 7.47/2.31  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.47/2.31  #
% 7.47/2.31  # Preprocessing time       : 0.012 s
% 7.47/2.31  
% 7.47/2.31  # Proof found!
% 7.47/2.31  # SZS status Theorem
% 7.47/2.31  # SZS output start CNFRefutation
% See solution above
% 7.47/2.31  # Training examples: 0 positive, 0 negative
% 7.47/2.31  
% 7.47/2.31  # -------------------------------------------------
% 7.47/2.31  # User time                : 0.011 s
% 7.47/2.31  # System time              : 0.008 s
% 7.47/2.31  # Total time               : 0.018 s
% 7.47/2.31  # Maximum resident set size: 7128 pages
% 7.47/2.31  
%------------------------------------------------------------------------------