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

% Computer : n022.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:36 EDT 2022

% Result   : Theorem 4.33s 2.21s
% Output   : CNFRefutation 4.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   13 (   5 unt;   3 nHn;  13 RR)
%            Number of literals    :   31 (   0 equ;  17 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
    ( big_f(esk2_0,X1)
    | big_g(X1,esk3_2(X2,X1))
    | big_g(esk2_0,esk3_2(X2,X1))
    | ~ big_f(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nt20r61/input.p',i_0_4) ).

cnf(i_0_7,negated_conjecture,
    big_f(esk1_0,esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nt20r61/input.p',i_0_7) ).

cnf(i_0_1,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_f(esk1_0,X1)
    | ~ big_f(esk2_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nt20r61/input.p',i_0_1) ).

cnf(i_0_5,negated_conjecture,
    ( big_f(esk2_0,X1)
    | ~ big_f(X2,X1)
    | ~ big_g(X1,esk3_2(X2,X1))
    | ~ big_g(esk2_0,esk3_2(X2,X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nt20r61/input.p',i_0_5) ).

cnf(c_0_12,negated_conjecture,
    ( big_f(esk2_0,X1)
    | big_g(X1,esk3_2(X2,X1))
    | big_g(esk2_0,esk3_2(X2,X1))
    | ~ big_f(X2,X1) ),
    i_0_4 ).

cnf(c_0_13,negated_conjecture,
    big_f(esk1_0,esk2_0),
    i_0_7 ).

cnf(c_0_14,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_f(esk1_0,X1)
    | ~ big_f(esk2_0,X1) ),
    i_0_1 ).

cnf(c_0_15,negated_conjecture,
    ( big_f(esk2_0,X1)
    | ~ big_f(X2,X1)
    | ~ big_g(X1,esk3_2(X2,X1))
    | ~ big_g(esk2_0,esk3_2(X2,X1)) ),
    i_0_5 ).

cnf(c_0_16,negated_conjecture,
    ( big_g(esk2_0,esk3_2(esk1_0,esk2_0))
    | big_f(esk2_0,esk2_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ big_f(esk2_0,esk2_0)
    | ~ big_f(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    big_f(esk2_0,esk2_0),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13])]),c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ~ big_f(esk2_0,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_18,c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN354+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n022.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jul 12 07:15:41 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 4.33/2.21  # ENIGMATIC: Solved by autoschedule:
% 4.33/2.21  # No SInE strategy applied
% 4.33/2.21  # Trying AutoSched0 for 150 seconds
% 4.33/2.21  # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 4.33/2.21  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.33/2.21  #
% 4.33/2.21  # Preprocessing time       : 0.023 s
% 4.33/2.21  
% 4.33/2.21  # Proof found!
% 4.33/2.21  # SZS status Theorem
% 4.33/2.21  # SZS output start CNFRefutation
% See solution above
% 4.33/2.21  # Training examples: 0 positive, 0 negative
% 4.33/2.21  
% 4.33/2.21  # -------------------------------------------------
% 4.33/2.21  # User time                : 0.021 s
% 4.33/2.21  # System time              : 0.007 s
% 4.33/2.21  # Total time               : 0.028 s
% 4.33/2.21  # Maximum resident set size: 7120 pages
% 4.33/2.21  
%------------------------------------------------------------------------------