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

% Computer : n027.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:49:14 EDT 2022

% Result   : Theorem 7.79s 2.32s
% Output   : CNFRefutation 7.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   12 (   4 unt;   2 nHn;   9 RR)
%            Number of literals    :   20 (   0 equ;  10 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    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    5 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
    ( ~ p
    | ~ big_f(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95030j49/lgb.p',i_0_4) ).

cnf(i_0_1,plain,
    ( big_f(esk1_0)
    | ~ p ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95030j49/lgb.p',i_0_1) ).

cnf(i_0_2,plain,
    ( p
    | ~ big_f(esk2_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95030j49/lgb.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    ( p
    | big_f(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95030j49/lgb.p',i_0_3) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p
    | ~ big_f(X1) ),
    i_0_4 ).

cnf(c_0_10,plain,
    ( big_f(esk1_0)
    | ~ p ),
    i_0_1 ).

cnf(c_0_11,plain,
    ( p
    | ~ big_f(esk2_0) ),
    i_0_2 ).

cnf(c_0_12,negated_conjecture,
    ( p
    | big_f(X1) ),
    i_0_3 ).

cnf(c_0_13,plain,
    ~ p,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    ~ big_f(esk2_0),
    inference(csr,[status(thm)],[c_0_11,c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    big_f(X1),
    inference(sr,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN051+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n027.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 : Tue Jul 12 03:24:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.79/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.79/2.32  # No SInE strategy applied
% 7.79/2.32  # Trying AutoSched0 for 150 seconds
% 7.79/2.32  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.79/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.79/2.32  #
% 7.79/2.32  # Preprocessing time       : 0.013 s
% 7.79/2.32  
% 7.79/2.32  # Proof found!
% 7.79/2.32  # SZS status Theorem
% 7.79/2.32  # SZS output start CNFRefutation
% See solution above
% 7.79/2.32  # Training examples: 0 positive, 0 negative
% 7.79/2.32  
% 7.79/2.32  # -------------------------------------------------
% 7.79/2.32  # User time                : 0.014 s
% 7.79/2.32  # System time              : 0.002 s
% 7.79/2.32  # Total time               : 0.016 s
% 7.79/2.32  # Maximum resident set size: 7128 pages
% 7.79/2.32  
%------------------------------------------------------------------------------