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

% Computer : n025.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:39 EDT 2022

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

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

cnf(i_0_1,plain,
    ( big_f(X1)
    | big_f(f(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkmphw9x/lgb.p',i_0_1) ).

cnf(i_0_2,plain,
    ( ~ big_f(X1)
    | ~ big_f(f(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkmphw9x/lgb.p',i_0_2) ).

cnf(c_0_7,negated_conjecture,
    ( big_f(f(X1))
    | ~ big_f(X1) ),
    i_0_3 ).

cnf(c_0_8,plain,
    ( big_f(X1)
    | big_f(f(X1)) ),
    i_0_1 ).

cnf(c_0_9,plain,
    ( ~ big_f(X1)
    | ~ big_f(f(X1)) ),
    i_0_2 ).

cnf(c_0_10,negated_conjecture,
    big_f(f(X1)),
    inference(csr,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    ~ big_f(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_10,c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN081+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n025.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul 11 16:39:19 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.91/2.40  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.91/2.40  # No SInE strategy applied
% 7.91/2.40  # Trying AutoSched0 for 150 seconds
% 7.91/2.40  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.91/2.40  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.91/2.40  #
% 7.91/2.40  # Preprocessing time       : 0.024 s
% 7.91/2.40  
% 7.91/2.40  # Proof found!
% 7.91/2.40  # SZS status Theorem
% 7.91/2.40  # SZS output start CNFRefutation
% See solution above
% 7.91/2.40  # Training examples: 0 positive, 0 negative
% 7.91/2.40  
% 7.91/2.40  # -------------------------------------------------
% 7.91/2.40  # User time                : 0.022 s
% 7.91/2.40  # System time              : 0.006 s
% 7.91/2.40  # Total time               : 0.029 s
% 7.91/2.40  # Maximum resident set size: 7124 pages
% 7.91/2.40  
%------------------------------------------------------------------------------