TSTP Solution File: NUM507+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM507+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n011.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 09:33:12 EDT 2022

% Result   : Theorem 0.28s 1.45s
% Output   : CNFRefutation 0.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   65 (  16 unt;   0 def)
%            Number of atoms       :  278 (  77 equ)
%            Maximal formula atoms :   32 (   4 avg)
%            Number of connectives :  355 ( 142   ~; 151   |;  44   &)
%                                         (   2 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :   71 (   1 sgn  45   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mLEAsym,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( sdtlseqdt0(X1,X2)
          & sdtlseqdt0(X2,X1) )
       => X1 = X2 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLEAsym) ).

fof(mLETran,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( sdtlseqdt0(X1,X2)
          & sdtlseqdt0(X2,X3) )
       => sdtlseqdt0(X1,X3) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLETran) ).

fof(mLETotal,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
        | ( X2 != X1
          & sdtlseqdt0(X2,X1) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLETotal) ).

fof(m__,conjecture,
    ( sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp)
    & sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(m__2377,hypothesis,
    ( xk != xp
    & sdtlseqdt0(xk,xp) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2377) ).

fof(m__1837,hypothesis,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1837) ).

fof(m__2362,hypothesis,
    ( sdtlseqdt0(xr,xk)
    & doDivides0(xr,sdtasdt0(xn,xm)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2362) ).

fof(m__2342,hypothesis,
    ( aNaturalNumber0(xr)
    & doDivides0(xr,xk)
    & isPrime0(xr) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2342) ).

fof(mMonAdd,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( X1 != X2
          & sdtlseqdt0(X1,X2) )
       => ! [X3] :
            ( aNaturalNumber0(X3)
           => ( sdtpldt0(X3,X1) != sdtpldt0(X3,X2)
              & sdtlseqdt0(sdtpldt0(X3,X1),sdtpldt0(X3,X2))
              & sdtpldt0(X1,X3) != sdtpldt0(X2,X3)
              & sdtlseqdt0(sdtpldt0(X1,X3),sdtpldt0(X2,X3)) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMonAdd) ).

fof(mAddCanc,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( sdtpldt0(X1,X2) = sdtpldt0(X1,X3)
          | sdtpldt0(X2,X1) = sdtpldt0(X3,X1) )
       => X2 = X3 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddCanc) ).

fof(mDefPrime,axiom,
    ! [X1] :
      ( aNaturalNumber0(X1)
     => ( isPrime0(X1)
      <=> ( X1 != sz00
          & X1 != sz10
          & ! [X2] :
              ( ( aNaturalNumber0(X2)
                & doDivides0(X2,X1) )
             => ( X2 = sz10
                | X2 = X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefPrime) ).

fof(mDefQuot,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( X1 != sz00
          & doDivides0(X1,X2) )
       => ! [X3] :
            ( X3 = sdtsldt0(X2,X1)
          <=> ( aNaturalNumber0(X3)
              & X2 = sdtasdt0(X1,X3) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefQuot) ).

fof(m__1860,hypothesis,
    ( isPrime0(xp)
    & doDivides0(xp,sdtasdt0(xn,xm)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1860) ).

fof(mSortsB,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB) ).

fof(m__2306,hypothesis,
    xk = sdtsldt0(sdtasdt0(xn,xm),xp),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2306) ).

fof(mSortsB_02,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).

fof(c_0_16,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | ~ sdtlseqdt0(X3,X4)
      | ~ sdtlseqdt0(X4,X3)
      | X3 = X4 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])]) ).

fof(c_0_17,plain,
    ! [X4,X5,X6] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ~ aNaturalNumber0(X6)
      | ~ sdtlseqdt0(X4,X5)
      | ~ sdtlseqdt0(X5,X6)
      | sdtlseqdt0(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETran])]) ).

fof(c_0_18,plain,
    ! [X3,X4] :
      ( ( X4 != X3
        | sdtlseqdt0(X3,X4)
        | ~ aNaturalNumber0(X3)
        | ~ aNaturalNumber0(X4) )
      & ( sdtlseqdt0(X4,X3)
        | sdtlseqdt0(X3,X4)
        | ~ aNaturalNumber0(X3)
        | ~ aNaturalNumber0(X4) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETotal])])]) ).

fof(c_0_19,negated_conjecture,
    ~ ( sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp)
      & sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_20,plain,
    ( X1 = X2
    | ~ sdtlseqdt0(X2,X1)
    | ~ sdtlseqdt0(X1,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,hypothesis,
    sdtlseqdt0(xk,xp),
    inference(split_conjunct,[status(thm)],[m__2377]) ).

cnf(c_0_22,hypothesis,
    aNaturalNumber0(xp),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_23,hypothesis,
    xk != xp,
    inference(split_conjunct,[status(thm)],[m__2377]) ).

cnf(c_0_24,plain,
    ( sdtlseqdt0(X1,X2)
    | ~ sdtlseqdt0(X3,X2)
    | ~ sdtlseqdt0(X1,X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_25,hypothesis,
    sdtlseqdt0(xr,xk),
    inference(split_conjunct,[status(thm)],[m__2362]) ).

cnf(c_0_26,hypothesis,
    aNaturalNumber0(xr),
    inference(split_conjunct,[status(thm)],[m__2342]) ).

cnf(c_0_27,plain,
    ( sdtlseqdt0(X2,X1)
    | sdtlseqdt0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_28,negated_conjecture,
    ( sdtpldt0(sdtpldt0(xn,xm),xr) = sdtpldt0(sdtpldt0(xn,xm),xp)
    | ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
    inference(fof_nnf,[status(thm)],[c_0_19]) ).

fof(c_0_29,plain,
    ! [X4,X5,X6] :
      ( ( sdtpldt0(X6,X4) != sdtpldt0(X6,X5)
        | ~ aNaturalNumber0(X6)
        | X4 = X5
        | ~ sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( sdtlseqdt0(sdtpldt0(X6,X4),sdtpldt0(X6,X5))
        | ~ aNaturalNumber0(X6)
        | X4 = X5
        | ~ sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( sdtpldt0(X4,X6) != sdtpldt0(X5,X6)
        | ~ aNaturalNumber0(X6)
        | X4 = X5
        | ~ sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( sdtlseqdt0(sdtpldt0(X4,X6),sdtpldt0(X5,X6))
        | ~ aNaturalNumber0(X6)
        | X4 = X5
        | ~ sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMonAdd])])])])])]) ).

cnf(c_0_30,hypothesis,
    ( ~ sdtlseqdt0(xp,xk)
    | ~ aNaturalNumber0(xk) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]) ).

cnf(c_0_31,hypothesis,
    ( sdtlseqdt0(X1,xk)
    | ~ sdtlseqdt0(X1,xr)
    | ~ aNaturalNumber0(xk)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

cnf(c_0_32,hypothesis,
    ( sdtlseqdt0(xr,X1)
    | sdtlseqdt0(X1,xr)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_26]) ).

cnf(c_0_33,negated_conjecture,
    ( sdtpldt0(sdtpldt0(xn,xm),xr) = sdtpldt0(sdtpldt0(xn,xm),xp)
    | ~ sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_34,plain,
    ( X2 = X1
    | sdtlseqdt0(sdtpldt0(X3,X2),sdtpldt0(X3,X1))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ sdtlseqdt0(X2,X1)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_35,hypothesis,
    ( ~ sdtlseqdt0(xp,xr)
    | ~ aNaturalNumber0(xk) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22])]) ).

cnf(c_0_36,hypothesis,
    ( sdtlseqdt0(xp,xr)
    | sdtlseqdt0(xr,xp) ),
    inference(spm,[status(thm)],[c_0_32,c_0_22]) ).

fof(c_0_37,plain,
    ! [X4,X5,X6] :
      ( ( sdtpldt0(X4,X5) != sdtpldt0(X4,X6)
        | X5 = X6
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) )
      & ( sdtpldt0(X5,X4) != sdtpldt0(X6,X4)
        | X5 = X6
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddCanc])])]) ).

cnf(c_0_38,negated_conjecture,
    ( sdtpldt0(sdtpldt0(xn,xm),xp) = sdtpldt0(sdtpldt0(xn,xm),xr)
    | xp = xr
    | ~ sdtlseqdt0(xr,xp)
    | ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26]),c_0_22])]) ).

cnf(c_0_39,hypothesis,
    ( sdtlseqdt0(xr,xp)
    | ~ aNaturalNumber0(xk) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

fof(c_0_40,plain,
    ! [X3,X4] :
      ( ( X3 != sz00
        | ~ isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( X3 != sz10
        | ~ isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( ~ aNaturalNumber0(X4)
        | ~ doDivides0(X4,X3)
        | X4 = sz10
        | X4 = X3
        | ~ isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( aNaturalNumber0(esk3_1(X3))
        | X3 = sz00
        | X3 = sz10
        | isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( doDivides0(esk3_1(X3),X3)
        | X3 = sz00
        | X3 = sz10
        | isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( esk3_1(X3) != sz10
        | X3 = sz00
        | X3 = sz10
        | isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( esk3_1(X3) != X3
        | X3 = sz00
        | X3 = sz10
        | isPrime0(X3)
        | ~ aNaturalNumber0(X3) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefPrime])])])])])])]) ).

cnf(c_0_41,plain,
    ( X2 = X1
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | sdtpldt0(X3,X2) != sdtpldt0(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    ( sdtpldt0(sdtpldt0(xn,xm),xp) = sdtpldt0(sdtpldt0(xn,xm),xr)
    | xp = xr
    | ~ aNaturalNumber0(sdtpldt0(xn,xm))
    | ~ aNaturalNumber0(xk) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

fof(c_0_43,plain,
    ! [X4,X5,X6,X6] :
      ( ( aNaturalNumber0(X6)
        | X6 != sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( X5 = sdtasdt0(X4,X6)
        | X6 != sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( ~ aNaturalNumber0(X6)
        | X5 != sdtasdt0(X4,X6)
        | X6 = sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])])])]) ).

cnf(c_0_44,plain,
    ( ~ aNaturalNumber0(X1)
    | ~ isPrime0(X1)
    | X1 != sz00 ),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_45,hypothesis,
    isPrime0(xp),
    inference(split_conjunct,[status(thm)],[m__1860]) ).

cnf(c_0_46,negated_conjecture,
    ( xp = xr
    | xp = X1
    | sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),X1)
    | ~ aNaturalNumber0(sdtpldt0(xn,xm))
    | ~ aNaturalNumber0(xk)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_22])]) ).

fof(c_0_47,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | aNaturalNumber0(sdtpldt0(X3,X4)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).

cnf(c_0_48,plain,
    ( X2 = sz00
    | aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ doDivides0(X2,X1)
    | X3 != sdtsldt0(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_49,hypothesis,
    xk = sdtsldt0(sdtasdt0(xn,xm),xp),
    inference(split_conjunct,[status(thm)],[m__2306]) ).

cnf(c_0_50,hypothesis,
    doDivides0(xp,sdtasdt0(xn,xm)),
    inference(split_conjunct,[status(thm)],[m__1860]) ).

cnf(c_0_51,hypothesis,
    sz00 != xp,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_22])]) ).

fof(c_0_52,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | aNaturalNumber0(sdtasdt0(X3,X4)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).

cnf(c_0_53,negated_conjecture,
    ( xp = xr
    | ~ aNaturalNumber0(sdtpldt0(xn,xm))
    | ~ aNaturalNumber0(xk) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_26])]) ).

cnf(c_0_54,plain,
    ( aNaturalNumber0(sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_55,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_56,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_57,hypothesis,
    ( aNaturalNumber0(X1)
    | X1 != xk
    | ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_22])]),c_0_51]) ).

cnf(c_0_58,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_59,negated_conjecture,
    ( xp = xr
    | ~ aNaturalNumber0(xk) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56])]) ).

cnf(c_0_60,hypothesis,
    ( aNaturalNumber0(X1)
    | X1 != xk ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_55]),c_0_56])]) ).

cnf(c_0_61,hypothesis,
    xp = xr,
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_62,hypothesis,
    sdtlseqdt0(xr,xr),
    inference(spm,[status(thm)],[c_0_32,c_0_26]) ).

cnf(c_0_63,hypothesis,
    ~ aNaturalNumber0(xk),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_61]),c_0_62])]) ).

cnf(c_0_64,hypothesis,
    $false,
    inference(spm,[status(thm)],[c_0_63,c_0_60]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem  : NUM507+1 : TPTP v8.1.0. Released v4.0.0.
% 0.15/0.15  % Command  : run_ET %s %d
% 0.15/0.37  % Computer : n011.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.22/0.37  % CPULimit : 300
% 0.22/0.37  % WCLimit  : 600
% 0.22/0.37  % DateTime : Tue Jul  5 21:26:52 EDT 2022
% 0.22/0.37  % CPUTime  : 
% 0.28/1.45  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.45  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.45  # Preprocessing time       : 0.022 s
% 0.28/1.45  
% 0.28/1.45  # Proof found!
% 0.28/1.45  # SZS status Theorem
% 0.28/1.45  # SZS output start CNFRefutation
% See solution above
% 0.28/1.45  # Proof object total steps             : 65
% 0.28/1.45  # Proof object clause steps            : 38
% 0.28/1.45  # Proof object formula steps           : 27
% 0.28/1.45  # Proof object conjectures             : 9
% 0.28/1.45  # Proof object clause conjectures      : 6
% 0.28/1.45  # Proof object formula conjectures     : 3
% 0.28/1.45  # Proof object initial clauses used    : 20
% 0.28/1.45  # Proof object initial formulas used   : 16
% 0.28/1.45  # Proof object generating inferences   : 17
% 0.28/1.45  # Proof object simplifying inferences  : 29
% 0.28/1.45  # Training examples: 0 positive, 0 negative
% 0.28/1.45  # Parsed axioms                        : 51
% 0.28/1.45  # Removed by relevancy pruning/SinE    : 1
% 0.28/1.45  # Initial clauses                      : 92
% 0.28/1.45  # Removed in clause preprocessing      : 3
% 0.28/1.45  # Initial clauses in saturation        : 89
% 0.28/1.45  # Processed clauses                    : 451
% 0.28/1.45  # ...of these trivial                  : 1
% 0.28/1.45  # ...subsumed                          : 172
% 0.28/1.45  # ...remaining for further processing  : 278
% 0.28/1.45  # Other redundant clauses eliminated   : 26
% 0.28/1.45  # Clauses deleted for lack of memory   : 0
% 0.28/1.45  # Backward-subsumed                    : 30
% 0.28/1.45  # Backward-rewritten                   : 78
% 0.28/1.45  # Generated clauses                    : 1851
% 0.28/1.45  # ...of the previous two non-trivial   : 1771
% 0.28/1.45  # Contextual simplify-reflections      : 49
% 0.28/1.45  # Paramodulations                      : 1803
% 0.28/1.45  # Factorizations                       : 0
% 0.28/1.45  # Equation resolutions                 : 48
% 0.28/1.45  # Current number of processed clauses  : 169
% 0.28/1.45  #    Positive orientable unit clauses  : 18
% 0.28/1.45  #    Positive unorientable unit clauses: 0
% 0.28/1.45  #    Negative unit clauses             : 6
% 0.28/1.45  #    Non-unit-clauses                  : 145
% 0.28/1.45  # Current number of unprocessed clauses: 1084
% 0.28/1.45  # ...number of literals in the above   : 6390
% 0.28/1.45  # Current number of archived formulas  : 0
% 0.28/1.45  # Current number of archived clauses   : 108
% 0.28/1.45  # Clause-clause subsumption calls (NU) : 8587
% 0.28/1.45  # Rec. Clause-clause subsumption calls : 3671
% 0.28/1.45  # Non-unit clause-clause subsumptions  : 229
% 0.28/1.45  # Unit Clause-clause subsumption calls : 607
% 0.28/1.45  # Rewrite failures with RHS unbound    : 0
% 0.28/1.45  # BW rewrite match attempts            : 4
% 0.28/1.45  # BW rewrite match successes           : 4
% 0.28/1.45  # Condensation attempts                : 0
% 0.28/1.45  # Condensation successes               : 0
% 0.28/1.45  # Termbank termtop insertions          : 37658
% 0.28/1.45  
% 0.28/1.45  # -------------------------------------------------
% 0.28/1.45  # User time                : 0.085 s
% 0.28/1.45  # System time              : 0.005 s
% 0.28/1.45  # Total time               : 0.090 s
% 0.28/1.45  # Maximum resident set size: 4752 pages
% 0.28/23.46  eprover: CPU time limit exceeded, terminating
% 0.28/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47  eprover: No such file or directory
% 0.28/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47  eprover: No such file or directory
% 0.28/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48  eprover: No such file or directory
% 0.28/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48  eprover: No such file or directory
% 0.28/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48  eprover: No such file or directory
% 0.28/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49  eprover: No such file or directory
% 0.28/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49  eprover: No such file or directory
% 0.28/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50  eprover: No such file or directory
% 0.28/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50  eprover: No such file or directory
% 0.28/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50  eprover: No such file or directory
% 0.28/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.51  eprover: No such file or directory
%------------------------------------------------------------------------------