TSTP Solution File: NUM463+1 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUM463+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : n083.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.625MB
% OS       : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan  8 15:21:25 EST 2018

% Result   : Theorem 0.07s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   82 (  13 unt;   0 def)
%            Number of atoms       :  310 (  45 equ)
%            Maximal formula atoms :   28 (   3 avg)
%            Number of connectives :  369 ( 141   ~; 178   |;  39   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   68 (   0 sgn  44   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] :
      ( aNaturalNumber0(X1)
     => ( equal(sdtasdt0(X1,sz00),sz00)
        & equal(sz00,sdtasdt0(sz00,X1)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',m_MulZero) ).

fof(6,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
        | ( ~ equal(X2,X1)
          & sdtlseqdt0(X2,X1) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',mLETotal) ).

fof(10,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( ~ equal(X1,sz00)
          & ~ equal(X2,X3)
          & sdtlseqdt0(X2,X3) )
       => ( ~ equal(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
          & sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
          & ~ equal(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
          & sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',mMonMul) ).

fof(13,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( sdtlseqdt0(X1,X2)
          & sdtlseqdt0(X2,X1) )
       => equal(X1,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',mLEAsym) ).

fof(14,axiom,
    ! [X1] :
      ( aNaturalNumber0(X1)
     => ( equal(X1,sz00)
        | equal(X1,sz10)
        | ( ~ equal(sz10,X1)
          & sdtlseqdt0(sz10,X1) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',mLENTr) ).

fof(15,axiom,
    ( aNaturalNumber0(sz10)
    & ~ equal(sz10,sz00) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',mSortsC_01) ).

fof(16,conjecture,
    ( ~ equal(xm,sz00)
   => sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',m__) ).

fof(17,axiom,
    ( aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',m__987) ).

fof(23,axiom,
    aNaturalNumber0(sz00),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',mSortsC) ).

fof(26,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',mMulComm) ).

fof(28,axiom,
    ! [X1] :
      ( aNaturalNumber0(X1)
     => ( equal(sdtasdt0(X1,sz10),X1)
        & equal(X1,sdtasdt0(sz10,X1)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1',m_MulUnit) ).

fof(29,negated_conjecture,
    ~ ( ~ equal(xm,sz00)
     => sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
    inference(assume_negation,[status(cth)],[16]) ).

fof(30,plain,
    ! [X1] :
      ( ~ aNaturalNumber0(X1)
      | ( equal(sdtasdt0(X1,sz00),sz00)
        & equal(sz00,sdtasdt0(sz00,X1)) ) ),
    inference(fof_nnf,[status(thm)],[1]) ).

fof(31,plain,
    ! [X2] :
      ( ~ aNaturalNumber0(X2)
      | ( equal(sdtasdt0(X2,sz00),sz00)
        & equal(sz00,sdtasdt0(sz00,X2)) ) ),
    inference(variable_rename,[status(thm)],[30]) ).

fof(32,plain,
    ! [X2] :
      ( ( equal(sdtasdt0(X2,sz00),sz00)
        | ~ aNaturalNumber0(X2) )
      & ( equal(sz00,sdtasdt0(sz00,X2))
        | ~ aNaturalNumber0(X2) ) ),
    inference(distribute,[status(thm)],[31]) ).

cnf(33,plain,
    ( sz00 = sdtasdt0(sz00,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[32]) ).

fof(52,plain,
    ! [X1,X2] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | sdtlseqdt0(X1,X2)
      | ( ~ equal(X2,X1)
        & sdtlseqdt0(X2,X1) ) ),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(53,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | sdtlseqdt0(X3,X4)
      | ( ~ equal(X4,X3)
        & sdtlseqdt0(X4,X3) ) ),
    inference(variable_rename,[status(thm)],[52]) ).

fof(54,plain,
    ! [X3,X4] :
      ( ( ~ equal(X4,X3)
        | sdtlseqdt0(X3,X4)
        | ~ aNaturalNumber0(X3)
        | ~ aNaturalNumber0(X4) )
      & ( sdtlseqdt0(X4,X3)
        | sdtlseqdt0(X3,X4)
        | ~ aNaturalNumber0(X3)
        | ~ aNaturalNumber0(X4) ) ),
    inference(distribute,[status(thm)],[53]) ).

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

fof(71,plain,
    ! [X1,X2,X3] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X3)
      | equal(X1,sz00)
      | equal(X2,X3)
      | ~ sdtlseqdt0(X2,X3)
      | ( ~ equal(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
        & sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
        & ~ equal(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
        & sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
    inference(fof_nnf,[status(thm)],[10]) ).

fof(72,plain,
    ! [X4,X5,X6] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ~ aNaturalNumber0(X6)
      | equal(X4,sz00)
      | equal(X5,X6)
      | ~ sdtlseqdt0(X5,X6)
      | ( ~ equal(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
        & sdtlseqdt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
        & ~ equal(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
        & sdtlseqdt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)) ) ),
    inference(variable_rename,[status(thm)],[71]) ).

fof(73,plain,
    ! [X4,X5,X6] :
      ( ( ~ equal(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
        | equal(X4,sz00)
        | equal(X5,X6)
        | ~ sdtlseqdt0(X5,X6)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) )
      & ( sdtlseqdt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
        | equal(X4,sz00)
        | equal(X5,X6)
        | ~ sdtlseqdt0(X5,X6)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) )
      & ( ~ equal(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
        | equal(X4,sz00)
        | equal(X5,X6)
        | ~ sdtlseqdt0(X5,X6)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) )
      & ( sdtlseqdt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
        | equal(X4,sz00)
        | equal(X5,X6)
        | ~ sdtlseqdt0(X5,X6)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) ) ),
    inference(distribute,[status(thm)],[72]) ).

cnf(76,plain,
    ( X2 = X1
    | X3 = sz00
    | sdtlseqdt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ sdtlseqdt0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[73]) ).

fof(89,plain,
    ! [X1,X2] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | ~ sdtlseqdt0(X1,X2)
      | ~ sdtlseqdt0(X2,X1)
      | equal(X1,X2) ),
    inference(fof_nnf,[status(thm)],[13]) ).

fof(90,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | ~ sdtlseqdt0(X3,X4)
      | ~ sdtlseqdt0(X4,X3)
      | equal(X3,X4) ),
    inference(variable_rename,[status(thm)],[89]) ).

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

fof(92,plain,
    ! [X1] :
      ( ~ aNaturalNumber0(X1)
      | equal(X1,sz00)
      | equal(X1,sz10)
      | ( ~ equal(sz10,X1)
        & sdtlseqdt0(sz10,X1) ) ),
    inference(fof_nnf,[status(thm)],[14]) ).

fof(93,plain,
    ! [X2] :
      ( ~ aNaturalNumber0(X2)
      | equal(X2,sz00)
      | equal(X2,sz10)
      | ( ~ equal(sz10,X2)
        & sdtlseqdt0(sz10,X2) ) ),
    inference(variable_rename,[status(thm)],[92]) ).

fof(94,plain,
    ! [X2] :
      ( ( ~ equal(sz10,X2)
        | equal(X2,sz00)
        | equal(X2,sz10)
        | ~ aNaturalNumber0(X2) )
      & ( sdtlseqdt0(sz10,X2)
        | equal(X2,sz00)
        | equal(X2,sz10)
        | ~ aNaturalNumber0(X2) ) ),
    inference(distribute,[status(thm)],[93]) ).

cnf(95,plain,
    ( X1 = sz10
    | X1 = sz00
    | sdtlseqdt0(sz10,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[94]) ).

cnf(98,plain,
    aNaturalNumber0(sz10),
    inference(split_conjunct,[status(thm)],[15]) ).

fof(99,negated_conjecture,
    ( ~ equal(xm,sz00)
    & ~ sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
    inference(fof_nnf,[status(thm)],[29]) ).

cnf(100,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
    inference(split_conjunct,[status(thm)],[99]) ).

cnf(101,negated_conjecture,
    xm != sz00,
    inference(split_conjunct,[status(thm)],[99]) ).

cnf(102,plain,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[17]) ).

cnf(103,plain,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[17]) ).

cnf(125,plain,
    aNaturalNumber0(sz00),
    inference(split_conjunct,[status(thm)],[23]) ).

fof(134,plain,
    ! [X1,X2] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
    inference(fof_nnf,[status(thm)],[26]) ).

fof(135,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | equal(sdtasdt0(X3,X4),sdtasdt0(X4,X3)) ),
    inference(variable_rename,[status(thm)],[134]) ).

cnf(136,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[135]) ).

fof(142,plain,
    ! [X1] :
      ( ~ aNaturalNumber0(X1)
      | ( equal(sdtasdt0(X1,sz10),X1)
        & equal(X1,sdtasdt0(sz10,X1)) ) ),
    inference(fof_nnf,[status(thm)],[28]) ).

fof(143,plain,
    ! [X2] :
      ( ~ aNaturalNumber0(X2)
      | ( equal(sdtasdt0(X2,sz10),X2)
        & equal(X2,sdtasdt0(sz10,X2)) ) ),
    inference(variable_rename,[status(thm)],[142]) ).

fof(144,plain,
    ! [X2] :
      ( ( equal(sdtasdt0(X2,sz10),X2)
        | ~ aNaturalNumber0(X2) )
      & ( equal(X2,sdtasdt0(sz10,X2))
        | ~ aNaturalNumber0(X2) ) ),
    inference(distribute,[status(thm)],[143]) ).

cnf(145,plain,
    ( X1 = sdtasdt0(sz10,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[144]) ).

cnf(146,plain,
    ( sdtasdt0(X1,sz10) = X1
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[144]) ).

cnf(166,plain,
    ( sdtlseqdt0(X1,xm)
    | sdtlseqdt0(xm,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[55,103,theory(equality)]) ).

cnf(167,plain,
    ( sdtlseqdt0(X1,xn)
    | sdtlseqdt0(xn,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[55,102,theory(equality)]) ).

cnf(170,negated_conjecture,
    ( ~ sdtlseqdt0(xn,sdtasdt0(xm,xn))
    | ~ aNaturalNumber0(xm)
    | ~ aNaturalNumber0(xn) ),
    inference(spm,[status(thm)],[100,136,theory(equality)]) ).

cnf(182,negated_conjecture,
    ( ~ sdtlseqdt0(xn,sdtasdt0(xm,xn))
    | $false
    | ~ aNaturalNumber0(xn) ),
    inference(rw,[status(thm)],[170,103,theory(equality)]) ).

cnf(183,negated_conjecture,
    ( ~ sdtlseqdt0(xn,sdtasdt0(xm,xn))
    | $false
    | $false ),
    inference(rw,[status(thm)],[182,102,theory(equality)]) ).

cnf(184,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(xm,xn)),
    inference(cn,[status(thm)],[183,theory(equality)]) ).

cnf(211,plain,
    ( X1 = sz10
    | sz00 = X1
    | ~ sdtlseqdt0(X1,sz10)
    | ~ aNaturalNumber0(sz10)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[91,95,theory(equality)]) ).

cnf(212,plain,
    ( X1 = sz10
    | sz00 = X1
    | ~ sdtlseqdt0(X1,sz10)
    | $false
    | ~ aNaturalNumber0(X1) ),
    inference(rw,[status(thm)],[211,98,theory(equality)]) ).

cnf(213,plain,
    ( X1 = sz10
    | sz00 = X1
    | ~ sdtlseqdt0(X1,sz10)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[212,theory(equality)]) ).

cnf(407,plain,
    ( sz00 = X1
    | X2 = sz10
    | sdtlseqdt0(X1,sdtasdt0(X1,X2))
    | ~ sdtlseqdt0(sz10,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(sz10)
    | ~ aNaturalNumber0(X2) ),
    inference(spm,[status(thm)],[76,146,theory(equality)]) ).

cnf(423,plain,
    ( sz00 = X1
    | X2 = sz10
    | sdtlseqdt0(X1,sdtasdt0(X1,X2))
    | ~ sdtlseqdt0(sz10,X2)
    | ~ aNaturalNumber0(X1)
    | $false
    | ~ aNaturalNumber0(X2) ),
    inference(rw,[status(thm)],[407,98,theory(equality)]) ).

cnf(424,plain,
    ( sz00 = X1
    | X2 = sz10
    | sdtlseqdt0(X1,sdtasdt0(X1,X2))
    | ~ sdtlseqdt0(sz10,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(cn,[status(thm)],[423,theory(equality)]) ).

cnf(668,plain,
    ( sdtlseqdt0(xm,sz10)
    | sdtlseqdt0(sz10,xm) ),
    inference(spm,[status(thm)],[166,98,theory(equality)]) ).

cnf(700,plain,
    ( sdtlseqdt0(xn,sz00)
    | sdtlseqdt0(sz00,xn) ),
    inference(spm,[status(thm)],[167,125,theory(equality)]) ).

cnf(702,plain,
    sdtlseqdt0(xn,xn),
    inference(spm,[status(thm)],[167,102,theory(equality)]) ).

cnf(1060,plain,
    ( sz00 = xm
    | xm = sz10
    | sdtlseqdt0(sz10,xm)
    | ~ aNaturalNumber0(xm) ),
    inference(spm,[status(thm)],[213,668,theory(equality)]) ).

cnf(1065,plain,
    ( sz00 = xm
    | xm = sz10
    | sdtlseqdt0(sz10,xm)
    | $false ),
    inference(rw,[status(thm)],[1060,103,theory(equality)]) ).

cnf(1066,plain,
    ( sz00 = xm
    | xm = sz10
    | sdtlseqdt0(sz10,xm) ),
    inference(cn,[status(thm)],[1065,theory(equality)]) ).

cnf(1067,plain,
    ( xm = sz10
    | sdtlseqdt0(sz10,xm) ),
    inference(sr,[status(thm)],[1066,101,theory(equality)]) ).

cnf(8902,negated_conjecture,
    ( xm = sz10
    | sz00 = xn
    | ~ sdtlseqdt0(sz10,xm)
    | ~ aNaturalNumber0(xn)
    | ~ aNaturalNumber0(xm) ),
    inference(spm,[status(thm)],[100,424,theory(equality)]) ).

cnf(8934,negated_conjecture,
    ( xm = sz10
    | sz00 = xn
    | ~ sdtlseqdt0(sz10,xm)
    | $false
    | ~ aNaturalNumber0(xm) ),
    inference(rw,[status(thm)],[8902,102,theory(equality)]) ).

cnf(8935,negated_conjecture,
    ( xm = sz10
    | sz00 = xn
    | ~ sdtlseqdt0(sz10,xm)
    | $false
    | $false ),
    inference(rw,[status(thm)],[8934,103,theory(equality)]) ).

cnf(8936,negated_conjecture,
    ( xm = sz10
    | sz00 = xn
    | ~ sdtlseqdt0(sz10,xm) ),
    inference(cn,[status(thm)],[8935,theory(equality)]) ).

cnf(8972,negated_conjecture,
    ( xm = sz10
    | xn = sz00 ),
    inference(csr,[status(thm)],[8936,1067]) ).

cnf(8975,negated_conjecture,
    ( xm = sz10
    | ~ sdtlseqdt0(sz00,sdtasdt0(sz00,xm)) ),
    inference(spm,[status(thm)],[100,8972,theory(equality)]) ).

cnf(8978,negated_conjecture,
    ( sdtlseqdt0(sz00,sz00)
    | xm = sz10 ),
    inference(spm,[status(thm)],[700,8972,theory(equality)]) ).

cnf(9054,negated_conjecture,
    ( xm = sz10
    | ~ sdtlseqdt0(sz00,sz00)
    | ~ aNaturalNumber0(xm) ),
    inference(spm,[status(thm)],[8975,33,theory(equality)]) ).

cnf(9058,negated_conjecture,
    ( xm = sz10
    | ~ sdtlseqdt0(sz00,sz00)
    | $false ),
    inference(rw,[status(thm)],[9054,103,theory(equality)]) ).

cnf(9059,negated_conjecture,
    ( xm = sz10
    | ~ sdtlseqdt0(sz00,sz00) ),
    inference(cn,[status(thm)],[9058,theory(equality)]) ).

cnf(9066,negated_conjecture,
    xm = sz10,
    inference(csr,[status(thm)],[9059,8978]) ).

cnf(9074,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(sz10,xn)),
    inference(rw,[status(thm)],[184,9066,theory(equality)]) ).

cnf(9178,negated_conjecture,
    ( ~ sdtlseqdt0(xn,xn)
    | ~ aNaturalNumber0(xn) ),
    inference(spm,[status(thm)],[9074,145,theory(equality)]) ).

cnf(9182,negated_conjecture,
    ( $false
    | ~ aNaturalNumber0(xn) ),
    inference(rw,[status(thm)],[9178,702,theory(equality)]) ).

cnf(9183,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[9182,102,theory(equality)]) ).

cnf(9184,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[9183,theory(equality)]) ).

cnf(9185,negated_conjecture,
    $false,
    9184,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM463+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.23  % Computer : n083.star.cs.uiowa.edu
% 0.02/0.23  % Model    : x86_64 x86_64
% 0.02/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23  % Memory   : 32218.625MB
% 0.02/0.23  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23  % CPULimit : 300
% 0.02/0.23  % DateTime : Fri Jan  5 04:41:44 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.07/0.28  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.28  --creating new selector for []
% 0.07/0.47  -running prover on /export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.47  -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmp8uygFi/sel_theBenchmark.p_1']
% 0.07/0.47  -prover status Theorem
% 0.07/0.47  Problem theBenchmark.p solved in phase 0.
% 0.07/0.47  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.47  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.47  Solved 1 out of 1.
% 0.07/0.47  # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.47  # SZS status Theorem
% 0.07/0.47  # SZS output start CNFRefutation.
% See solution above
% 0.07/0.47  # SZS output end CNFRefutation
%------------------------------------------------------------------------------