%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN343+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:51:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
    ( big_f(X1,X2)
    | big_f(X1,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_66gpt73/input.p',i_0_3) ).

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

cnf(c_0_6,negated_conjecture,
    ( big_f(X1,X2)
    | big_f(X1,X1) ),
    i_0_3 ).

cnf(c_0_7,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_f(X3,X3) ),
    i_0_1 ).

cnf(c_0_8,negated_conjecture,
    big_f(X1,X1),
    inference(ef,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ~ big_f(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SYN343+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n027.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 20:54:51 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.32/2.29  # ENIGMATIC: Solved by autoschedule:
% 7.32/2.29  # No SInE strategy applied
% 7.32/2.29  # Trying AutoSched0 for 150 seconds
% 7.32/2.29  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.32/2.29  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.32/2.29  #
% 7.32/2.29  # Preprocessing time       : 0.012 s
% 7.32/2.29  
% 7.32/2.29  # Proof found!
% 7.32/2.29  # SZS status Theorem
% 7.32/2.29  # SZS output start CNFRefutation
% See solution above
% 7.32/2.29  # Training examples: 0 positive, 0 negative
% 7.32/2.29  
% 7.32/2.29  # -------------------------------------------------
% 7.32/2.29  # User time                : 0.013 s
% 7.32/2.29  # System time              : 0.003 s
% 7.32/2.29  # Total time               : 0.016 s
% 7.32/2.29  # Maximum resident set size: 7120 pages
% 7.32/2.29  
%------------------------------------------------------------------------------