TSTP Solution File: NUM505+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM505+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:40:59 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP2943/NUM505+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2943/NUM505+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2943/NUM505+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 3039
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 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(5, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),file('/tmp/SRASS.s.p', mAddComm)).
% fof(7, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', m_AddZero)).
% fof(17, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))),file('/tmp/SRASS.s.p', mDefLE)).
% fof(20, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X3))=>sdtlseqdt0(X1,X3))),file('/tmp/SRASS.s.p', mLETran)).
% fof(21, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),file('/tmp/SRASS.s.p', mLETotal)).
% 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(41, axiom,(((~(xn=xp)&sdtlseqdt0(xn,xp))&~(xm=xp))&sdtlseqdt0(xm,xp)),file('/tmp/SRASS.s.p', m__2287)).
% fof(42, axiom,xk=sdtsldt0(sdtasdt0(xn,xm),xp),file('/tmp/SRASS.s.p', m__2306)).
% fof(50, conjecture,(~(sdtlseqdt0(xp,xk))=>(~(xk=xp)&sdtlseqdt0(xk,xp))),file('/tmp/SRASS.s.p', m__)).
% fof(51, negated_conjecture,~((~(sdtlseqdt0(xp,xk))=>(~(xk=xp)&sdtlseqdt0(xk,xp)))),inference(assume_negation,[status(cth)],[50])).
% fof(56, negated_conjecture,~((~(sdtlseqdt0(xp,xk))=>(~(xk=xp)&sdtlseqdt0(xk,xp)))),inference(fof_simplification,[status(thm)],[51,theory(equality)])).
% cnf(57,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(63, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(64, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(66, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(67, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|sdtpldt0(X3,X4)=sdtpldt0(X4,X3)),inference(variable_rename,[status(thm)],[66])).
% cnf(68,plain,(sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[67])).
% fof(72, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(73, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aNaturalNumber0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[73])).
% cnf(75,plain,(X1=sdtpldt0(sz00,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(117, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(sdtlseqdt0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&(![X3]:(~(aNaturalNumber0(X3))|~(sdtpldt0(X1,X3)=X2))|sdtlseqdt0(X1,X2)))),inference(fof_nnf,[status(thm)],[17])).
% fof(118, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(sdtlseqdt0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&(![X7]:(~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5)))),inference(variable_rename,[status(thm)],[117])).
% fof(119, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(sdtlseqdt0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&sdtpldt0(X4,esk1_2(X4,X5))=X5))&(![X7]:(~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5)))),inference(skolemize,[status(esa)],[118])).
% fof(120, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5))&(~(sdtlseqdt0(X4,X5))|(aNaturalNumber0(esk1_2(X4,X5))&sdtpldt0(X4,esk1_2(X4,X5))=X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[119])).
% fof(121, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(sdtpldt0(X4,X7)=X5))|sdtlseqdt0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk1_2(X4,X5))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((sdtpldt0(X4,esk1_2(X4,X5))=X5|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[120])).
% cnf(122,plain,(sdtpldt0(X2,esk1_2(X2,X1))=X1|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)),inference(split_conjunct,[status(thm)],[121])).
% cnf(123,plain,(aNaturalNumber0(esk1_2(X2,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)),inference(split_conjunct,[status(thm)],[121])).
% cnf(124,plain,(sdtlseqdt0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[121])).
% fof(131, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X3)))|sdtlseqdt0(X1,X3))),inference(fof_nnf,[status(thm)],[20])).
% fof(132, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|((~(sdtlseqdt0(X4,X5))|~(sdtlseqdt0(X5,X6)))|sdtlseqdt0(X4,X6))),inference(variable_rename,[status(thm)],[131])).
% cnf(133,plain,(sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[132])).
% fof(134, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(135, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|(sdtlseqdt0(X3,X4)|(~(X4=X3)&sdtlseqdt0(X4,X3)))),inference(variable_rename,[status(thm)],[134])).
% fof(136, 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)],[135])).
% cnf(137,plain,(sdtlseqdt0(X2,X1)|sdtlseqdt0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(split_conjunct,[status(thm)],[136])).
% fof(173, 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(174, 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)],[173])).
% fof(175, 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)],[174])).
% fof(176, 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)],[175])).
% cnf(179,plain,(X2=sz00|aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)|X3!=sdtsldt0(X1,X2)),inference(split_conjunct,[status(thm)],[176])).
% fof(196, 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(197, 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)],[196])).
% fof(198, 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)],[197])).
% fof(199, 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)],[198])).
% fof(200, 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)],[199])).
% cnf(206,plain,(~aNaturalNumber0(X1)|~isPrime0(X1)|X1!=sz00),inference(split_conjunct,[status(thm)],[200])).
% cnf(215,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[36])).
% cnf(216,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[36])).
% cnf(217,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[36])).
% cnf(221,plain,(doDivides0(xp,sdtasdt0(xn,xm))),inference(split_conjunct,[status(thm)],[38])).
% cnf(222,plain,(isPrime0(xp)),inference(split_conjunct,[status(thm)],[38])).
% cnf(225,plain,(sdtlseqdt0(xm,xp)),inference(split_conjunct,[status(thm)],[41])).
% cnf(229,plain,(xk=sdtsldt0(sdtasdt0(xn,xm),xp)),inference(split_conjunct,[status(thm)],[42])).
% fof(251, negated_conjecture,(~(sdtlseqdt0(xp,xk))&(xk=xp|~(sdtlseqdt0(xk,xp)))),inference(fof_nnf,[status(thm)],[56])).
% cnf(252,negated_conjecture,(xk=xp|~sdtlseqdt0(xk,xp)),inference(split_conjunct,[status(thm)],[251])).
% cnf(253,negated_conjecture,(~sdtlseqdt0(xp,xk)),inference(split_conjunct,[status(thm)],[251])).
% cnf(261,plain,(~isPrime0(sz00)|~aNaturalNumber0(sz00)),inference(er,[status(thm)],[206,theory(equality)])).
% cnf(262,plain,(~isPrime0(sz00)|$false),inference(rw,[status(thm)],[261,57,theory(equality)])).
% cnf(263,plain,(~isPrime0(sz00)),inference(cn,[status(thm)],[262,theory(equality)])).
% cnf(289,negated_conjecture,(xk=xp|sdtlseqdt0(xp,xk)|~aNaturalNumber0(xp)|~aNaturalNumber0(xk)),inference(spm,[status(thm)],[252,137,theory(equality)])).
% cnf(291,negated_conjecture,(xk=xp|sdtlseqdt0(xp,xk)|$false|~aNaturalNumber0(xk)),inference(rw,[status(thm)],[289,215,theory(equality)])).
% cnf(292,negated_conjecture,(xk=xp|sdtlseqdt0(xp,xk)|~aNaturalNumber0(xk)),inference(cn,[status(thm)],[291,theory(equality)])).
% cnf(293,negated_conjecture,(xk=xp|~aNaturalNumber0(xk)),inference(sr,[status(thm)],[292,253,theory(equality)])).
% cnf(453,plain,(sdtlseqdt0(sz00,X1)|X2!=X1|~aNaturalNumber0(X2)|~aNaturalNumber0(sz00)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[124,75,theory(equality)])).
% cnf(455,plain,(sdtlseqdt0(X1,X2)|sdtpldt0(X3,X1)!=X2|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[124,68,theory(equality)])).
% cnf(457,plain,(sdtlseqdt0(sz00,X1)|X2!=X1|~aNaturalNumber0(X2)|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[453,57,theory(equality)])).
% cnf(458,plain,(sdtlseqdt0(sz00,X1)|X2!=X1|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[457,theory(equality)])).
% cnf(459,plain,(sdtlseqdt0(sz00,X1)|~aNaturalNumber0(X1)),inference(er,[status(thm)],[458,theory(equality)])).
% cnf(465,plain,(sdtlseqdt0(X1,xp)|~sdtlseqdt0(X1,xm)|~aNaturalNumber0(xm)|~aNaturalNumber0(xp)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[133,225,theory(equality)])).
% cnf(474,plain,(sdtlseqdt0(X1,xp)|~sdtlseqdt0(X1,xm)|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[465,216,theory(equality)])).
% cnf(475,plain,(sdtlseqdt0(X1,xp)|~sdtlseqdt0(X1,xm)|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[474,215,theory(equality)])).
% cnf(476,plain,(sdtlseqdt0(X1,xp)|~sdtlseqdt0(X1,xm)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[475,theory(equality)])).
% cnf(580,plain,(sz00=xp|aNaturalNumber0(X1)|xk!=X1|~doDivides0(xp,sdtasdt0(xn,xm))|~aNaturalNumber0(xp)|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(spm,[status(thm)],[179,229,theory(equality)])).
% cnf(581,plain,(sz00=xp|aNaturalNumber0(X1)|xk!=X1|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(rw,[status(thm)],[580,221,theory(equality)])).
% cnf(582,plain,(sz00=xp|aNaturalNumber0(X1)|xk!=X1|$false|$false|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(rw,[status(thm)],[581,215,theory(equality)])).
% cnf(583,plain,(sz00=xp|aNaturalNumber0(X1)|xk!=X1|~aNaturalNumber0(sdtasdt0(xn,xm))),inference(cn,[status(thm)],[582,theory(equality)])).
% cnf(1598,plain,(sdtlseqdt0(sz00,xp)|~aNaturalNumber0(sz00)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[476,459,theory(equality)])).
% cnf(1605,plain,(sdtlseqdt0(sz00,xp)|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[1598,57,theory(equality)])).
% cnf(1606,plain,(sdtlseqdt0(sz00,xp)|$false|$false),inference(rw,[status(thm)],[1605,216,theory(equality)])).
% cnf(1607,plain,(sdtlseqdt0(sz00,xp)),inference(cn,[status(thm)],[1606,theory(equality)])).
% cnf(1619,plain,(aNaturalNumber0(esk1_2(sz00,xp))|~aNaturalNumber0(sz00)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[123,1607,theory(equality)])).
% cnf(1620,plain,(sdtpldt0(sz00,esk1_2(sz00,xp))=xp|~aNaturalNumber0(sz00)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[122,1607,theory(equality)])).
% cnf(1636,plain,(aNaturalNumber0(esk1_2(sz00,xp))|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[1619,57,theory(equality)])).
% cnf(1637,plain,(aNaturalNumber0(esk1_2(sz00,xp))|$false|$false),inference(rw,[status(thm)],[1636,215,theory(equality)])).
% cnf(1638,plain,(aNaturalNumber0(esk1_2(sz00,xp))),inference(cn,[status(thm)],[1637,theory(equality)])).
% cnf(1639,plain,(sdtpldt0(sz00,esk1_2(sz00,xp))=xp|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[1620,57,theory(equality)])).
% cnf(1640,plain,(sdtpldt0(sz00,esk1_2(sz00,xp))=xp|$false|$false),inference(rw,[status(thm)],[1639,215,theory(equality)])).
% cnf(1641,plain,(sdtpldt0(sz00,esk1_2(sz00,xp))=xp),inference(cn,[status(thm)],[1640,theory(equality)])).
% cnf(1933,plain,(xp=esk1_2(sz00,xp)|~aNaturalNumber0(esk1_2(sz00,xp))),inference(spm,[status(thm)],[75,1641,theory(equality)])).
% cnf(1965,plain,(xp=esk1_2(sz00,xp)|$false),inference(rw,[status(thm)],[1933,1638,theory(equality)])).
% cnf(1966,plain,(xp=esk1_2(sz00,xp)),inference(cn,[status(thm)],[1965,theory(equality)])).
% cnf(1967,plain,(sdtpldt0(sz00,xp)=xp),inference(rw,[status(thm)],[1641,1966,theory(equality)])).
% cnf(4645,plain,(sdtlseqdt0(xp,X1)|xp!=X1|~aNaturalNumber0(sz00)|~aNaturalNumber0(xp)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[455,1967,theory(equality)])).
% cnf(4669,plain,(sdtlseqdt0(xp,X1)|xp!=X1|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[4645,57,theory(equality)])).
% cnf(4670,plain,(sdtlseqdt0(xp,X1)|xp!=X1|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[4669,215,theory(equality)])).
% cnf(4671,plain,(sdtlseqdt0(xp,X1)|xp!=X1|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[4670,theory(equality)])).
% cnf(4691,plain,(sdtlseqdt0(xp,xp)|~aNaturalNumber0(xp)),inference(er,[status(thm)],[4671,theory(equality)])).
% cnf(4692,plain,(sdtlseqdt0(xp,xp)|$false),inference(rw,[status(thm)],[4691,215,theory(equality)])).
% cnf(4693,plain,(sdtlseqdt0(xp,xp)),inference(cn,[status(thm)],[4692,theory(equality)])).
% cnf(11190,plain,(xp=sz00|aNaturalNumber0(X1)|xk!=X1|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[583,65,theory(equality)])).
% cnf(11191,plain,(xp=sz00|aNaturalNumber0(X1)|xk!=X1|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[11190,216,theory(equality)])).
% cnf(11192,plain,(xp=sz00|aNaturalNumber0(X1)|xk!=X1|$false|$false),inference(rw,[status(thm)],[11191,217,theory(equality)])).
% cnf(11193,plain,(xp=sz00|aNaturalNumber0(X1)|xk!=X1),inference(cn,[status(thm)],[11192,theory(equality)])).
% cnf(11196,plain,(xp=sz00|aNaturalNumber0(xk)),inference(er,[status(thm)],[11193,theory(equality)])).
% cnf(11197,negated_conjecture,(xk=xp|xp=sz00),inference(spm,[status(thm)],[293,11196,theory(equality)])).
% cnf(11210,negated_conjecture,(xp=sz00|~sdtlseqdt0(xp,xp)),inference(spm,[status(thm)],[253,11197,theory(equality)])).
% cnf(11222,negated_conjecture,(xp=sz00|$false),inference(rw,[status(thm)],[11210,4693,theory(equality)])).
% cnf(11223,negated_conjecture,(xp=sz00),inference(cn,[status(thm)],[11222,theory(equality)])).
% cnf(11545,plain,(isPrime0(sz00)),inference(rw,[status(thm)],[222,11223,theory(equality)])).
% cnf(11546,plain,($false),inference(sr,[status(thm)],[11545,263,theory(equality)])).
% cnf(11547,plain,($false),11546,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 926
% # ...of these trivial : 15
% # ...subsumed : 331
% # ...remaining for further processing: 580
% # Other redundant clauses eliminated : 49
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 270
% # Generated clauses : 3720
% # ...of the previous two non-trivial : 3184
% # Contextual simplify-reflections : 129
% # Paramodulations : 3607
% # Factorizations : 8
% # Equation resolutions : 105
% # Current number of processed clauses: 205
% # Positive orientable unit clauses: 36
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 163
% # Current number of unprocessed clauses: 807
% # ...number of literals in the above : 3689
% # Clause-clause subsumption calls (NU) : 2925
% # Rec. Clause-clause subsumption calls : 2055
% # Unit Clause-clause subsumption calls : 60
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 39
% # Indexed BW rewrite successes : 31
% # Backwards rewriting index: 158 leaves, 1.29+/-0.943 terms/leaf
% # Paramod-from index: 99 leaves, 1.08+/-0.307 terms/leaf
% # Paramod-into index: 130 leaves, 1.21+/-0.829 terms/leaf
% # -------------------------------------------------
% # User time : 0.209 s
% # System time : 0.007 s
% # Total time : 0.216 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.43 CPU 0.53 WC
% FINAL PrfWatch: 0.43 CPU 0.53 WC
% SZS output end Solution for /tmp/SystemOnTPTP2943/NUM505+1.tptp
%
%------------------------------------------------------------------------------