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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_2or2tet/lgb.p',i_0_10) ).

cnf(i_0_32,hypothesis,
    aNaturalNumber0(xm),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_2or2tet/lgb.p',i_0_32) ).

cnf(i_0_34,negated_conjecture,
    ( sdtpldt0(xm,X1) != xm
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_2or2tet/lgb.p',i_0_34) ).

cnf(i_0_2,plain,
    aNaturalNumber0(sz00),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_2or2tet/lgb.p',i_0_2) ).

cnf(c_0_39,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aNaturalNumber0(X1) ),
    i_0_10 ).

cnf(c_0_40,hypothesis,
    aNaturalNumber0(xm),
    i_0_32 ).

cnf(c_0_41,negated_conjecture,
    ( sdtpldt0(xm,X1) != xm
    | ~ aNaturalNumber0(X1) ),
    i_0_34 ).

cnf(c_0_42,hypothesis,
    sdtpldt0(xm,sz00) = xm,
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_43,plain,
    aNaturalNumber0(sz00),
    i_0_2 ).

cnf(c_0_44,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM458+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n010.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Tue Jul  5 13:15:03 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.34/2.20  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.34/2.20  # No SInE strategy applied
% 7.34/2.20  # Trying AutoSched0 for 150 seconds
% 7.34/2.20  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0S
% 7.34/2.20  # and selection function SelectComplexG.
% 7.34/2.20  #
% 7.34/2.20  # Preprocessing time       : 0.023 s
% 7.34/2.20  
% 7.34/2.20  # Proof found!
% 7.34/2.20  # SZS status Theorem
% 7.34/2.20  # SZS output start CNFRefutation
% See solution above
% 7.34/2.20  # Training examples: 0 positive, 0 negative
% 7.34/2.20  
% 7.34/2.20  # -------------------------------------------------
% 7.34/2.20  # User time                : 0.024 s
% 7.34/2.20  # System time              : 0.005 s
% 7.34/2.20  # Total time               : 0.029 s
% 7.34/2.20  # Maximum resident set size: 7124 pages
% 7.34/2.20  
%------------------------------------------------------------------------------