TSTP Solution File: NUM454+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM454+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 : art05.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:23 EST 2010

% Result   : Theorem 1.27s
% Output   : Solution 1.27s
% 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/SystemOnTPTP25196/NUM454+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP25196/NUM454+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25196/NUM454+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 25292
% 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(19, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),file('/tmp/SRASS.s.p', mMulMinOne)).
% fof(25, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', mMulOne)).
% fof(26, axiom,![X1]:![X2]:![X3]:(((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X1,X2),X3)=sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)))),file('/tmp/SRASS.s.p', mDistrib)).
% fof(29, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>(sdtasdt0(X1,X2)=sz00=>(X1=sz00|X2=sz00))),file('/tmp/SRASS.s.p', mZeroDiv)).
% fof(36, axiom,![X1]:![X2]:![X3]:(((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))=>sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)),file('/tmp/SRASS.s.p', mMulAsso)).
% fof(42, axiom,![X1]:(aInteger0(X1)=>![X2]:(aDivisorOf0(X2,X1)<=>((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1)))),file('/tmp/SRASS.s.p', mDivisor)).
% fof(49, conjecture,(~(sdtpldt0(sz10,xp)=smndt0(sz10))|~(sdtpldt0(sz10,smndt0(xp))=smndt0(sz10))),file('/tmp/SRASS.s.p', m__)).
% fof(50, negated_conjecture,~((~(sdtpldt0(sz10,xp)=smndt0(sz10))|~(sdtpldt0(sz10,smndt0(xp))=smndt0(sz10)))),inference(assume_negation,[status(cth)],[49])).
% cnf(57,plain,(aInteger0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% cnf(58,plain,(aInteger0(sz10)),inference(split_conjunct,[status(thm)],[2])).
% fof(59, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(60, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(63, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[62])).
% cnf(64,plain,(aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(65, 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(66, 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)],[65])).
% cnf(67,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtpldt0(X1,X2),X3)|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(68, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(69, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|sdtpldt0(X3,X4)=sdtpldt0(X4,X3)),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(71, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(72, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[71])).
% fof(73, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aInteger0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[72])).
% cnf(74,plain,(X1=sdtpldt0(sz00,X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,plain,(sdtpldt0(X1,sz00)=X1|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[73])).
% fof(76, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(77, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,smndt0(X2))=sz00&sz00=sdtpldt0(smndt0(X2),X2))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X2]:((sdtpldt0(X2,smndt0(X2))=sz00|~(aInteger0(X2)))&(sz00=sdtpldt0(smndt0(X2),X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[77])).
% cnf(79,plain,(sz00=sdtpldt0(smndt0(X1),X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[78])).
% cnf(80,plain,(sdtpldt0(X1,smndt0(X1))=sz00|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[78])).
% cnf(87,plain,(xp!=sz00),inference(split_conjunct,[status(thm)],[13])).
% cnf(88,plain,(aInteger0(xp)),inference(split_conjunct,[status(thm)],[13])).
% fof(113, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),inference(fof_nnf,[status(thm)],[19])).
% fof(114, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(smndt0(sz10),X2)=smndt0(X2)&smndt0(X2)=sdtasdt0(X2,smndt0(sz10)))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X2]:((sdtasdt0(smndt0(sz10),X2)=smndt0(X2)|~(aInteger0(X2)))&(smndt0(X2)=sdtasdt0(X2,smndt0(sz10))|~(aInteger0(X2)))),inference(distribute,[status(thm)],[114])).
% cnf(116,plain,(smndt0(X1)=sdtasdt0(X1,smndt0(sz10))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[115])).
% fof(174, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[25])).
% fof(175, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[174])).
% fof(176, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aInteger0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[175])).
% cnf(178,plain,(sdtasdt0(X1,sz10)=X1|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[176])).
% fof(179, plain,![X1]:![X2]:![X3]:(((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X1,X2),X3)=sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)))),inference(fof_nnf,[status(thm)],[26])).
% fof(180, plain,![X4]:![X5]:![X6]:(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X4,X5),X6)=sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6)))),inference(variable_rename,[status(thm)],[179])).
% fof(181, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6))))&(sdtasdt0(sdtpldt0(X4,X5),X6)=sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6))|((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6))))),inference(distribute,[status(thm)],[180])).
% cnf(183,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)),inference(split_conjunct,[status(thm)],[181])).
% fof(201, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|(~(sdtasdt0(X1,X2)=sz00)|(X1=sz00|X2=sz00))),inference(fof_nnf,[status(thm)],[29])).
% fof(202, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|(~(sdtasdt0(X3,X4)=sz00)|(X3=sz00|X4=sz00))),inference(variable_rename,[status(thm)],[201])).
% cnf(203,plain,(X1=sz00|X2=sz00|sdtasdt0(X2,X1)!=sz00|~aInteger0(X1)|~aInteger0(X2)),inference(split_conjunct,[status(thm)],[202])).
% fof(230, plain,![X1]:![X2]:![X3]:(((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)),inference(fof_nnf,[status(thm)],[36])).
% fof(231, plain,![X4]:![X5]:![X6]:(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|sdtasdt0(X4,sdtasdt0(X5,X6))=sdtasdt0(sdtasdt0(X4,X5),X6)),inference(variable_rename,[status(thm)],[230])).
% cnf(232,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[231])).
% fof(270, plain,![X1]:(~(aInteger0(X1))|![X2]:((~(aDivisorOf0(X2,X1))|((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1)))&(((~(aInteger0(X2))|X2=sz00)|![X3]:(~(aInteger0(X3))|~(sdtasdt0(X2,X3)=X1)))|aDivisorOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[42])).
% fof(271, plain,![X4]:(~(aInteger0(X4))|![X5]:((~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&?[X6]:(aInteger0(X6)&sdtasdt0(X5,X6)=X4)))&(((~(aInteger0(X5))|X5=sz00)|![X7]:(~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4)))|aDivisorOf0(X5,X4)))),inference(variable_rename,[status(thm)],[270])).
% fof(272, plain,![X4]:(~(aInteger0(X4))|![X5]:((~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&(aInteger0(esk15_2(X4,X5))&sdtasdt0(X5,esk15_2(X4,X5))=X4)))&(((~(aInteger0(X5))|X5=sz00)|![X7]:(~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4)))|aDivisorOf0(X5,X4)))),inference(skolemize,[status(esa)],[271])).
% fof(273, plain,![X4]:![X5]:![X7]:(((((~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4))|(~(aInteger0(X5))|X5=sz00))|aDivisorOf0(X5,X4))&(~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&(aInteger0(esk15_2(X4,X5))&sdtasdt0(X5,esk15_2(X4,X5))=X4))))|~(aInteger0(X4))),inference(shift_quantors,[status(thm)],[272])).
% fof(274, plain,![X4]:![X5]:![X7]:(((((~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4))|(~(aInteger0(X5))|X5=sz00))|aDivisorOf0(X5,X4))|~(aInteger0(X4)))&((((aInteger0(X5)|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))&((~(X5=sz00)|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4))))&(((aInteger0(esk15_2(X4,X5))|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))&((sdtasdt0(X5,esk15_2(X4,X5))=X4|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))))),inference(distribute,[status(thm)],[273])).
% cnf(275,plain,(sdtasdt0(X2,esk15_2(X1,X2))=X1|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[274])).
% cnf(276,plain,(aInteger0(esk15_2(X1,X2))|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[274])).
% cnf(279,plain,(aDivisorOf0(X2,X1)|X2=sz00|~aInteger0(X1)|~aInteger0(X2)|sdtasdt0(X2,X3)!=X1|~aInteger0(X3)),inference(split_conjunct,[status(thm)],[274])).
% fof(297, negated_conjecture,(sdtpldt0(sz10,xp)=smndt0(sz10)&sdtpldt0(sz10,smndt0(xp))=smndt0(sz10)),inference(fof_nnf,[status(thm)],[50])).
% cnf(298,negated_conjecture,(sdtpldt0(sz10,smndt0(xp))=smndt0(sz10)),inference(split_conjunct,[status(thm)],[297])).
% cnf(299,negated_conjecture,(sdtpldt0(sz10,xp)=smndt0(sz10)),inference(split_conjunct,[status(thm)],[297])).
% cnf(300,negated_conjecture,(sdtpldt0(sz10,smndt0(xp))=sdtpldt0(sz10,xp)),inference(rw,[status(thm)],[298,299,theory(equality)])).
% cnf(303,negated_conjecture,(aInteger0(sdtpldt0(sz10,xp))|~aInteger0(sz10)),inference(spm,[status(thm)],[61,299,theory(equality)])).
% cnf(304,negated_conjecture,(aInteger0(sdtpldt0(sz10,xp))|$false),inference(rw,[status(thm)],[303,58,theory(equality)])).
% cnf(305,negated_conjecture,(aInteger0(sdtpldt0(sz10,xp))),inference(cn,[status(thm)],[304,theory(equality)])).
% cnf(313,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),sz10)=sz00|~aInteger0(sz10)),inference(spm,[status(thm)],[79,299,theory(equality)])).
% cnf(316,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),sz10)=sz00|$false),inference(rw,[status(thm)],[313,58,theory(equality)])).
% cnf(317,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),sz10)=sz00),inference(cn,[status(thm)],[316,theory(equality)])).
% cnf(319,plain,(sdtasdt0(X1,sdtpldt0(sz10,xp))=smndt0(X1)|~aInteger0(X1)),inference(rw,[status(thm)],[116,299,theory(equality)])).
% cnf(452,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)],[70,67,theory(equality)])).
% cnf(456,plain,(sdtpldt0(sz00,X2)=sdtpldt0(smndt0(X1),sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(smndt0(X1))),inference(spm,[status(thm)],[67,79,theory(equality)])).
% cnf(458,plain,(sdtpldt0(X1,X2)=sdtpldt0(sz00,sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(sz00)),inference(spm,[status(thm)],[67,74,theory(equality)])).
% cnf(460,plain,(sdtpldt0(X1,X2)=sdtpldt0(X1,sdtpldt0(sz00,X2))|~aInteger0(X2)|~aInteger0(sz00)|~aInteger0(X1)),inference(spm,[status(thm)],[67,75,theory(equality)])).
% cnf(461,plain,(sdtpldt0(sdtpldt0(X2,X1),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(spm,[status(thm)],[67,70,theory(equality)])).
% cnf(467,plain,(sdtpldt0(X1,X2)=sdtpldt0(sz00,sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[458,57,theory(equality)])).
% cnf(468,plain,(sdtpldt0(X1,X2)=sdtpldt0(sz00,sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(cn,[status(thm)],[467,theory(equality)])).
% cnf(469,plain,(sdtpldt0(X1,X2)=sdtpldt0(X1,sdtpldt0(sz00,X2))|~aInteger0(X2)|$false|~aInteger0(X1)),inference(rw,[status(thm)],[460,57,theory(equality)])).
% cnf(470,plain,(sdtpldt0(X1,X2)=sdtpldt0(X1,sdtpldt0(sz00,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(cn,[status(thm)],[469,theory(equality)])).
% cnf(475,plain,(sz00=X1|aDivisorOf0(X1,X2)|smndt0(X1)!=X2|~aInteger0(sdtpldt0(sz10,xp))|~aInteger0(X1)|~aInteger0(X2)),inference(spm,[status(thm)],[279,319,theory(equality)])).
% cnf(996,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,xp))=sdtpldt0(sz10,xp)|~aInteger0(smndt0(xp))|~aInteger0(sz10)),inference(spm,[status(thm)],[468,300,theory(equality)])).
% cnf(1023,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,xp))=sdtpldt0(sz10,xp)|~aInteger0(smndt0(xp))|$false),inference(rw,[status(thm)],[996,58,theory(equality)])).
% cnf(1024,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,xp))=sdtpldt0(sz10,xp)|~aInteger0(smndt0(xp))),inference(cn,[status(thm)],[1023,theory(equality)])).
% cnf(1037,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,xp))=sdtpldt0(sz10,xp)|~aInteger0(xp)),inference(spm,[status(thm)],[1024,61,theory(equality)])).
% cnf(1038,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,xp))=sdtpldt0(sz10,xp)|$false),inference(rw,[status(thm)],[1037,88,theory(equality)])).
% cnf(1039,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,xp))=sdtpldt0(sz10,xp)),inference(cn,[status(thm)],[1038,theory(equality)])).
% cnf(1041,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),X1)=sdtpldt0(sz00,sdtpldt0(sdtpldt0(sz10,xp),X1))|~aInteger0(X1)|~aInteger0(sdtpldt0(sz10,xp))|~aInteger0(sz00)),inference(spm,[status(thm)],[67,1039,theory(equality)])).
% cnf(1049,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),X1)=sdtpldt0(sz00,sdtpldt0(sdtpldt0(sz10,xp),X1))|~aInteger0(X1)|$false|~aInteger0(sz00)),inference(rw,[status(thm)],[1041,305,theory(equality)])).
% cnf(1050,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),X1)=sdtpldt0(sz00,sdtpldt0(sdtpldt0(sz10,xp),X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[1049,57,theory(equality)])).
% cnf(1051,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),X1)=sdtpldt0(sz00,sdtpldt0(sdtpldt0(sz10,xp),X1))|~aInteger0(X1)),inference(cn,[status(thm)],[1050,theory(equality)])).
% cnf(1071,plain,(sdtpldt0(X1,sdtpldt0(X2,sz00))=sdtpldt0(X1,X2)|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(sz00)),inference(spm,[status(thm)],[470,70,theory(equality)])).
% cnf(1079,plain,(sdtpldt0(X1,sdtpldt0(X2,sz00))=sdtpldt0(X1,X2)|~aInteger0(X2)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[1071,57,theory(equality)])).
% cnf(1080,plain,(sdtpldt0(X1,sdtpldt0(X2,sz00))=sdtpldt0(X1,X2)|~aInteger0(X2)|~aInteger0(X1)),inference(cn,[status(thm)],[1079,theory(equality)])).
% cnf(1090,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(X1,sdtpldt0(sz10,xp)))=sdtpldt0(X1,sdtpldt0(sz10,xp))|~aInteger0(X1)|~aInteger0(sdtpldt0(sz10,xp))),inference(spm,[status(thm)],[1051,70,theory(equality)])).
% cnf(1093,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sdtpldt0(xp,X1)))=sdtpldt0(sz10,sdtpldt0(xp,X1))|~aInteger0(X1)|~aInteger0(xp)|~aInteger0(sz10)),inference(spm,[status(thm)],[1051,67,theory(equality)])).
% cnf(1109,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(X1,sdtpldt0(sz10,xp)))=sdtpldt0(X1,sdtpldt0(sz10,xp))|~aInteger0(X1)|$false),inference(rw,[status(thm)],[1090,305,theory(equality)])).
% cnf(1110,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(X1,sdtpldt0(sz10,xp)))=sdtpldt0(X1,sdtpldt0(sz10,xp))|~aInteger0(X1)),inference(cn,[status(thm)],[1109,theory(equality)])).
% cnf(1116,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sdtpldt0(xp,X1)))=sdtpldt0(sz10,sdtpldt0(xp,X1))|~aInteger0(X1)|$false|~aInteger0(sz10)),inference(rw,[status(thm)],[1093,88,theory(equality)])).
% cnf(1117,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sdtpldt0(xp,X1)))=sdtpldt0(sz10,sdtpldt0(xp,X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[1116,58,theory(equality)])).
% cnf(1118,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sdtpldt0(xp,X1)))=sdtpldt0(sz10,sdtpldt0(xp,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[1117,theory(equality)])).
% cnf(1171,plain,(sdtpldt0(sz00,X1)=sdtpldt0(X1,sz00)|~aInteger0(sz00)|~aInteger0(X1)),inference(spm,[status(thm)],[468,1080,theory(equality)])).
% cnf(1194,plain,(sdtpldt0(sz00,X1)=sdtpldt0(X1,sz00)|$false|~aInteger0(X1)),inference(rw,[status(thm)],[1171,57,theory(equality)])).
% cnf(1195,plain,(sdtpldt0(sz00,X1)=sdtpldt0(X1,sz00)|~aInteger0(X1)),inference(cn,[status(thm)],[1194,theory(equality)])).
% cnf(1285,plain,(aInteger0(sdtpldt0(sz00,X1))|~aInteger0(sz00)|~aInteger0(X1)),inference(spm,[status(thm)],[64,1195,theory(equality)])).
% cnf(1331,plain,(aInteger0(sdtpldt0(sz00,X1))|$false|~aInteger0(X1)),inference(rw,[status(thm)],[1285,57,theory(equality)])).
% cnf(1332,plain,(aInteger0(sdtpldt0(sz00,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[1331,theory(equality)])).
% cnf(1442,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sz00))=sdtpldt0(sz10,sz00)|~aInteger0(smndt0(xp))|~aInteger0(xp)),inference(spm,[status(thm)],[1118,80,theory(equality)])).
% cnf(1460,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sz00))=sdtpldt0(sz10,sz00)|~aInteger0(smndt0(xp))|$false),inference(rw,[status(thm)],[1442,88,theory(equality)])).
% cnf(1461,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sz00))=sdtpldt0(sz10,sz00)|~aInteger0(smndt0(xp))),inference(cn,[status(thm)],[1460,theory(equality)])).
% cnf(1486,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sz00))=sdtpldt0(sz10,sz00)|~aInteger0(xp)),inference(spm,[status(thm)],[1461,61,theory(equality)])).
% cnf(1487,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sz00))=sdtpldt0(sz10,sz00)|$false),inference(rw,[status(thm)],[1486,88,theory(equality)])).
% cnf(1488,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sz00))=sdtpldt0(sz10,sz00)),inference(cn,[status(thm)],[1487,theory(equality)])).
% cnf(1492,negated_conjecture,(sdtpldt0(sz10,sz00)=sdtpldt0(sz00,sz10)|~aInteger0(sz10)|~aInteger0(sz00)),inference(spm,[status(thm)],[1080,1488,theory(equality)])).
% cnf(1497,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10|~aInteger0(sz10)),inference(spm,[status(thm)],[1488,75,theory(equality)])).
% cnf(1507,negated_conjecture,(sdtpldt0(sz10,sz00)=sdtpldt0(sz00,sz10)|$false|~aInteger0(sz00)),inference(rw,[status(thm)],[1492,58,theory(equality)])).
% cnf(1508,negated_conjecture,(sdtpldt0(sz10,sz00)=sdtpldt0(sz00,sz10)|$false|$false),inference(rw,[status(thm)],[1507,57,theory(equality)])).
% cnf(1509,negated_conjecture,(sdtpldt0(sz10,sz00)=sdtpldt0(sz00,sz10)),inference(cn,[status(thm)],[1508,theory(equality)])).
% cnf(1517,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10|$false),inference(rw,[status(thm)],[1497,58,theory(equality)])).
% cnf(1518,negated_conjecture,(sdtpldt0(sz00,sz10)=sz10),inference(cn,[status(thm)],[1517,theory(equality)])).
% cnf(1522,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz00,sdtpldt0(sz10,X1))|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(sz00)),inference(spm,[status(thm)],[67,1518,theory(equality)])).
% cnf(1530,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz00,sdtpldt0(sz10,X1))|~aInteger0(X1)|$false|~aInteger0(sz00)),inference(rw,[status(thm)],[1522,58,theory(equality)])).
% cnf(1531,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz00,sdtpldt0(sz10,X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[1530,57,theory(equality)])).
% cnf(1532,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz00,sdtpldt0(sz10,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[1531,theory(equality)])).
% cnf(1543,negated_conjecture,(sdtpldt0(sz10,sz00)=sz10),inference(rw,[status(thm)],[1509,1518,theory(equality)])).
% cnf(1546,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz10,sdtpldt0(sz00,X1))|~aInteger0(X1)|~aInteger0(sz00)|~aInteger0(sz10)),inference(spm,[status(thm)],[67,1543,theory(equality)])).
% cnf(1562,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz10,sdtpldt0(sz00,X1))|~aInteger0(X1)|$false|~aInteger0(sz10)),inference(rw,[status(thm)],[1546,57,theory(equality)])).
% cnf(1563,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz10,sdtpldt0(sz00,X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[1562,58,theory(equality)])).
% cnf(1564,negated_conjecture,(sdtpldt0(sz10,X1)=sdtpldt0(sz10,sdtpldt0(sz00,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[1563,theory(equality)])).
% cnf(1594,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(X1,sz10))=sdtpldt0(X1,sz10)|~aInteger0(X1)|~aInteger0(sz10)),inference(spm,[status(thm)],[1532,70,theory(equality)])).
% cnf(1634,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(X1,sz10))=sdtpldt0(X1,sz10)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[1594,58,theory(equality)])).
% cnf(1635,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(X1,sz10))=sdtpldt0(X1,sz10)|~aInteger0(X1)),inference(cn,[status(thm)],[1634,theory(equality)])).
% cnf(1648,negated_conjecture,(aInteger0(sdtpldt0(sz10,X1))|~aInteger0(sdtpldt0(sz00,X1))|~aInteger0(sz10)|~aInteger0(X1)),inference(spm,[status(thm)],[64,1564,theory(equality)])).
% cnf(1655,negated_conjecture,(sdtpldt0(sz10,sdtpldt0(X1,sz00))=sdtpldt0(sz10,X1)|~aInteger0(X1)|~aInteger0(sz00)),inference(spm,[status(thm)],[1564,70,theory(equality)])).
% cnf(1658,negated_conjecture,(aInteger0(sdtpldt0(sz10,X1))|~aInteger0(sdtpldt0(sz00,X1))|$false|~aInteger0(X1)),inference(rw,[status(thm)],[1648,58,theory(equality)])).
% cnf(1659,negated_conjecture,(aInteger0(sdtpldt0(sz10,X1))|~aInteger0(sdtpldt0(sz00,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[1658,theory(equality)])).
% cnf(1675,negated_conjecture,(sdtpldt0(sz10,sdtpldt0(X1,sz00))=sdtpldt0(sz10,X1)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[1655,57,theory(equality)])).
% cnf(1676,negated_conjecture,(sdtpldt0(sz10,sdtpldt0(X1,sz00))=sdtpldt0(sz10,X1)|~aInteger0(X1)),inference(cn,[status(thm)],[1675,theory(equality)])).
% cnf(2033,negated_conjecture,(aInteger0(sdtpldt0(sz10,X1))|~aInteger0(X1)),inference(csr,[status(thm)],[1659,1332])).
% cnf(2039,negated_conjecture,(aInteger0(sdtpldt0(X1,sz10))|~aInteger0(X1)|~aInteger0(sz10)),inference(spm,[status(thm)],[2033,70,theory(equality)])).
% cnf(2065,negated_conjecture,(aInteger0(sdtpldt0(X1,sz10))|~aInteger0(X1)|$false),inference(rw,[status(thm)],[2039,58,theory(equality)])).
% cnf(2066,negated_conjecture,(aInteger0(sdtpldt0(X1,sz10))|~aInteger0(X1)),inference(cn,[status(thm)],[2065,theory(equality)])).
% cnf(2883,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(X3,sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(X3)),inference(csr,[status(thm)],[452,64])).
% cnf(2897,negated_conjecture,(sdtpldt0(X1,sdtpldt0(sz00,sz10))=sdtpldt0(sz10,X1)|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(sz00)),inference(spm,[status(thm)],[1676,2883,theory(equality)])).
% cnf(3082,negated_conjecture,(sdtpldt0(X1,sz10)=sdtpldt0(sz10,X1)|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(sz00)),inference(rw,[status(thm)],[2897,1518,theory(equality)])).
% cnf(3083,negated_conjecture,(sdtpldt0(X1,sz10)=sdtpldt0(sz10,X1)|~aInteger0(X1)|$false|~aInteger0(sz00)),inference(rw,[status(thm)],[3082,58,theory(equality)])).
% cnf(3084,negated_conjecture,(sdtpldt0(X1,sz10)=sdtpldt0(sz10,X1)|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[3083,57,theory(equality)])).
% cnf(3085,negated_conjecture,(sdtpldt0(X1,sz10)=sdtpldt0(sz10,X1)|~aInteger0(X1)),inference(cn,[status(thm)],[3084,theory(equality)])).
% cnf(3434,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sz10))=sdtpldt0(sz10,sz10)|~aInteger0(sz10)),inference(spm,[status(thm)],[1635,3085,theory(equality)])).
% cnf(3435,negated_conjecture,(aInteger0(sdtpldt0(sz10,sz10))|~aInteger0(sz10)),inference(spm,[status(thm)],[2066,3085,theory(equality)])).
% cnf(3468,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sz10))=sdtpldt0(sz10,sz10)|$false),inference(rw,[status(thm)],[3434,58,theory(equality)])).
% cnf(3469,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz10,sz10))=sdtpldt0(sz10,sz10)),inference(cn,[status(thm)],[3468,theory(equality)])).
% cnf(3470,negated_conjecture,(aInteger0(sdtpldt0(sz10,sz10))|$false),inference(rw,[status(thm)],[3435,58,theory(equality)])).
% cnf(3471,negated_conjecture,(aInteger0(sdtpldt0(sz10,sz10))),inference(cn,[status(thm)],[3470,theory(equality)])).
% cnf(4614,plain,(sdtpldt0(smndt0(X1),sdtpldt0(X1,X2))=sdtpldt0(sz00,X2)|~aInteger0(X2)|~aInteger0(X1)),inference(csr,[status(thm)],[456,61])).
% cnf(4626,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz00,xp))=sdtpldt0(sz00,xp)|~aInteger0(smndt0(sz10))|~aInteger0(xp)|~aInteger0(sz10)),inference(spm,[status(thm)],[1110,4614,theory(equality)])).
% cnf(4691,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz00,xp))=sdtpldt0(sz00,xp)|$false|~aInteger0(xp)|~aInteger0(sz10)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4626,299,theory(equality)]),305,theory(equality)])).
% cnf(4692,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz00,xp))=sdtpldt0(sz00,xp)|$false|$false|~aInteger0(sz10)),inference(rw,[status(thm)],[4691,88,theory(equality)])).
% cnf(4693,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz00,xp))=sdtpldt0(sz00,xp)|$false|$false|$false),inference(rw,[status(thm)],[4692,58,theory(equality)])).
% cnf(4694,negated_conjecture,(sdtpldt0(sz00,sdtpldt0(sz00,xp))=sdtpldt0(sz00,xp)),inference(cn,[status(thm)],[4693,theory(equality)])).
% cnf(5041,negated_conjecture,(sdtpldt0(sz00,xp)=xp|~aInteger0(xp)),inference(spm,[status(thm)],[4694,74,theory(equality)])).
% cnf(5072,negated_conjecture,(sdtpldt0(sz00,xp)=xp|$false),inference(rw,[status(thm)],[5041,88,theory(equality)])).
% cnf(5073,negated_conjecture,(sdtpldt0(sz00,xp)=xp),inference(cn,[status(thm)],[5072,theory(equality)])).
% cnf(5670,negated_conjecture,(sdtpldt0(xp,sdtpldt0(sz10,sz10))=sz00|~aInteger0(sz10)|~aInteger0(xp)),inference(spm,[status(thm)],[317,461,theory(equality)])).
% cnf(5780,negated_conjecture,(sdtpldt0(xp,sdtpldt0(sz10,sz10))=sz00|$false|~aInteger0(xp)),inference(rw,[status(thm)],[5670,58,theory(equality)])).
% cnf(5781,negated_conjecture,(sdtpldt0(xp,sdtpldt0(sz10,sz10))=sz00|$false|$false),inference(rw,[status(thm)],[5780,88,theory(equality)])).
% cnf(5782,negated_conjecture,(sdtpldt0(xp,sdtpldt0(sz10,sz10))=sz00),inference(cn,[status(thm)],[5781,theory(equality)])).
% cnf(5898,negated_conjecture,(sdtpldt0(smndt0(xp),sz00)=sdtpldt0(sz00,sdtpldt0(sz10,sz10))|~aInteger0(sdtpldt0(sz10,sz10))|~aInteger0(xp)),inference(spm,[status(thm)],[4614,5782,theory(equality)])).
% cnf(5927,negated_conjecture,(sdtpldt0(smndt0(xp),sz00)=sdtpldt0(sz10,sz10)|~aInteger0(sdtpldt0(sz10,sz10))|~aInteger0(xp)),inference(rw,[status(thm)],[5898,3469,theory(equality)])).
% cnf(5928,negated_conjecture,(sdtpldt0(smndt0(xp),sz00)=sdtpldt0(sz10,sz10)|$false|~aInteger0(xp)),inference(rw,[status(thm)],[5927,3471,theory(equality)])).
% cnf(5929,negated_conjecture,(sdtpldt0(smndt0(xp),sz00)=sdtpldt0(sz10,sz10)|$false|$false),inference(rw,[status(thm)],[5928,88,theory(equality)])).
% cnf(5930,negated_conjecture,(sdtpldt0(smndt0(xp),sz00)=sdtpldt0(sz10,sz10)),inference(cn,[status(thm)],[5929,theory(equality)])).
% cnf(5991,negated_conjecture,(sdtpldt0(sz10,sz10)=smndt0(xp)|~aInteger0(smndt0(xp))),inference(spm,[status(thm)],[75,5930,theory(equality)])).
% cnf(6034,negated_conjecture,(smndt0(xp)=sdtpldt0(sz10,sz10)|~aInteger0(xp)),inference(spm,[status(thm)],[5991,61,theory(equality)])).
% cnf(6035,negated_conjecture,(smndt0(xp)=sdtpldt0(sz10,sz10)|$false),inference(rw,[status(thm)],[6034,88,theory(equality)])).
% cnf(6036,negated_conjecture,(smndt0(xp)=sdtpldt0(sz10,sz10)),inference(cn,[status(thm)],[6035,theory(equality)])).
% cnf(6055,negated_conjecture,(sdtpldt0(sz10,sdtpldt0(sz10,sz10))=sdtpldt0(sz10,xp)),inference(rw,[status(thm)],[300,6036,theory(equality)])).
% cnf(6172,negated_conjecture,(sdtpldt0(smndt0(sz10),sdtpldt0(sz10,xp))=sdtpldt0(sz00,sdtpldt0(sz10,sz10))|~aInteger0(sdtpldt0(sz10,sz10))|~aInteger0(sz10)),inference(spm,[status(thm)],[4614,6055,theory(equality)])).
% cnf(6206,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),sdtpldt0(sz10,xp))=sdtpldt0(sz00,sdtpldt0(sz10,sz10))|~aInteger0(sdtpldt0(sz10,sz10))|~aInteger0(sz10)),inference(rw,[status(thm)],[6172,299,theory(equality)])).
% cnf(6207,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),sdtpldt0(sz10,xp))=sdtpldt0(sz10,sz10)|~aInteger0(sdtpldt0(sz10,sz10))|~aInteger0(sz10)),inference(rw,[status(thm)],[6206,3469,theory(equality)])).
% cnf(6208,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),sdtpldt0(sz10,xp))=sdtpldt0(sz10,sz10)|$false|~aInteger0(sz10)),inference(rw,[status(thm)],[6207,3471,theory(equality)])).
% cnf(6209,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),sdtpldt0(sz10,xp))=sdtpldt0(sz10,sz10)|$false|$false),inference(rw,[status(thm)],[6208,58,theory(equality)])).
% cnf(6210,negated_conjecture,(sdtpldt0(sdtpldt0(sz10,xp),sdtpldt0(sz10,xp))=sdtpldt0(sz10,sz10)),inference(cn,[status(thm)],[6209,theory(equality)])).
% cnf(7200,negated_conjecture,(sdtpldt0(sz10,sz10)=sdtpldt0(xp,sdtpldt0(sdtpldt0(sz10,xp),sz10))|~aInteger0(xp)|~aInteger0(sz10)|~aInteger0(sdtpldt0(sz10,xp))),inference(spm,[status(thm)],[2883,6210,theory(equality)])).
% cnf(7237,negated_conjecture,(sdtpldt0(sz10,sz10)=sdtpldt0(xp,sz00)|~aInteger0(xp)|~aInteger0(sz10)|~aInteger0(sdtpldt0(sz10,xp))),inference(rw,[status(thm)],[7200,317,theory(equality)])).
% cnf(7238,negated_conjecture,(sdtpldt0(sz10,sz10)=sdtpldt0(xp,sz00)|$false|~aInteger0(sz10)|~aInteger0(sdtpldt0(sz10,xp))),inference(rw,[status(thm)],[7237,88,theory(equality)])).
% cnf(7239,negated_conjecture,(sdtpldt0(sz10,sz10)=sdtpldt0(xp,sz00)|$false|$false|~aInteger0(sdtpldt0(sz10,xp))),inference(rw,[status(thm)],[7238,58,theory(equality)])).
% cnf(7240,negated_conjecture,(sdtpldt0(sz10,sz10)=sdtpldt0(xp,sz00)|$false|$false|$false),inference(rw,[status(thm)],[7239,305,theory(equality)])).
% cnf(7241,negated_conjecture,(sdtpldt0(sz10,sz10)=sdtpldt0(xp,sz00)),inference(cn,[status(thm)],[7240,theory(equality)])).
% cnf(7273,negated_conjecture,(sdtpldt0(sz10,sz10)=sdtpldt0(sz00,xp)|~aInteger0(sz00)|~aInteger0(xp)),inference(spm,[status(thm)],[70,7241,theory(equality)])).
% cnf(7294,negated_conjecture,(sdtpldt0(sz10,sz10)=xp|~aInteger0(sz00)|~aInteger0(xp)),inference(rw,[status(thm)],[7273,5073,theory(equality)])).
% cnf(7295,negated_conjecture,(sdtpldt0(sz10,sz10)=xp|$false|~aInteger0(xp)),inference(rw,[status(thm)],[7294,57,theory(equality)])).
% cnf(7296,negated_conjecture,(sdtpldt0(sz10,sz10)=xp|$false|$false),inference(rw,[status(thm)],[7295,88,theory(equality)])).
% cnf(7297,negated_conjecture,(sdtpldt0(sz10,sz10)=xp),inference(cn,[status(thm)],[7296,theory(equality)])).
% cnf(7379,negated_conjecture,(smndt0(xp)=xp),inference(rw,[status(thm)],[6036,7297,theory(equality)])).
% cnf(7382,negated_conjecture,(sdtpldt0(xp,xp)=sz00),inference(rw,[status(thm)],[5782,7297,theory(equality)])).
% cnf(8366,plain,(sz00=X1|aDivisorOf0(X1,X2)|smndt0(X1)!=X2|$false|~aInteger0(X1)|~aInteger0(X2)),inference(rw,[status(thm)],[475,305,theory(equality)])).
% cnf(8367,plain,(sz00=X1|aDivisorOf0(X1,X2)|smndt0(X1)!=X2|~aInteger0(X1)|~aInteger0(X2)),inference(cn,[status(thm)],[8366,theory(equality)])).
% cnf(8369,negated_conjecture,(sz00=xp|aDivisorOf0(xp,X1)|xp!=X1|~aInteger0(xp)|~aInteger0(X1)),inference(spm,[status(thm)],[8367,7379,theory(equality)])).
% cnf(8372,negated_conjecture,(sz00=xp|aDivisorOf0(xp,X1)|xp!=X1|$false|~aInteger0(X1)),inference(rw,[status(thm)],[8369,88,theory(equality)])).
% cnf(8373,negated_conjecture,(sz00=xp|aDivisorOf0(xp,X1)|xp!=X1|~aInteger0(X1)),inference(cn,[status(thm)],[8372,theory(equality)])).
% cnf(8374,negated_conjecture,(aDivisorOf0(xp,X1)|xp!=X1|~aInteger0(X1)),inference(sr,[status(thm)],[8373,87,theory(equality)])).
% cnf(8379,negated_conjecture,(aDivisorOf0(xp,xp)|~aInteger0(xp)),inference(er,[status(thm)],[8374,theory(equality)])).
% cnf(8380,negated_conjecture,(aDivisorOf0(xp,xp)|$false),inference(rw,[status(thm)],[8379,88,theory(equality)])).
% cnf(8381,negated_conjecture,(aDivisorOf0(xp,xp)),inference(cn,[status(thm)],[8380,theory(equality)])).
% cnf(8382,negated_conjecture,(aInteger0(esk15_2(xp,xp))|~aInteger0(xp)),inference(spm,[status(thm)],[276,8381,theory(equality)])).
% cnf(8384,negated_conjecture,(sdtasdt0(xp,esk15_2(xp,xp))=xp|~aInteger0(xp)),inference(spm,[status(thm)],[275,8381,theory(equality)])).
% cnf(8385,negated_conjecture,(aInteger0(esk15_2(xp,xp))|$false),inference(rw,[status(thm)],[8382,88,theory(equality)])).
% cnf(8386,negated_conjecture,(aInteger0(esk15_2(xp,xp))),inference(cn,[status(thm)],[8385,theory(equality)])).
% cnf(8390,negated_conjecture,(sdtasdt0(xp,esk15_2(xp,xp))=xp|$false),inference(rw,[status(thm)],[8384,88,theory(equality)])).
% cnf(8391,negated_conjecture,(sdtasdt0(xp,esk15_2(xp,xp))=xp),inference(cn,[status(thm)],[8390,theory(equality)])).
% cnf(8396,negated_conjecture,(sdtasdt0(xp,X1)=sdtasdt0(xp,sdtasdt0(esk15_2(xp,xp),X1))|~aInteger0(X1)|~aInteger0(esk15_2(xp,xp))|~aInteger0(xp)),inference(spm,[status(thm)],[232,8391,theory(equality)])).
% cnf(8417,negated_conjecture,(sdtasdt0(xp,X1)=sdtasdt0(xp,sdtasdt0(esk15_2(xp,xp),X1))|~aInteger0(X1)|$false|~aInteger0(xp)),inference(rw,[status(thm)],[8396,8386,theory(equality)])).
% cnf(8418,negated_conjecture,(sdtasdt0(xp,X1)=sdtasdt0(xp,sdtasdt0(esk15_2(xp,xp),X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[8417,88,theory(equality)])).
% cnf(8419,negated_conjecture,(sdtasdt0(xp,X1)=sdtasdt0(xp,sdtasdt0(esk15_2(xp,xp),X1))|~aInteger0(X1)),inference(cn,[status(thm)],[8418,theory(equality)])).
% cnf(8508,negated_conjecture,(sdtasdt0(xp,esk15_2(xp,xp))=sdtasdt0(xp,sz10)|~aInteger0(sz10)|~aInteger0(esk15_2(xp,xp))),inference(spm,[status(thm)],[8419,178,theory(equality)])).
% cnf(8544,negated_conjecture,(xp=sdtasdt0(xp,sz10)|~aInteger0(sz10)|~aInteger0(esk15_2(xp,xp))),inference(rw,[status(thm)],[8508,8391,theory(equality)])).
% cnf(8545,negated_conjecture,(xp=sdtasdt0(xp,sz10)|$false|~aInteger0(esk15_2(xp,xp))),inference(rw,[status(thm)],[8544,58,theory(equality)])).
% cnf(8546,negated_conjecture,(xp=sdtasdt0(xp,sz10)|$false|$false),inference(rw,[status(thm)],[8545,8386,theory(equality)])).
% cnf(8547,negated_conjecture,(xp=sdtasdt0(xp,sz10)),inference(cn,[status(thm)],[8546,theory(equality)])).
% cnf(8559,negated_conjecture,(sdtpldt0(xp,sdtasdt0(xp,X1))=sdtasdt0(xp,sdtpldt0(sz10,X1))|~aInteger0(xp)|~aInteger0(sz10)|~aInteger0(X1)),inference(spm,[status(thm)],[183,8547,theory(equality)])).
% cnf(8589,negated_conjecture,(sdtpldt0(xp,sdtasdt0(xp,X1))=sdtasdt0(xp,sdtpldt0(sz10,X1))|$false|~aInteger0(sz10)|~aInteger0(X1)),inference(rw,[status(thm)],[8559,88,theory(equality)])).
% cnf(8590,negated_conjecture,(sdtpldt0(xp,sdtasdt0(xp,X1))=sdtasdt0(xp,sdtpldt0(sz10,X1))|$false|$false|~aInteger0(X1)),inference(rw,[status(thm)],[8589,58,theory(equality)])).
% cnf(8591,negated_conjecture,(sdtpldt0(xp,sdtasdt0(xp,X1))=sdtasdt0(xp,sdtpldt0(sz10,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[8590,theory(equality)])).
% cnf(9848,negated_conjecture,(sdtpldt0(xp,xp)=sdtasdt0(xp,sdtpldt0(sz10,sz10))|~aInteger0(sz10)|~aInteger0(xp)),inference(spm,[status(thm)],[8591,178,theory(equality)])).
% cnf(9889,negated_conjecture,(sz00=sdtasdt0(xp,sdtpldt0(sz10,sz10))|~aInteger0(sz10)|~aInteger0(xp)),inference(rw,[status(thm)],[9848,7382,theory(equality)])).
% cnf(9890,negated_conjecture,(sz00=sdtasdt0(xp,xp)|~aInteger0(sz10)|~aInteger0(xp)),inference(rw,[status(thm)],[9889,7297,theory(equality)])).
% cnf(9891,negated_conjecture,(sz00=sdtasdt0(xp,xp)|$false|~aInteger0(xp)),inference(rw,[status(thm)],[9890,58,theory(equality)])).
% cnf(9892,negated_conjecture,(sz00=sdtasdt0(xp,xp)|$false|$false),inference(rw,[status(thm)],[9891,88,theory(equality)])).
% cnf(9893,negated_conjecture,(sz00=sdtasdt0(xp,xp)),inference(cn,[status(thm)],[9892,theory(equality)])).
% cnf(9910,negated_conjecture,(sz00=xp|~aInteger0(xp)),inference(spm,[status(thm)],[203,9893,theory(equality)])).
% cnf(9927,negated_conjecture,(sz00=xp|$false),inference(rw,[status(thm)],[9910,88,theory(equality)])).
% cnf(9928,negated_conjecture,(sz00=xp),inference(cn,[status(thm)],[9927,theory(equality)])).
% cnf(9929,negated_conjecture,($false),inference(sr,[status(thm)],[9928,87,theory(equality)])).
% cnf(9930,negated_conjecture,($false),9929,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 571
% # ...of these trivial                : 26
% # ...subsumed                        : 206
% # ...remaining for further processing: 339
% # Other redundant clauses eliminated : 10
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 15
% # Backward-rewritten                 : 52
% # Generated clauses                  : 3080
% # ...of the previous two non-trivial : 2217
% # Contextual simplify-reflections    : 42
% # Paramodulations                    : 3033
% # Factorizations                     : 0
% # Equation resolutions               : 47
% # Current number of processed clauses: 272
% #    Positive orientable unit clauses: 39
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 230
% # Current number of unprocessed clauses: 1332
% # ...number of literals in the above : 5562
% # Clause-clause subsumption calls (NU) : 2198
% # Rec. Clause-clause subsumption calls : 1455
% # Unit Clause-clause subsumption calls : 119
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 25
% # Indexed BW rewrite successes       : 19
% # Backwards rewriting index:   293 leaves,   1.34+/-1.081 terms/leaf
% # Paramod-from index:          148 leaves,   1.04+/-0.197 terms/leaf
% # Paramod-into index:          225 leaves,   1.21+/-0.728 terms/leaf
% # -------------------------------------------------
% # User time              : 0.162 s
% # System time            : 0.011 s
% # Total time             : 0.173 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.37 CPU 0.48 WC
% FINAL PrfWatch: 0.37 CPU 0.48 WC
% SZS output end Solution for /tmp/SystemOnTPTP25196/NUM454+1.tptp
% 
%------------------------------------------------------------------------------