%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN073+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:34 EDT 2022

% Result   : Theorem 4.64s 2.12s
% Output   : CNFRefutation 4.64s
% 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    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :    7 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ~ big_f(X1,esk1_1(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gy7dzxnr/input.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    ( big_f(X1,X2)
    | big_f(a,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gy7dzxnr/input.p',i_0_2) ).

cnf(c_0_5,negated_conjecture,
    ~ big_f(X1,esk1_1(X1)),
    i_0_1 ).

cnf(c_0_6,negated_conjecture,
    ( big_f(X1,X2)
    | big_f(a,X1) ),
    i_0_2 ).

cnf(c_0_7,negated_conjecture,
    big_f(a,X1),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN073+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/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 05:57:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.64/2.12  # ENIGMATIC: Solved by autoschedule:
% 4.64/2.12  # No SInE strategy applied
% 4.64/2.12  # Trying AutoSched0 for 150 seconds
% 4.64/2.12  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 4.64/2.12  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.64/2.12  #
% 4.64/2.12  # Preprocessing time       : 0.015 s
% 4.64/2.12  
% 4.64/2.12  # Proof found!
% 4.64/2.12  # SZS status Theorem
% 4.64/2.12  # SZS output start CNFRefutation
% See solution above
% 4.64/2.12  # Training examples: 0 positive, 0 negative
% 4.64/2.12  
% 4.64/2.12  # -------------------------------------------------
% 4.64/2.12  # User time                : 0.019 s
% 4.64/2.12  # System time              : 0.001 s
% 4.64/2.12  # Total time               : 0.020 s
% 4.64/2.12  # Maximum resident set size: 7124 pages
% 4.64/2.12  
%------------------------------------------------------------------------------