%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM837+1 : TPTP v8.1.0. Released v4.1.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 : Mon Jul 18 08:40:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    vplus(vd268,X1) != vd269,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mdpffa93/lgb.p',i_0_1) ).

cnf(i_0_19,plain,
    ( vplus(X1,esk1_2(X2,X1)) = X2
    | ~ less(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mdpffa93/lgb.p',i_0_19) ).

cnf(i_0_3,plain,
    less(vd268,vd269),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mdpffa93/lgb.p',i_0_3) ).

cnf(c_0_23,negated_conjecture,
    vplus(vd268,X1) != vd269,
    i_0_1 ).

cnf(c_0_24,plain,
    ( vplus(X1,esk1_2(X2,X1)) = X2
    | ~ less(X1,X2) ),
    i_0_19 ).

cnf(c_0_25,negated_conjecture,
    ( X1 != vd269
    | ~ less(vd268,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,plain,
    less(vd268,vd269),
    i_0_3 ).

cnf(c_0_27,plain,
    $false,
    inference(spm,[status(thm)],[c_0_25,c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM837+1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/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 : Thu Jul  7 15:26:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.35/2.28  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.35/2.28  # No SInE strategy applied
% 7.35/2.28  # Trying AutoSched0 for 150 seconds
% 7.35/2.28  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.35/2.28  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.35/2.28  #
% 7.35/2.28  # Preprocessing time       : 0.023 s
% 7.35/2.28  
% 7.35/2.28  # Proof found!
% 7.35/2.28  # SZS status Theorem
% 7.35/2.28  # SZS output start CNFRefutation
% See solution above
% 7.35/2.28  # Training examples: 0 positive, 0 negative
% 7.35/2.28  
% 7.35/2.28  # -------------------------------------------------
% 7.35/2.28  # User time                : 0.019 s
% 7.35/2.28  # System time              : 0.011 s
% 7.35/2.28  # Total time               : 0.031 s
% 7.35/2.28  # Maximum resident set size: 7124 pages
% 7.35/2.28  
%------------------------------------------------------------------------------