%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM465+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 19:26:34 EST 2010
% Result : Theorem 1.47s
% Output : Solution 1.47s
% 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/SystemOnTPTP9549/NUM465+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9549/NUM465+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9549/NUM465+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 9681
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.015 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(2, axiom,(aNaturalNumber0(sz10)&~(sz10=sz00)),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(4, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(6, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', m_MulUnit)).
% fof(7, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', m_MulZero)).
% fof(12, 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(13, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),file('/tmp/SRASS.s.p', mLETotal)).
% fof(14, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>(((~(X1=sz00)&~(X2=X3))&sdtlseqdt0(X2,X3))=>(((~(sdtasdt0(X1,X2)=sdtasdt0(X1,X3))&sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)))&~(sdtasdt0(X2,X1)=sdtasdt0(X3,X1)))&sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))))),file('/tmp/SRASS.s.p', mMonMul)).
% fof(16, axiom,(aNaturalNumber0(xm)&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__987)).
% fof(17, axiom,(~(xm=sz00)=>sdtlseqdt0(sz10,xm)),file('/tmp/SRASS.s.p', m__1007)).
% fof(18, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', m_AddZero)).
% fof(21, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))),file('/tmp/SRASS.s.p', mDefLE)).
% fof(29, conjecture,(~(xm=sz00)=>sdtlseqdt0(xn,sdtasdt0(xn,xm))),file('/tmp/SRASS.s.p', m__)).
% fof(30, negated_conjecture,~((~(xm=sz00)=>sdtlseqdt0(xn,sdtasdt0(xn,xm)))),inference(assume_negation,[status(cth)],[29])).
% cnf(32,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% cnf(34,plain,(aNaturalNumber0(sz10)),inference(split_conjunct,[status(thm)],[2])).
% fof(38, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(39, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(44, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(45, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aNaturalNumber0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[45])).
% cnf(47,plain,(X1=sdtasdt0(sz10,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,plain,(sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(49, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(50, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aNaturalNumber0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[50])).
% cnf(52,plain,(sz00=sdtasdt0(sz00,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(69, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X3)))|sdtlseqdt0(X1,X3))),inference(fof_nnf,[status(thm)],[12])).
% fof(70, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|((~(sdtlseqdt0(X4,X5))|~(sdtlseqdt0(X5,X6)))|sdtlseqdt0(X4,X6))),inference(variable_rename,[status(thm)],[69])).
% cnf(71,plain,(sdtlseqdt0(X1,X2)|~sdtlseqdt0(X3,X2)|~sdtlseqdt0(X1,X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[70])).
% fof(72, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(73, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|(sdtlseqdt0(X3,X4)|(~(X4=X3)&sdtlseqdt0(X4,X3)))),inference(variable_rename,[status(thm)],[72])).
% fof(74, 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)],[73])).
% cnf(75,plain,(sdtlseqdt0(X2,X1)|sdtlseqdt0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(split_conjunct,[status(thm)],[74])).
% fof(77, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|(((X1=sz00|X2=X3)|~(sdtlseqdt0(X2,X3)))|(((~(sdtasdt0(X1,X2)=sdtasdt0(X1,X3))&sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)))&~(sdtasdt0(X2,X1)=sdtasdt0(X3,X1)))&sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))))),inference(fof_nnf,[status(thm)],[14])).
% fof(78, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|(((X4=sz00|X5=X6)|~(sdtlseqdt0(X5,X6)))|(((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))&sdtlseqdt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6)))&~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4)))&sdtlseqdt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X4]:![X5]:![X6]:(((((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))|((X4=sz00|X5=X6)|~(sdtlseqdt0(X5,X6))))|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))&((sdtlseqdt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((X4=sz00|X5=X6)|~(sdtlseqdt0(X5,X6))))|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))))&((~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4))|((X4=sz00|X5=X6)|~(sdtlseqdt0(X5,X6))))|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))))&((sdtlseqdt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))|((X4=sz00|X5=X6)|~(sdtlseqdt0(X5,X6))))|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))),inference(distribute,[status(thm)],[78])).
% cnf(82,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)],[79])).
% cnf(89,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[16])).
% cnf(90,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[16])).
% fof(91, plain,(xm=sz00|sdtlseqdt0(sz10,xm)),inference(fof_nnf,[status(thm)],[17])).
% cnf(92,plain,(sdtlseqdt0(sz10,xm)|xm=sz00),inference(split_conjunct,[status(thm)],[91])).
% fof(93, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(94, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[93])).
% fof(95, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aNaturalNumber0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[94])).
% cnf(96,plain,(X1=sdtpldt0(sz00,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[95])).
% fof(108, 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)],[21])).
% fof(109, 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)],[108])).
% fof(110, 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)],[109])).
% fof(111, 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)],[110])).
% fof(112, 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)],[111])).
% cnf(115,plain,(sdtlseqdt0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sdtpldt0(X2,X3)!=X1|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[112])).
% fof(147, negated_conjecture,(~(xm=sz00)&~(sdtlseqdt0(xn,sdtasdt0(xn,xm)))),inference(fof_nnf,[status(thm)],[30])).
% cnf(148,negated_conjecture,(~sdtlseqdt0(xn,sdtasdt0(xn,xm))),inference(split_conjunct,[status(thm)],[147])).
% cnf(149,negated_conjecture,(xm!=sz00),inference(split_conjunct,[status(thm)],[147])).
% cnf(150,plain,(sdtlseqdt0(sz10,xm)),inference(sr,[status(thm)],[92,149,theory(equality)])).
% cnf(171,plain,(sdtlseqdt0(xn,X1)|sdtlseqdt0(X1,xn)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[75,89,theory(equality)])).
% cnf(182,negated_conjecture,(~sdtlseqdt0(xn,sdtasdt0(xm,xn))|~aNaturalNumber0(xn)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[148,40,theory(equality)])).
% cnf(196,negated_conjecture,(~sdtlseqdt0(xn,sdtasdt0(xm,xn))|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[182,89,theory(equality)])).
% cnf(197,negated_conjecture,(~sdtlseqdt0(xn,sdtasdt0(xm,xn))|$false|$false),inference(rw,[status(thm)],[196,90,theory(equality)])).
% cnf(198,negated_conjecture,(~sdtlseqdt0(xn,sdtasdt0(xm,xn))),inference(cn,[status(thm)],[197,theory(equality)])).
% cnf(297,plain,(sdtlseqdt0(sz00,X1)|X2!=X1|~aNaturalNumber0(X2)|~aNaturalNumber0(sz00)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[115,96,theory(equality)])).
% cnf(302,plain,(sdtlseqdt0(sz00,X1)|X2!=X1|~aNaturalNumber0(X2)|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[297,32,theory(equality)])).
% cnf(303,plain,(sdtlseqdt0(sz00,X1)|X2!=X1|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[302,theory(equality)])).
% cnf(304,plain,(sdtlseqdt0(sz00,X1)|~aNaturalNumber0(X1)),inference(er,[status(thm)],[303,theory(equality)])).
% cnf(412,plain,(sz00=X1|X2=sz10|sdtlseqdt0(X1,sdtasdt0(X1,X2))|~sdtlseqdt0(sz10,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(sz10)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[82,48,theory(equality)])).
% cnf(426,plain,(sz00=X1|X2=sz10|sdtlseqdt0(X1,sdtasdt0(X1,X2))|~sdtlseqdt0(sz10,X2)|~aNaturalNumber0(X1)|$false|~aNaturalNumber0(X2)),inference(rw,[status(thm)],[412,34,theory(equality)])).
% cnf(427,plain,(sz00=X1|X2=sz10|sdtlseqdt0(X1,sdtasdt0(X1,X2))|~sdtlseqdt0(sz10,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(cn,[status(thm)],[426,theory(equality)])).
% cnf(642,plain,(sdtlseqdt0(xn,xn)),inference(spm,[status(thm)],[171,89,theory(equality)])).
% cnf(646,plain,(sdtlseqdt0(sz00,xn)|sdtlseqdt0(xn,sz00)),inference(spm,[status(thm)],[171,32,theory(equality)])).
% cnf(683,plain,(sdtlseqdt0(X1,sz00)|sdtlseqdt0(sz00,xn)|~sdtlseqdt0(X1,xn)|~aNaturalNumber0(xn)|~aNaturalNumber0(sz00)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[71,646,theory(equality)])).
% cnf(687,plain,(sdtlseqdt0(X1,sz00)|sdtlseqdt0(sz00,xn)|~sdtlseqdt0(X1,xn)|$false|~aNaturalNumber0(sz00)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[683,89,theory(equality)])).
% cnf(688,plain,(sdtlseqdt0(X1,sz00)|sdtlseqdt0(sz00,xn)|~sdtlseqdt0(X1,xn)|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[687,32,theory(equality)])).
% cnf(689,plain,(sdtlseqdt0(X1,sz00)|sdtlseqdt0(sz00,xn)|~sdtlseqdt0(X1,xn)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[688,theory(equality)])).
% cnf(963,plain,(sdtlseqdt0(sz00,xn)|sdtlseqdt0(sz00,sz00)|~aNaturalNumber0(sz00)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[689,304,theory(equality)])).
% cnf(974,plain,(sdtlseqdt0(sz00,xn)|sdtlseqdt0(sz00,sz00)|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[963,32,theory(equality)])).
% cnf(975,plain,(sdtlseqdt0(sz00,xn)|sdtlseqdt0(sz00,sz00)|$false|$false),inference(rw,[status(thm)],[974,89,theory(equality)])).
% cnf(976,plain,(sdtlseqdt0(sz00,xn)|sdtlseqdt0(sz00,sz00)),inference(cn,[status(thm)],[975,theory(equality)])).
% cnf(11034,negated_conjecture,(xm=sz10|sz00=xn|~sdtlseqdt0(sz10,xm)|~aNaturalNumber0(xn)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[148,427,theory(equality)])).
% cnf(11071,negated_conjecture,(xm=sz10|sz00=xn|$false|~aNaturalNumber0(xn)|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[11034,150,theory(equality)])).
% cnf(11072,negated_conjecture,(xm=sz10|sz00=xn|$false|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[11071,89,theory(equality)])).
% cnf(11073,negated_conjecture,(xm=sz10|sz00=xn|$false|$false|$false),inference(rw,[status(thm)],[11072,90,theory(equality)])).
% cnf(11074,negated_conjecture,(xm=sz10|sz00=xn),inference(cn,[status(thm)],[11073,theory(equality)])).
% cnf(11116,negated_conjecture,(xm=sz10|~sdtlseqdt0(sz00,sdtasdt0(sz00,xm))),inference(spm,[status(thm)],[148,11074,theory(equality)])).
% cnf(11132,negated_conjecture,(sdtlseqdt0(sz00,sz00)|xm=sz10),inference(spm,[status(thm)],[976,11074,theory(equality)])).
% cnf(11265,negated_conjecture,(xm=sz10|~sdtlseqdt0(sz00,sz00)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[11116,52,theory(equality)])).
% cnf(11267,negated_conjecture,(xm=sz10|~sdtlseqdt0(sz00,sz00)|$false),inference(rw,[status(thm)],[11265,90,theory(equality)])).
% cnf(11268,negated_conjecture,(xm=sz10|~sdtlseqdt0(sz00,sz00)),inference(cn,[status(thm)],[11267,theory(equality)])).
% cnf(11269,negated_conjecture,(xm=sz10),inference(csr,[status(thm)],[11268,11132])).
% cnf(11323,negated_conjecture,(~sdtlseqdt0(xn,sdtasdt0(sz10,xn))),inference(rw,[status(thm)],[198,11269,theory(equality)])).
% cnf(11330,negated_conjecture,(~sdtlseqdt0(xn,xn)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[11323,47,theory(equality)])).
% cnf(11333,negated_conjecture,($false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[11330,642,theory(equality)])).
% cnf(11334,negated_conjecture,($false|$false),inference(rw,[status(thm)],[11333,89,theory(equality)])).
% cnf(11335,negated_conjecture,($false),inference(cn,[status(thm)],[11334,theory(equality)])).
% cnf(11336,negated_conjecture,($false),11335,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 899
% # ...of these trivial : 7
% # ...subsumed : 615
% # ...remaining for further processing: 277
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 52
% # Generated clauses : 4209
% # ...of the previous two non-trivial : 3531
% # Contextual simplify-reflections : 262
% # Paramodulations : 4176
% # Factorizations : 0
% # Equation resolutions : 33
% # Current number of processed clauses: 170
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 156
% # Current number of unprocessed clauses: 2444
% # ...number of literals in the above : 13859
% # Clause-clause subsumption calls (NU) : 6768
% # Rec. Clause-clause subsumption calls : 4162
% # Unit Clause-clause subsumption calls : 29
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 97 leaves, 1.53+/-1.325 terms/leaf
% # Paramod-from index: 77 leaves, 1.13+/-0.406 terms/leaf
% # Paramod-into index: 86 leaves, 1.47+/-1.198 terms/leaf
% # -------------------------------------------------
% # User time : 0.191 s
% # System time : 0.006 s
% # Total time : 0.197 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.43 CPU 0.50 WC
% FINAL PrfWatch: 0.43 CPU 0.50 WC
% SZS output end Solution for /tmp/SystemOnTPTP9549/NUM465+1.tptp
%
%------------------------------------------------------------------------------