TSTP Solution File: NUM453+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM453+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 : art04.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:16:10 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP18202/NUM453+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18202/NUM453+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18202/NUM453+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 18298
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aInteger0(sz00),file('/tmp/SRASS.s.p', mIntZero)).
% fof(2, axiom,aInteger0(sz10),file('/tmp/SRASS.s.p', mIntOne)).
% fof(3, axiom,![X1]:(aInteger0(X1)=>aInteger0(smndt0(X1))),file('/tmp/SRASS.s.p', mIntNeg)).
% fof(4, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>aInteger0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mIntPlus)).
% fof(5, axiom,![X1]:![X2]:![X3]:(((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))=>sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtpldt0(X1,X2),X3)),file('/tmp/SRASS.s.p', mAddAsso)).
% fof(6, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),file('/tmp/SRASS.s.p', mAddComm)).
% fof(7, axiom,![X1]:(aInteger0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', mAddZero)).
% fof(8, axiom,![X1]:(aInteger0(X1)=>(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),file('/tmp/SRASS.s.p', mAddNeg)).
% fof(13, axiom,((aInteger0(xp)&~(xp=sz00))&aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS)))),file('/tmp/SRASS.s.p', m__2171)).
% fof(18, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),file('/tmp/SRASS.s.p', mMulMinOne)).
% fof(27, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', mMulZero)).
% fof(48, conjecture,(~(sdtpldt0(sz10,xp)=sz10)&~(sdtpldt0(sz10,smndt0(xp))=sz10)),file('/tmp/SRASS.s.p', m__)).
% fof(49, negated_conjecture,~((~(sdtpldt0(sz10,xp)=sz10)&~(sdtpldt0(sz10,smndt0(xp))=sz10))),inference(assume_negation,[status(cth)],[48])).
% cnf(56,plain,(aInteger0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% cnf(57,plain,(aInteger0(sz10)),inference(split_conjunct,[status(thm)],[2])).
% fof(58, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(59, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(62, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(64, plain,![X1]:![X2]:![X3]:(((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtpldt0(X1,X2),X3)),inference(fof_nnf,[status(thm)],[5])).
% fof(65, plain,![X4]:![X5]:![X6]:(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|sdtpldt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtpldt0(X4,X5),X6)),inference(variable_rename,[status(thm)],[64])).
% cnf(66,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtpldt0(X1,X2),X3)|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(67, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(68, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|sdtpldt0(X3,X4)=sdtpldt0(X4,X3)),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[68])).
% fof(70, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(71, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aInteger0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[71])).
% cnf(73,plain,(X1=sdtpldt0(sz00,X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[72])).
% cnf(74,plain,(sdtpldt0(X1,sz00)=X1|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(75, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(76, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,smndt0(X2))=sz00&sz00=sdtpldt0(smndt0(X2),X2))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X2]:((sdtpldt0(X2,smndt0(X2))=sz00|~(aInteger0(X2)))&(sz00=sdtpldt0(smndt0(X2),X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[76])).
% cnf(78,plain,(sz00=sdtpldt0(smndt0(X1),X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,plain,(sdtpldt0(X1,smndt0(X1))=sz00|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[77])).
% cnf(86,plain,(xp!=sz00),inference(split_conjunct,[status(thm)],[13])).
% cnf(87,plain,(aInteger0(xp)),inference(split_conjunct,[status(thm)],[13])).
% fof(110, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),inference(fof_nnf,[status(thm)],[18])).
% fof(111, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(smndt0(sz10),X2)=smndt0(X2)&smndt0(X2)=sdtasdt0(X2,smndt0(sz10)))),inference(variable_rename,[status(thm)],[110])).
% fof(112, plain,![X2]:((sdtasdt0(smndt0(sz10),X2)=smndt0(X2)|~(aInteger0(X2)))&(smndt0(X2)=sdtasdt0(X2,smndt0(sz10))|~(aInteger0(X2)))),inference(distribute,[status(thm)],[111])).
% cnf(113,plain,(smndt0(X1)=sdtasdt0(X1,smndt0(sz10))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[112])).
% fof(193, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[27])).
% fof(194, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[193])).
% fof(195, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aInteger0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[194])).
% cnf(196,plain,(sz00=sdtasdt0(sz00,X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[195])).
% fof(294, negated_conjecture,(sdtpldt0(sz10,xp)=sz10|sdtpldt0(sz10,smndt0(xp))=sz10),inference(fof_nnf,[status(thm)],[49])).
% cnf(295,negated_conjecture,(sdtpldt0(sz10,smndt0(xp))=sz10|sdtpldt0(sz10,xp)=sz10),inference(split_conjunct,[status(thm)],[294])).
% cnf(303,plain,(smndt0(sz00)=sz00|~aInteger0(smndt0(sz10))|~aInteger0(sz00)),inference(spm,[status(thm)],[196,113,theory(equality)])).
% cnf(304,plain,(smndt0(sz00)=sz00|~aInteger0(smndt0(sz10))|$false),inference(rw,[status(thm)],[303,56,theory(equality)])).
% cnf(305,plain,(smndt0(sz00)=sz00|~aInteger0(smndt0(sz10))),inference(cn,[status(thm)],[304,theory(equality)])).
% cnf(441,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(X3,sdtpldt0(X1,X2))|~aInteger0(X3)|~aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(spm,[status(thm)],[69,66,theory(equality)])).
% cnf(445,plain,(sdtpldt0(sz00,X2)=sdtpldt0(smndt0(X1),sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(smndt0(X1))),inference(spm,[status(thm)],[66,78,theory(equality)])).
% cnf(447,plain,(sdtpldt0(X1,X2)=sdtpldt0(sz00,sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(sz00)),inference(spm,[status(thm)],[66,73,theory(equality)])).
% cnf(448,plain,(sdtpldt0(sz00,X2)=sdtpldt0(X1,sdtpldt0(smndt0(X1),X2))|~aInteger0(X2)|~aInteger0(smndt0(X1))|~aInteger0(X1)),inference(spm,[status(thm)],[66,79,theory(equality)])).
% cnf(449,plain,(sdtpldt0(X1,X2)=sdtpldt0(X1,sdtpldt0(sz00,X2))|~aInteger0(X2)|~aInteger0(sz00)|~aInteger0(X1)),inference(spm,[status(thm)],[66,74,theory(equality)])).
% cnf(456,plain,(sdtpldt0(X1,X2)=sdtpldt0(sz00,sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[447,56,theory(equality)])).
% cnf(457,plain,(sdtpldt0(X1,X2)=sdtpldt0(sz00,sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(cn,[status(thm)],[456,theory(equality)])).
% cnf(458,plain,(sdtpldt0(X1,X2)=sdtpldt0(X1,sdtpldt0(sz00,X2))|~aInteger0(X2)|$false|~aInteger0(X1)),inference(rw,[status(thm)],[449,56,theory(equality)])).
% cnf(459,plain,(sdtpldt0(X1,X2)=sdtpldt0(X1,sdtpldt0(sz00,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(cn,[status(thm)],[458,theory(equality)])).
% cnf(652,plain,(smndt0(sz00)=sz00|~aInteger0(sz10)),inference(spm,[status(thm)],[305,60,theory(equality)])).
% cnf(653,plain,(smndt0(sz00)=sz00|$false),inference(rw,[status(thm)],[652,57,theory(equality)])).
% cnf(654,plain,(smndt0(sz00)=sz00),inference(cn,[status(thm)],[653,theory(equality)])).
% cnf(656,plain,(sdtpldt0(sz00,sz00)=sz00|~aInteger0(sz00)),inference(spm,[status(thm)],[79,654,theory(equality)])).
% cnf(663,plain,(sdtpldt0(sz00,sz00)=sz00|$false),inference(rw,[status(thm)],[656,56,theory(equality)])).
% cnf(664,plain,(sdtpldt0(sz00,sz00)=sz00),inference(cn,[status(thm)],[663,theory(equality)])).
% cnf(920,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10|sdtpldt0(sz10,xp)=sz10|~aInteger0(smndt0(xp))|~aInteger0(sz10)),inference(spm,[status(thm)],[457,295,theory(equality)])).
% cnf(936,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10|sdtpldt0(sz10,xp)=sz10|~aInteger0(smndt0(xp))|$false),inference(rw,[status(thm)],[920,57,theory(equality)])).
% cnf(937,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10|sdtpldt0(sz10,xp)=sz10|~aInteger0(smndt0(xp))),inference(cn,[status(thm)],[936,theory(equality)])).
% cnf(950,negated_conjecture,(sdtpldt0(sz10,xp)=sz10|sdtpldt0(sz00,sz10)=sz10|~aInteger0(xp)),inference(spm,[status(thm)],[937,60,theory(equality)])).
% cnf(951,negated_conjecture,(sdtpldt0(sz10,xp)=sz10|sdtpldt0(sz00,sz10)=sz10|$false),inference(rw,[status(thm)],[950,87,theory(equality)])).
% cnf(952,negated_conjecture,(sdtpldt0(sz10,xp)=sz10|sdtpldt0(sz00,sz10)=sz10),inference(cn,[status(thm)],[951,theory(equality)])).
% cnf(955,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10|~aInteger0(xp)|~aInteger0(sz10)),inference(spm,[status(thm)],[457,952,theory(equality)])).
% cnf(965,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10|$false|~aInteger0(sz10)),inference(rw,[status(thm)],[955,87,theory(equality)])).
% cnf(966,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10|$false|$false),inference(rw,[status(thm)],[965,57,theory(equality)])).
% cnf(967,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10),inference(cn,[status(thm)],[966,theory(equality)])).
% cnf(969,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz00,sdtpldt0(sz10,X1))|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(sz00)),inference(spm,[status(thm)],[66,967,theory(equality)])).
% cnf(977,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz00,sdtpldt0(sz10,X1))|~aInteger0(X1)|$false|~aInteger0(sz00)),inference(rw,[status(thm)],[969,57,theory(equality)])).
% cnf(978,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz00,sdtpldt0(sz10,X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[977,56,theory(equality)])).
% cnf(979,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz00,sdtpldt0(sz10,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[978,theory(equality)])).
% cnf(1348,plain,(sdtpldt0(X1,sdtpldt0(X2,sz00))=sdtpldt0(X1,X2)|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(sz00)),inference(spm,[status(thm)],[459,69,theory(equality)])).
% cnf(1360,plain,(sdtpldt0(X1,sdtpldt0(X2,sz00))=sdtpldt0(X1,X2)|~aInteger0(X2)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[1348,56,theory(equality)])).
% cnf(1361,plain,(sdtpldt0(X1,sdtpldt0(X2,sz00))=sdtpldt0(X1,X2)|~aInteger0(X2)|~aInteger0(X1)),inference(cn,[status(thm)],[1360,theory(equality)])).
% cnf(1777,negated_conjecture,(sdtpldt0(sz00,sz10)=sdtpldt0(sz10,sz00)|~aInteger0(sz00)|~aInteger0(sz10)),inference(spm,[status(thm)],[979,1361,theory(equality)])).
% cnf(1801,negated_conjecture,(sz10=sdtpldt0(sz10,sz00)|~aInteger0(sz00)|~aInteger0(sz10)),inference(rw,[status(thm)],[1777,967,theory(equality)])).
% cnf(1802,negated_conjecture,(sz10=sdtpldt0(sz10,sz00)|$false|~aInteger0(sz10)),inference(rw,[status(thm)],[1801,56,theory(equality)])).
% cnf(1803,negated_conjecture,(sz10=sdtpldt0(sz10,sz00)|$false|$false),inference(rw,[status(thm)],[1802,57,theory(equality)])).
% cnf(1804,negated_conjecture,(sz10=sdtpldt0(sz10,sz00)),inference(cn,[status(thm)],[1803,theory(equality)])).
% cnf(1821,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz10,sdtpldt0(sz00,X1))|~aInteger0(X1)|~aInteger0(sz00)|~aInteger0(sz10)),inference(spm,[status(thm)],[66,1804,theory(equality)])).
% cnf(1840,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz10,sdtpldt0(sz00,X1))|~aInteger0(X1)|$false|~aInteger0(sz10)),inference(rw,[status(thm)],[1821,56,theory(equality)])).
% cnf(1841,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz10,sdtpldt0(sz00,X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[1840,57,theory(equality)])).
% cnf(1842,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz10,sdtpldt0(sz00,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[1841,theory(equality)])).
% cnf(1869,negated_conjecture,(sdtpldt0(sz10,sdtpldt0(X1,sz00))=sdtpldt0(sz10,X1)|~aInteger0(X1)|~aInteger0(sz00)),inference(spm,[status(thm)],[1842,69,theory(equality)])).
% cnf(1884,negated_conjecture,(sdtpldt0(sz10,sdtpldt0(X1,sz00))=sdtpldt0(sz10,X1)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[1869,56,theory(equality)])).
% cnf(1885,negated_conjecture,(sdtpldt0(sz10,sdtpldt0(X1,sz00))=sdtpldt0(sz10,X1)|~aInteger0(X1)),inference(cn,[status(thm)],[1884,theory(equality)])).
% cnf(2773,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(X3,sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(X3)),inference(csr,[status(thm)],[441,63])).
% cnf(2782,negated_conjecture,(sdtpldt0(X1,sdtpldt0(sz00,sz10))=sdtpldt0(sz10,X1)|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(sz00)),inference(spm,[status(thm)],[1885,2773,theory(equality)])).
% cnf(2913,negated_conjecture,(sdtpldt0(X1,sz10)=sdtpldt0(sz10,X1)|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(sz00)),inference(rw,[status(thm)],[2782,967,theory(equality)])).
% cnf(2914,negated_conjecture,(sdtpldt0(X1,sz10)=sdtpldt0(sz10,X1)|~aInteger0(X1)|$false|~aInteger0(sz00)),inference(rw,[status(thm)],[2913,57,theory(equality)])).
% cnf(2915,negated_conjecture,(sdtpldt0(X1,sz10)=sdtpldt0(sz10,X1)|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[2914,56,theory(equality)])).
% cnf(2916,negated_conjecture,(sdtpldt0(X1,sz10)=sdtpldt0(sz10,X1)|~aInteger0(X1)),inference(cn,[status(thm)],[2915,theory(equality)])).
% cnf(3753,plain,(sdtpldt0(smndt0(X1),sdtpldt0(X1,X2))=sdtpldt0(sz00,X2)|~aInteger0(X2)|~aInteger0(X1)),inference(csr,[status(thm)],[445,60])).
% cnf(3786,negated_conjecture,(sdtpldt0(smndt0(sz10),sz10)=sdtpldt0(sz00,sz00)|~aInteger0(sz00)|~aInteger0(sz10)),inference(spm,[status(thm)],[3753,1804,theory(equality)])).
% cnf(3807,negated_conjecture,(sdtpldt0(smndt0(X1),sdtpldt0(sz10,X1))=sdtpldt0(sz00,sz10)|~aInteger0(sz10)|~aInteger0(X1)),inference(spm,[status(thm)],[3753,2916,theory(equality)])).
% cnf(3841,negated_conjecture,(sdtpldt0(smndt0(sz10),sz10)=sz00|~aInteger0(sz00)|~aInteger0(sz10)),inference(rw,[status(thm)],[3786,664,theory(equality)])).
% cnf(3842,negated_conjecture,(sdtpldt0(smndt0(sz10),sz10)=sz00|$false|~aInteger0(sz10)),inference(rw,[status(thm)],[3841,56,theory(equality)])).
% cnf(3843,negated_conjecture,(sdtpldt0(smndt0(sz10),sz10)=sz00|$false|$false),inference(rw,[status(thm)],[3842,57,theory(equality)])).
% cnf(3844,negated_conjecture,(sdtpldt0(smndt0(sz10),sz10)=sz00),inference(cn,[status(thm)],[3843,theory(equality)])).
% cnf(3889,negated_conjecture,(sdtpldt0(smndt0(X1),sdtpldt0(sz10,X1))=sz10|~aInteger0(sz10)|~aInteger0(X1)),inference(rw,[status(thm)],[3807,967,theory(equality)])).
% cnf(3890,negated_conjecture,(sdtpldt0(smndt0(X1),sdtpldt0(sz10,X1))=sz10|$false|~aInteger0(X1)),inference(rw,[status(thm)],[3889,57,theory(equality)])).
% cnf(3891,negated_conjecture,(sdtpldt0(smndt0(X1),sdtpldt0(sz10,X1))=sz10|~aInteger0(X1)),inference(cn,[status(thm)],[3890,theory(equality)])).
% cnf(3983,negated_conjecture,(sdtpldt0(smndt0(smndt0(xp)),sz10)=sz10|sdtpldt0(sz10,xp)=sz10|~aInteger0(smndt0(xp))),inference(spm,[status(thm)],[3891,295,theory(equality)])).
% cnf(4193,plain,(sdtpldt0(X1,sdtpldt0(smndt0(X1),X2))=sdtpldt0(sz00,X2)|~aInteger0(X1)|~aInteger0(X2)),inference(csr,[status(thm)],[448,60])).
% cnf(4456,negated_conjecture,(sdtpldt0(smndt0(smndt0(xp)),sz10)=sz10|sdtpldt0(sz10,xp)=sz10|~aInteger0(xp)),inference(spm,[status(thm)],[3983,60,theory(equality)])).
% cnf(4457,negated_conjecture,(sdtpldt0(smndt0(smndt0(xp)),sz10)=sz10|sdtpldt0(sz10,xp)=sz10|$false),inference(rw,[status(thm)],[4456,87,theory(equality)])).
% cnf(4458,negated_conjecture,(sdtpldt0(smndt0(smndt0(xp)),sz10)=sz10|sdtpldt0(sz10,xp)=sz10),inference(cn,[status(thm)],[4457,theory(equality)])).
% cnf(4727,negated_conjecture,(sdtpldt0(smndt0(xp),sz10)=sdtpldt0(sz00,sz10)|sdtpldt0(sz10,xp)=sz10|~aInteger0(sz10)|~aInteger0(smndt0(xp))),inference(spm,[status(thm)],[4193,4458,theory(equality)])).
% cnf(4758,negated_conjecture,(sdtpldt0(smndt0(xp),sz10)=sz10|sdtpldt0(sz10,xp)=sz10|~aInteger0(sz10)|~aInteger0(smndt0(xp))),inference(rw,[status(thm)],[4727,967,theory(equality)])).
% cnf(4759,negated_conjecture,(sdtpldt0(smndt0(xp),sz10)=sz10|sdtpldt0(sz10,xp)=sz10|$false|~aInteger0(smndt0(xp))),inference(rw,[status(thm)],[4758,57,theory(equality)])).
% cnf(4760,negated_conjecture,(sdtpldt0(smndt0(xp),sz10)=sz10|sdtpldt0(sz10,xp)=sz10|~aInteger0(smndt0(xp))),inference(cn,[status(thm)],[4759,theory(equality)])).
% cnf(4761,negated_conjecture,(sdtpldt0(smndt0(xp),sz10)=sz10|sdtpldt0(sz10,xp)=sz10|~aInteger0(xp)),inference(spm,[status(thm)],[4760,60,theory(equality)])).
% cnf(4762,negated_conjecture,(sdtpldt0(smndt0(xp),sz10)=sz10|sdtpldt0(sz10,xp)=sz10|$false),inference(rw,[status(thm)],[4761,87,theory(equality)])).
% cnf(4763,negated_conjecture,(sdtpldt0(smndt0(xp),sz10)=sz10|sdtpldt0(sz10,xp)=sz10),inference(cn,[status(thm)],[4762,theory(equality)])).
% cnf(4782,negated_conjecture,(sdtpldt0(xp,sz10)=sdtpldt0(sz00,sz10)|sdtpldt0(sz10,xp)=sz10|~aInteger0(sz10)|~aInteger0(xp)),inference(spm,[status(thm)],[4193,4763,theory(equality)])).
% cnf(4813,negated_conjecture,(sdtpldt0(xp,sz10)=sz10|sdtpldt0(sz10,xp)=sz10|~aInteger0(sz10)|~aInteger0(xp)),inference(rw,[status(thm)],[4782,967,theory(equality)])).
% cnf(4814,negated_conjecture,(sdtpldt0(xp,sz10)=sz10|sdtpldt0(sz10,xp)=sz10|$false|~aInteger0(xp)),inference(rw,[status(thm)],[4813,57,theory(equality)])).
% cnf(4815,negated_conjecture,(sdtpldt0(xp,sz10)=sz10|sdtpldt0(sz10,xp)=sz10|$false|$false),inference(rw,[status(thm)],[4814,87,theory(equality)])).
% cnf(4816,negated_conjecture,(sdtpldt0(xp,sz10)=sz10|sdtpldt0(sz10,xp)=sz10),inference(cn,[status(thm)],[4815,theory(equality)])).
% cnf(4817,negated_conjecture,(sz10=sdtpldt0(sz10,xp)|~aInteger0(sz10)|~aInteger0(xp)),inference(spm,[status(thm)],[69,4816,theory(equality)])).
% cnf(4835,negated_conjecture,(sz10=sdtpldt0(sz10,xp)|$false|~aInteger0(xp)),inference(rw,[status(thm)],[4817,57,theory(equality)])).
% cnf(4836,negated_conjecture,(sz10=sdtpldt0(sz10,xp)|$false|$false),inference(rw,[status(thm)],[4835,87,theory(equality)])).
% cnf(4837,negated_conjecture,(sz10=sdtpldt0(sz10,xp)),inference(cn,[status(thm)],[4836,theory(equality)])).
% cnf(4893,negated_conjecture,(sdtpldt0(smndt0(sz10),sz10)=sdtpldt0(sz00,xp)|~aInteger0(xp)|~aInteger0(sz10)),inference(spm,[status(thm)],[3753,4837,theory(equality)])).
% cnf(4926,negated_conjecture,(sz00=sdtpldt0(sz00,xp)|~aInteger0(xp)|~aInteger0(sz10)),inference(rw,[status(thm)],[4893,3844,theory(equality)])).
% cnf(4927,negated_conjecture,(sz00=sdtpldt0(sz00,xp)|$false|~aInteger0(sz10)),inference(rw,[status(thm)],[4926,87,theory(equality)])).
% cnf(4928,negated_conjecture,(sz00=sdtpldt0(sz00,xp)|$false|$false),inference(rw,[status(thm)],[4927,57,theory(equality)])).
% cnf(4929,negated_conjecture,(sz00=sdtpldt0(sz00,xp)),inference(cn,[status(thm)],[4928,theory(equality)])).
% cnf(5098,negated_conjecture,(sz00=xp|~aInteger0(xp)),inference(spm,[status(thm)],[73,4929,theory(equality)])).
% cnf(5138,negated_conjecture,(sz00=xp|$false),inference(rw,[status(thm)],[5098,87,theory(equality)])).
% cnf(5139,negated_conjecture,(sz00=xp),inference(cn,[status(thm)],[5138,theory(equality)])).
% cnf(5140,negated_conjecture,($false),inference(sr,[status(thm)],[5139,86,theory(equality)])).
% cnf(5141,negated_conjecture,($false),5140,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 471
% # ...of these trivial : 13
% # ...subsumed : 178
% # ...remaining for further processing: 280
% # Other redundant clauses eliminated : 10
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 19
% # Backward-rewritten : 23
% # Generated clauses : 1857
% # ...of the previous two non-trivial : 1472
% # Contextual simplify-reflections : 46
% # Paramodulations : 1813
% # Factorizations : 0
% # Equation resolutions : 44
% # Current number of processed clauses: 238
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 207
% # Current number of unprocessed clauses: 1017
% # ...number of literals in the above : 4490
% # Clause-clause subsumption calls (NU) : 1923
% # Rec. Clause-clause subsumption calls : 1242
% # Unit Clause-clause subsumption calls : 33
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 260 leaves, 1.37+/-1.053 terms/leaf
% # Paramod-from index: 120 leaves, 1.04+/-0.200 terms/leaf
% # Paramod-into index: 196 leaves, 1.22+/-0.698 terms/leaf
% # -------------------------------------------------
% # User time : 0.117 s
% # System time : 0.007 s
% # Total time : 0.124 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.28 CPU 0.37 WC
% FINAL PrfWatch: 0.28 CPU 0.37 WC
% SZS output end Solution for /tmp/SystemOnTPTP18202/NUM453+1.tptp
%
%------------------------------------------------------------------------------