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

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

% Result   : Theorem 7.71s 2.40s
% Output   : CNFRefutation 7.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   18 (   3 unt;  13 nHn;   6 RR)
%            Number of literals    :   53 (   0 equ;  19 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   31 (  26 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
    ( big_p(X1)
    | big_p(X2)
    | big_p(esk3_0)
    | big_p(esk1_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ssd6s5yf/lgb.p',i_0_5) ).

cnf(i_0_2,negated_conjecture,
    ( big_p(X1)
    | big_p(esk4_0)
    | ~ big_p(X2)
    | ~ big_p(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ssd6s5yf/lgb.p',i_0_2) ).

cnf(i_0_4,negated_conjecture,
    ( big_p(X1)
    | big_p(X2)
    | ~ big_p(X3)
    | ~ big_p(esk4_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ssd6s5yf/lgb.p',i_0_4) ).

cnf(i_0_8,negated_conjecture,
    ( ~ big_p(X1)
    | ~ big_p(X2)
    | ~ big_p(esk2_0)
    | ~ big_p(esk1_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ssd6s5yf/lgb.p',i_0_8) ).

cnf(c_0_13,negated_conjecture,
    ( big_p(X1)
    | big_p(X2)
    | big_p(esk3_0)
    | big_p(esk1_1(X1)) ),
    i_0_5 ).

cnf(c_0_14,negated_conjecture,
    ( big_p(X1)
    | big_p(esk4_0)
    | ~ big_p(X2)
    | ~ big_p(X3) ),
    i_0_2 ).

cnf(c_0_15,negated_conjecture,
    ( big_p(esk1_1(X1))
    | big_p(esk3_0)
    | big_p(X1) ),
    inference(ef,[status(thm)],[c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ( big_p(esk3_0)
    | big_p(esk4_0)
    | ~ big_p(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]),c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    ( big_p(esk4_0)
    | big_p(esk3_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    ( big_p(esk4_0)
    | big_p(X1)
    | ~ big_p(X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_17]) ).

cnf(c_0_19,negated_conjecture,
    ( big_p(esk4_0)
    | big_p(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    ( big_p(X1)
    | big_p(X2)
    | ~ big_p(X3)
    | ~ big_p(esk4_0) ),
    i_0_4 ).

cnf(c_0_21,negated_conjecture,
    big_p(esk4_0),
    inference(ef,[status(thm)],[c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    ( big_p(X1)
    | big_p(X2)
    | ~ big_p(X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).

cnf(c_0_23,negated_conjecture,
    ( big_p(X1)
    | big_p(X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ big_p(X1)
    | ~ big_p(X2)
    | ~ big_p(esk2_0)
    | ~ big_p(esk1_1(X1)) ),
    i_0_8 ).

cnf(c_0_25,negated_conjecture,
    big_p(X1),
    inference(ef,[status(thm)],[c_0_23]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n017.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 : Mon Jul 11 15:50:21 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.71/2.40  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.71/2.40  # No SInE strategy applied
% 7.71/2.40  # Trying AutoSched0 for 150 seconds
% 7.71/2.40  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.71/2.40  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.71/2.40  #
% 7.71/2.40  # Preprocessing time       : 0.017 s
% 7.71/2.40  
% 7.71/2.40  # Proof found!
% 7.71/2.40  # SZS status Theorem
% 7.71/2.40  # SZS output start CNFRefutation
% See solution above
% 7.71/2.40  # Training examples: 0 positive, 0 negative
% 7.71/2.40  
% 7.71/2.40  # -------------------------------------------------
% 7.71/2.40  # User time                : 0.016 s
% 7.71/2.40  # System time              : 0.006 s
% 7.71/2.40  # Total time               : 0.022 s
% 7.71/2.40  # Maximum resident set size: 7124 pages
% 7.71/2.40  
%------------------------------------------------------------------------------