%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN069+1 : TPTP v8.1.0. Released v2.0.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:49:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
    ( big_g(X1)
    | big_g(esk1_1(X2))
    | ~ big_f(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccnue1n0/input.p',i_0_9) ).

cnf(i_0_13,plain,
    big_f(esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccnue1n0/input.p',i_0_13) ).

cnf(i_0_4,plain,
    ( big_k(X1)
    | big_h(X2,esk1_1(X2))
    | ~ big_f(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccnue1n0/input.p',i_0_4) ).

cnf(i_0_10,plain,
    ( ~ big_k(X1)
    | ~ big_l(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccnue1n0/input.p',i_0_10) ).

cnf(i_0_12,plain,
    ( big_l(X1)
    | ~ big_h(esk2_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccnue1n0/input.p',i_0_12) ).

cnf(i_0_1,plain,
    ( big_k(X1)
    | ~ big_f(X2)
    | ~ big_j(X2,esk1_1(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccnue1n0/input.p',i_0_1) ).

cnf(i_0_11,plain,
    ( big_j(esk2_0,X1)
    | ~ big_g(X1)
    | ~ big_h(esk2_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccnue1n0/input.p',i_0_11) ).

cnf(i_0_14,negated_conjecture,
    ( big_h(X1,esk3_1(X1))
    | ~ big_f(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccnue1n0/input.p',i_0_14) ).

cnf(c_0_23,plain,
    ( big_g(X1)
    | big_g(esk1_1(X2))
    | ~ big_f(X2) ),
    i_0_9 ).

cnf(c_0_24,plain,
    big_f(esk2_0),
    i_0_13 ).

cnf(c_0_25,plain,
    ( big_g(esk1_1(esk2_0))
    | big_g(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,plain,
    ( big_k(X1)
    | big_h(X2,esk1_1(X2))
    | ~ big_f(X2) ),
    i_0_4 ).

cnf(c_0_27,plain,
    ( ~ big_k(X1)
    | ~ big_l(X1) ),
    i_0_10 ).

cnf(c_0_28,plain,
    ( big_l(X1)
    | ~ big_h(esk2_0,X1) ),
    i_0_12 ).

cnf(c_0_29,plain,
    ( big_k(X1)
    | ~ big_f(X2)
    | ~ big_j(X2,esk1_1(X2)) ),
    i_0_1 ).

cnf(c_0_30,plain,
    ( big_j(esk2_0,X1)
    | ~ big_g(X1)
    | ~ big_h(esk2_0,X1) ),
    i_0_11 ).

cnf(c_0_31,plain,
    big_g(esk1_1(esk2_0)),
    inference(ef,[status(thm)],[c_0_25]) ).

cnf(c_0_32,plain,
    ( big_h(esk2_0,esk1_1(esk2_0))
    | big_k(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_24]) ).

cnf(c_0_33,plain,
    ( ~ big_h(esk2_0,X1)
    | ~ big_k(X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,plain,
    big_k(X1),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24]),c_0_31])]),c_0_32]) ).

cnf(c_0_35,plain,
    ~ big_h(esk2_0,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).

cnf(c_0_36,negated_conjecture,
    ( big_h(X1,esk3_1(X1))
    | ~ big_f(X1) ),
    i_0_14 ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYN069+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n029.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 18:21:04 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.85/2.35  # ENIGMATIC: Solved by autoschedule:
% 7.85/2.35  # No SInE strategy applied
% 7.85/2.35  # Trying AutoSched0 for 150 seconds
% 7.85/2.35  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.85/2.35  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.85/2.35  #
% 7.85/2.35  # Preprocessing time       : 0.023 s
% 7.85/2.35  
% 7.85/2.35  # Proof found!
% 7.85/2.35  # SZS status Theorem
% 7.85/2.35  # SZS output start CNFRefutation
% See solution above
% 7.85/2.35  # Training examples: 0 positive, 0 negative
% 7.85/2.35  
% 7.85/2.35  # -------------------------------------------------
% 7.85/2.35  # User time                : 0.022 s
% 7.85/2.35  # System time              : 0.008 s
% 7.85/2.35  # Total time               : 0.029 s
% 7.85/2.35  # Maximum resident set size: 7116 pages
% 7.85/2.35  
%------------------------------------------------------------------------------