↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM514+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art02.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 19:47:54 EST 2010

% Result   : Theorem 1.42s
% Output   : Solution 1.42s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP7848/NUM514+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP7848/NUM514+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7848/NUM514+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC  time limit is 120s
% TreeLimitedRun: PID is 7944
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aNaturalNumber0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(4, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(27, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(28, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>((~(X1=sz00)&doDivides0(X1,X2))=>![X3]:(X3=sdtsldt0(X2,X1)<=>(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3))))),file('/tmp/SRASS.s.p', mDefQuot)).
% fof(34, axiom,![X1]:(aNaturalNumber0(X1)=>(isPrime0(X1)<=>((~(X1=sz00)&~(X1=sz10))&![X2]:((aNaturalNumber0(X2)&doDivides0(X2,X1))=>(X2=sz10|X2=X1))))),file('/tmp/SRASS.s.p', mDefPrime)).
% fof(36, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(38, axiom,(isPrime0(xp)&doDivides0(xp,sdtasdt0(xn,xm))),file('/tmp/SRASS.s.p', m__1860)).
% fof(42, axiom,xk=sdtsldt0(sdtasdt0(xn,xm),xp),file('/tmp/SRASS.s.p', m__2306)).
% fof(45, axiom,((aNaturalNumber0(xr)&doDivides0(xr,xk))&isPrime0(xr)),file('/tmp/SRASS.s.p', m__2342)).
% fof(46, axiom,(sdtlseqdt0(xr,xk)&doDivides0(xr,sdtasdt0(xn,xm))),file('/tmp/SRASS.s.p', m__2362)).
% fof(52, axiom,sdtasdt0(xp,sdtsldt0(xk,xr))=sdtasdt0(sdtsldt0(xn,xr),xm),file('/tmp/SRASS.s.p', m__2613)).
% fof(56, conjecture,doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),file('/tmp/SRASS.s.p', m__)).
% fof(57, negated_conjecture,~(doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))),inference(assume_negation,[status(cth)],[56])).
% fof(62, negated_conjecture,~(doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))),inference(fof_simplification,[status(thm)],[57,theory(equality)])).
% cnf(63,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(69, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(70, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[69])).
% cnf(71,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[70])).
% fof(171, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(doDivides0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&(![X3]:(~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|doDivides0(X1,X2)))),inference(fof_nnf,[status(thm)],[27])).
% fof(172, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(variable_rename,[status(thm)],[171])).
% fof(173, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|(aNaturalNumber0(esk2_2(X4,X5))&X5=sdtasdt0(X4,esk2_2(X4,X5))))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[172])).
% fof(174, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aNaturalNumber0(esk2_2(X4,X5))&X5=sdtasdt0(X4,esk2_2(X4,X5)))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[173])).
% fof(175, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk2_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((X5=sdtasdt0(X4,esk2_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[174])).
% cnf(176,plain,(X1=sdtasdt0(X2,esk2_2(X2,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)),inference(split_conjunct,[status(thm)],[175])).
% cnf(177,plain,(aNaturalNumber0(esk2_2(X2,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)),inference(split_conjunct,[status(thm)],[175])).
% cnf(178,plain,(doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|X1!=sdtasdt0(X2,X3)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[175])).
% fof(179, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((X1=sz00|~(doDivides0(X1,X2)))|![X3]:((~(X3=sdtsldt0(X2,X1))|(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&((~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|X3=sdtsldt0(X2,X1))))),inference(fof_nnf,[status(thm)],[28])).
% fof(180, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((X4=sz00|~(doDivides0(X4,X5)))|![X6]:((~(X6=sdtsldt0(X5,X4))|(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&((~(aNaturalNumber0(X6))|~(X5=sdtasdt0(X4,X6)))|X6=sdtsldt0(X5,X4))))),inference(variable_rename,[status(thm)],[179])).
% fof(181, plain,![X4]:![X5]:![X6]:((((~(X6=sdtsldt0(X5,X4))|(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&((~(aNaturalNumber0(X6))|~(X5=sdtasdt0(X4,X6)))|X6=sdtsldt0(X5,X4)))|(X4=sz00|~(doDivides0(X4,X5))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[180])).
% fof(182, plain,![X4]:![X5]:![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)],[181])).
% cnf(185,plain,(X2=sz00|aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)|X3!=sdtsldt0(X1,X2)),inference(split_conjunct,[status(thm)],[182])).
% fof(202, plain,![X1]:(~(aNaturalNumber0(X1))|((~(isPrime0(X1))|((~(X1=sz00)&~(X1=sz10))&![X2]:((~(aNaturalNumber0(X2))|~(doDivides0(X2,X1)))|(X2=sz10|X2=X1))))&(((X1=sz00|X1=sz10)|?[X2]:((aNaturalNumber0(X2)&doDivides0(X2,X1))&(~(X2=sz10)&~(X2=X1))))|isPrime0(X1)))),inference(fof_nnf,[status(thm)],[34])).
% fof(203, plain,![X3]:(~(aNaturalNumber0(X3))|((~(isPrime0(X3))|((~(X3=sz00)&~(X3=sz10))&![X4]:((~(aNaturalNumber0(X4))|~(doDivides0(X4,X3)))|(X4=sz10|X4=X3))))&(((X3=sz00|X3=sz10)|?[X5]:((aNaturalNumber0(X5)&doDivides0(X5,X3))&(~(X5=sz10)&~(X5=X3))))|isPrime0(X3)))),inference(variable_rename,[status(thm)],[202])).
% fof(204, plain,![X3]:(~(aNaturalNumber0(X3))|((~(isPrime0(X3))|((~(X3=sz00)&~(X3=sz10))&![X4]:((~(aNaturalNumber0(X4))|~(doDivides0(X4,X3)))|(X4=sz10|X4=X3))))&(((X3=sz00|X3=sz10)|((aNaturalNumber0(esk3_1(X3))&doDivides0(esk3_1(X3),X3))&(~(esk3_1(X3)=sz10)&~(esk3_1(X3)=X3))))|isPrime0(X3)))),inference(skolemize,[status(esa)],[203])).
% fof(205, plain,![X3]:![X4]:((((((~(aNaturalNumber0(X4))|~(doDivides0(X4,X3)))|(X4=sz10|X4=X3))&(~(X3=sz00)&~(X3=sz10)))|~(isPrime0(X3)))&(((X3=sz00|X3=sz10)|((aNaturalNumber0(esk3_1(X3))&doDivides0(esk3_1(X3),X3))&(~(esk3_1(X3)=sz10)&~(esk3_1(X3)=X3))))|isPrime0(X3)))|~(aNaturalNumber0(X3))),inference(shift_quantors,[status(thm)],[204])).
% fof(206, plain,![X3]:![X4]:((((((~(aNaturalNumber0(X4))|~(doDivides0(X4,X3)))|(X4=sz10|X4=X3))|~(isPrime0(X3)))|~(aNaturalNumber0(X3)))&(((~(X3=sz00)|~(isPrime0(X3)))|~(aNaturalNumber0(X3)))&((~(X3=sz10)|~(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)],[205])).
% cnf(212,plain,(~aNaturalNumber0(X1)|~isPrime0(X1)|X1!=sz00),inference(split_conjunct,[status(thm)],[206])).
% cnf(221,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[36])).
% cnf(222,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[36])).
% cnf(223,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[36])).
% cnf(227,plain,(doDivides0(xp,sdtasdt0(xn,xm))),inference(split_conjunct,[status(thm)],[38])).
% cnf(228,plain,(isPrime0(xp)),inference(split_conjunct,[status(thm)],[38])).
% cnf(235,plain,(xk=sdtsldt0(sdtasdt0(xn,xm),xp)),inference(split_conjunct,[status(thm)],[42])).
% cnf(241,plain,(isPrime0(xr)),inference(split_conjunct,[status(thm)],[45])).
% cnf(242,plain,(doDivides0(xr,xk)),inference(split_conjunct,[status(thm)],[45])).
% cnf(243,plain,(aNaturalNumber0(xr)),inference(split_conjunct,[status(thm)],[45])).
% cnf(244,plain,(doDivides0(xr,sdtasdt0(xn,xm))),inference(split_conjunct,[status(thm)],[46])).
% cnf(254,plain,(sdtasdt0(xp,sdtsldt0(xk,xr))=sdtasdt0(sdtsldt0(xn,xr),xm)),inference(split_conjunct,[status(thm)],[52])).
% cnf(266,negated_conjecture,(~doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))),inference(split_conjunct,[status(thm)],[62])).
% cnf(268,negated_conjecture,(~doDivides0(xp,sdtasdt0(xp,sdtsldt0(xk,xr)))),inference(rw,[status(thm)],[266,254,theory(equality)])).
% cnf(270,plain,(~isPrime0(sz00)|~aNaturalNumber0(sz00)),inference(er,[status(thm)],[212,theory(equality)])).
% cnf(271,plain,(~isPrime0(sz00)|$false),inference(rw,[status(thm)],[270,63,theory(equality)])).
% cnf(272,plain,(~isPrime0(sz00)),inference(cn,[status(thm)],[271,theory(equality)])).
% cnf(349,plain,(aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))|~aNaturalNumber0(xr)|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(spm,[status(thm)],[177,244,theory(equality)])).
% cnf(356,plain,(aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))|$false|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(rw,[status(thm)],[349,243,theory(equality)])).
% cnf(357,plain,(aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(cn,[status(thm)],[356,theory(equality)])).
% cnf(360,plain,(doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(sdtasdt0(X1,X2))),inference(er,[status(thm)],[178,theory(equality)])).
% cnf(529,plain,(sdtasdt0(xr,esk2_2(xr,sdtasdt0(xn,xm)))=sdtasdt0(xn,xm)|~aNaturalNumber0(xr)|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(spm,[status(thm)],[176,244,theory(equality)])).
% cnf(536,plain,(sdtasdt0(xr,esk2_2(xr,sdtasdt0(xn,xm)))=sdtasdt0(xn,xm)|$false|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(rw,[status(thm)],[529,243,theory(equality)])).
% cnf(537,plain,(sdtasdt0(xr,esk2_2(xr,sdtasdt0(xn,xm)))=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(cn,[status(thm)],[536,theory(equality)])).
% cnf(627,plain,(sz00=X1|aNaturalNumber0(sdtsldt0(X2,X1))|~doDivides0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(er,[status(thm)],[185,theory(equality)])).
% cnf(1422,plain,(sdtasdt0(xr,esk2_2(xr,sdtasdt0(xn,xm)))=sdtasdt0(xn,xm)|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[537,71,theory(equality)])).
% cnf(1423,plain,(sdtasdt0(xr,esk2_2(xr,sdtasdt0(xn,xm)))=sdtasdt0(xn,xm)|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[1422,222,theory(equality)])).
% cnf(1424,plain,(sdtasdt0(xr,esk2_2(xr,sdtasdt0(xn,xm)))=sdtasdt0(xn,xm)|$false|$false),inference(rw,[status(thm)],[1423,223,theory(equality)])).
% cnf(1425,plain,(sdtasdt0(xr,esk2_2(xr,sdtasdt0(xn,xm)))=sdtasdt0(xn,xm)),inference(cn,[status(thm)],[1424,theory(equality)])).
% cnf(1429,plain,(aNaturalNumber0(sdtasdt0(xn,xm))|~aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))|~aNaturalNumber0(xr)),inference(spm,[status(thm)],[71,1425,theory(equality)])).
% cnf(1448,plain,(aNaturalNumber0(sdtasdt0(xn,xm))|~aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))|$false),inference(rw,[status(thm)],[1429,243,theory(equality)])).
% cnf(1449,plain,(aNaturalNumber0(sdtasdt0(xn,xm))|~aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))),inference(cn,[status(thm)],[1448,theory(equality)])).
% cnf(1633,plain,(aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[357,71,theory(equality)])).
% cnf(1634,plain,(aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[1633,222,theory(equality)])).
% cnf(1635,plain,(aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))|$false|$false),inference(rw,[status(thm)],[1634,223,theory(equality)])).
% cnf(1636,plain,(aNaturalNumber0(esk2_2(xr,sdtasdt0(xn,xm)))),inference(cn,[status(thm)],[1635,theory(equality)])).
% cnf(1637,plain,(aNaturalNumber0(sdtasdt0(xn,xm))|$false),inference(rw,[status(thm)],[1449,1636,theory(equality)])).
% cnf(1638,plain,(aNaturalNumber0(sdtasdt0(xn,xm))),inference(cn,[status(thm)],[1637,theory(equality)])).
% cnf(2820,plain,(doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[360,71])).
% cnf(2821,negated_conjecture,(~aNaturalNumber0(sdtsldt0(xk,xr))|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[268,2820,theory(equality)])).
% cnf(2849,negated_conjecture,(~aNaturalNumber0(sdtsldt0(xk,xr))|$false),inference(rw,[status(thm)],[2821,221,theory(equality)])).
% cnf(2850,negated_conjecture,(~aNaturalNumber0(sdtsldt0(xk,xr))),inference(cn,[status(thm)],[2849,theory(equality)])).
% cnf(12018,plain,(sz00=xr|aNaturalNumber0(sdtsldt0(xk,xr))|~aNaturalNumber0(xr)|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[627,242,theory(equality)])).
% cnf(12021,plain,(sz00=xp|aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xp))|~aNaturalNumber0(xp)|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(spm,[status(thm)],[627,227,theory(equality)])).
% cnf(12104,plain,(sz00=xr|aNaturalNumber0(sdtsldt0(xk,xr))|$false|~aNaturalNumber0(xk)),inference(rw,[status(thm)],[12018,243,theory(equality)])).
% cnf(12105,plain,(sz00=xr|aNaturalNumber0(sdtsldt0(xk,xr))|~aNaturalNumber0(xk)),inference(cn,[status(thm)],[12104,theory(equality)])).
% cnf(12106,plain,(xr=sz00|~aNaturalNumber0(xk)),inference(sr,[status(thm)],[12105,2850,theory(equality)])).
% cnf(12113,plain,(sz00=xp|aNaturalNumber0(xk)|~aNaturalNumber0(xp)|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(rw,[status(thm)],[12021,235,theory(equality)])).
% cnf(12114,plain,(sz00=xp|aNaturalNumber0(xk)|$false|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(rw,[status(thm)],[12113,221,theory(equality)])).
% cnf(12115,plain,(sz00=xp|aNaturalNumber0(xk)|$false|$false),inference(rw,[status(thm)],[12114,1638,theory(equality)])).
% cnf(12116,plain,(sz00=xp|aNaturalNumber0(xk)),inference(cn,[status(thm)],[12115,theory(equality)])).
% cnf(13292,plain,(xr=sz00|xp=sz00),inference(spm,[status(thm)],[12106,12116,theory(equality)])).
% cnf(13295,plain,(isPrime0(sz00)|xr=sz00),inference(spm,[status(thm)],[228,13292,theory(equality)])).
% cnf(13347,plain,(xr=sz00),inference(sr,[status(thm)],[13295,272,theory(equality)])).
% cnf(13659,plain,(isPrime0(sz00)),inference(rw,[status(thm)],[241,13347,theory(equality)])).
% cnf(13660,plain,($false),inference(sr,[status(thm)],[13659,272,theory(equality)])).
% cnf(13661,plain,($false),13660,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1109
% # ...of these trivial                : 4
% # ...subsumed                        : 406
% # ...remaining for further processing: 699
% # Other redundant clauses eliminated : 18
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 58
% # Backward-rewritten                 : 182
% # Generated clauses                  : 4912
% # ...of the previous two non-trivial : 4594
% # Contextual simplify-reflections    : 139
% # Paramodulations                    : 4851
% # Factorizations                     : 4
% # Equation resolutions               : 57
% # Current number of processed clauses: 458
% #    Positive orientable unit clauses: 67
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 10
% #    Non-unit-clauses                : 381
% # Current number of unprocessed clauses: 2634
% # ...number of literals in the above : 11333
% # Clause-clause subsumption calls (NU) : 6995
% # Rec. Clause-clause subsumption calls : 4763
% # Unit Clause-clause subsumption calls : 267
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 19
% # Indexed BW rewrite successes       : 17
% # Backwards rewriting index:   390 leaves,   1.12+/-0.550 terms/leaf
% # Paramod-from index:          259 leaves,   1.05+/-0.235 terms/leaf
% # Paramod-into index:          350 leaves,   1.09+/-0.496 terms/leaf
% # -------------------------------------------------
% # User time              : 0.283 s
% # System time            : 0.013 s
% # Total time             : 0.296 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.56 CPU 0.65 WC
% FINAL PrfWatch: 0.56 CPU 0.65 WC
% SZS output end Solution for /tmp/SystemOnTPTP7848/NUM514+1.tptp
% 
%------------------------------------------------------------------------------