TSTP Solution File: NUM432+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM432+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 : art07.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 18:58:34 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP22687/NUM432+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22687/NUM432+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22687/NUM432+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 22783
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 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,![X1]:(aInteger0(X1)=>aInteger0(smndt0(X1))),file('/tmp/SRASS.s.p', mIntNeg)).
% fof(3, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>aInteger0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mIntPlus)).
% fof(4, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>aInteger0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mIntMult)).
% fof(7, axiom,![X1]:(aInteger0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', mAddZero)).
% fof(9, 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(10, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(11, 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(12, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', mMulZero)).
% fof(16, axiom,((((aInteger0(xa)&aInteger0(xb))&aInteger0(xq))&~(xq=sz00))&aInteger0(xc)),file('/tmp/SRASS.s.p', m__818)).
% fof(17, axiom,(sdteqdtlpzmzozddtrp0(xa,xb,xq)&sdteqdtlpzmzozddtrp0(xb,xc,xq)),file('/tmp/SRASS.s.p', m__853)).
% fof(18, axiom,(aInteger0(xn)&sdtasdt0(xq,xn)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__876)).
% fof(19, axiom,(aInteger0(xm)&sdtasdt0(xq,xm)=sdtpldt0(xb,smndt0(xc))),file('/tmp/SRASS.s.p', m__899)).
% fof(20, axiom,sdtasdt0(xq,sdtpldt0(xn,xm))=sdtpldt0(xa,smndt0(xc)),file('/tmp/SRASS.s.p', m__924)).
% fof(21, axiom,![X1]:![X2]:![X3]:((((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))&~(X3=sz00))=>(sdteqdtlpzmzozddtrp0(X1,X2,X3)<=>aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))))),file('/tmp/SRASS.s.p', mEquMod)).
% fof(23, 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(24, axiom,aInteger0(sz10),file('/tmp/SRASS.s.p', mIntOne)).
% fof(25, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', mMulOne)).
% fof(27, conjecture,sdteqdtlpzmzozddtrp0(xa,xc,xq),file('/tmp/SRASS.s.p', m__)).
% fof(28, negated_conjecture,~(sdteqdtlpzmzozddtrp0(xa,xc,xq)),inference(assume_negation,[status(cth)],[27])).
% fof(30, negated_conjecture,~(sdteqdtlpzmzozddtrp0(xa,xc,xq)),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% cnf(31,plain,(aInteger0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(32, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(33, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(36, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(39, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(47, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(48, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aInteger0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(X1=sdtpldt0(sz00,X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(57, 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)],[9])).
% fof(58, 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)],[57])).
% cnf(59,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(61, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(63, 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)],[11])).
% fof(64, 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)],[63])).
% fof(65, 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)],[64])).
% cnf(67,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)),inference(split_conjunct,[status(thm)],[65])).
% fof(68, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(69, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aInteger0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[69])).
% cnf(72,plain,(sdtasdt0(X1,sz00)=sz00|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[70])).
% cnf(82,plain,(aInteger0(xc)),inference(split_conjunct,[status(thm)],[16])).
% cnf(83,plain,(xq!=sz00),inference(split_conjunct,[status(thm)],[16])).
% cnf(84,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[16])).
% cnf(85,plain,(aInteger0(xb)),inference(split_conjunct,[status(thm)],[16])).
% cnf(86,plain,(aInteger0(xa)),inference(split_conjunct,[status(thm)],[16])).
% cnf(87,plain,(sdteqdtlpzmzozddtrp0(xb,xc,xq)),inference(split_conjunct,[status(thm)],[17])).
% cnf(90,plain,(aInteger0(xn)),inference(split_conjunct,[status(thm)],[18])).
% cnf(91,plain,(sdtasdt0(xq,xm)=sdtpldt0(xb,smndt0(xc))),inference(split_conjunct,[status(thm)],[19])).
% cnf(92,plain,(aInteger0(xm)),inference(split_conjunct,[status(thm)],[19])).
% cnf(93,plain,(sdtasdt0(xq,sdtpldt0(xn,xm))=sdtpldt0(xa,smndt0(xc))),inference(split_conjunct,[status(thm)],[20])).
% fof(94, plain,![X1]:![X2]:![X3]:((((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|X3=sz00)|((~(sdteqdtlpzmzozddtrp0(X1,X2,X3))|aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))))&(~(aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))))|sdteqdtlpzmzozddtrp0(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[21])).
% fof(95, plain,![X4]:![X5]:![X6]:((((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00)|((~(sdteqdtlpzmzozddtrp0(X4,X5,X6))|aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))&(~(aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))|sdteqdtlpzmzozddtrp0(X4,X5,X6)))),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,![X4]:![X5]:![X6]:(((~(sdteqdtlpzmzozddtrp0(X4,X5,X6))|aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))|(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00))&((~(aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))|sdteqdtlpzmzozddtrp0(X4,X5,X6))|(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00))),inference(distribute,[status(thm)],[95])).
% cnf(97,plain,(X1=sz00|sdteqdtlpzmzozddtrp0(X3,X2,X1)|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)|~aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2)))),inference(split_conjunct,[status(thm)],[96])).
% cnf(98,plain,(X1=sz00|aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2)))|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)|~sdteqdtlpzmzozddtrp0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[96])).
% fof(104, 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)],[23])).
% fof(105, 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)],[104])).
% fof(106, plain,![X4]:(~(aInteger0(X4))|![X5]:((~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&(aInteger0(esk1_2(X4,X5))&sdtasdt0(X5,esk1_2(X4,X5))=X4)))&(((~(aInteger0(X5))|X5=sz00)|![X7]:(~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4)))|aDivisorOf0(X5,X4)))),inference(skolemize,[status(esa)],[105])).
% fof(107, 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(esk1_2(X4,X5))&sdtasdt0(X5,esk1_2(X4,X5))=X4))))|~(aInteger0(X4))),inference(shift_quantors,[status(thm)],[106])).
% fof(108, 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(esk1_2(X4,X5))|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))&((sdtasdt0(X5,esk1_2(X4,X5))=X4|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))))),inference(distribute,[status(thm)],[107])).
% cnf(109,plain,(sdtasdt0(X2,esk1_2(X1,X2))=X1|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[108])).
% cnf(110,plain,(aInteger0(esk1_2(X1,X2))|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[108])).
% cnf(113,plain,(aDivisorOf0(X2,X1)|X2=sz00|~aInteger0(X1)|~aInteger0(X2)|sdtasdt0(X2,X3)!=X1|~aInteger0(X3)),inference(split_conjunct,[status(thm)],[108])).
% cnf(114,plain,(aInteger0(sz10)),inference(split_conjunct,[status(thm)],[24])).
% fof(115, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[25])).
% fof(116, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aInteger0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[116])).
% cnf(119,plain,(sdtasdt0(X1,sz10)=X1|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[117])).
% cnf(122,negated_conjecture,(~sdteqdtlpzmzozddtrp0(xa,xc,xq)),inference(split_conjunct,[status(thm)],[30])).
% cnf(130,plain,(aInteger0(sdtasdt0(xq,xm))|~aInteger0(smndt0(xc))|~aInteger0(xb)),inference(spm,[status(thm)],[37,91,theory(equality)])).
% cnf(136,plain,(aInteger0(sdtasdt0(xq,xm))|~aInteger0(smndt0(xc))|$false),inference(rw,[status(thm)],[130,85,theory(equality)])).
% cnf(137,plain,(aInteger0(sdtasdt0(xq,xm))|~aInteger0(smndt0(xc))),inference(cn,[status(thm)],[136,theory(equality)])).
% cnf(240,plain,(sz00=X1|aDivisorOf0(X1,sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(sdtasdt0(X1,X2))),inference(er,[status(thm)],[113,theory(equality)])).
% cnf(286,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aInteger0(sdtasdt0(X2,X3))|~aInteger0(X1)|~aInteger0(X3)|~aInteger0(X2)),inference(spm,[status(thm)],[62,59,theory(equality)])).
% cnf(313,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xa,xc,X1)|~aDivisorOf0(X1,sdtasdt0(xq,sdtpldt0(xn,xm)))|~aInteger0(xa)|~aInteger0(xc)|~aInteger0(X1)),inference(spm,[status(thm)],[97,93,theory(equality)])).
% cnf(324,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xa,xc,X1)|~aDivisorOf0(X1,sdtasdt0(xq,sdtpldt0(xn,xm)))|$false|~aInteger0(xc)|~aInteger0(X1)),inference(rw,[status(thm)],[313,86,theory(equality)])).
% cnf(325,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xa,xc,X1)|~aDivisorOf0(X1,sdtasdt0(xq,sdtpldt0(xn,xm)))|$false|$false|~aInteger0(X1)),inference(rw,[status(thm)],[324,82,theory(equality)])).
% cnf(326,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xa,xc,X1)|~aDivisorOf0(X1,sdtasdt0(xq,sdtpldt0(xn,xm)))|~aInteger0(X1)),inference(cn,[status(thm)],[325,theory(equality)])).
% cnf(332,plain,(sz00=xq|aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc)))|~aInteger0(xb)|~aInteger0(xc)|~aInteger0(xq)),inference(spm,[status(thm)],[98,87,theory(equality)])).
% cnf(335,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xm))|~aInteger0(xb)|~aInteger0(xc)|~aInteger0(xq)),inference(rw,[status(thm)],[332,91,theory(equality)])).
% cnf(336,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xm))|$false|~aInteger0(xc)|~aInteger0(xq)),inference(rw,[status(thm)],[335,85,theory(equality)])).
% cnf(337,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xm))|$false|$false|~aInteger0(xq)),inference(rw,[status(thm)],[336,82,theory(equality)])).
% cnf(338,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xm))|$false|$false|$false),inference(rw,[status(thm)],[337,84,theory(equality)])).
% cnf(339,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xm))),inference(cn,[status(thm)],[338,theory(equality)])).
% cnf(340,plain,(aDivisorOf0(xq,sdtasdt0(xq,xm))),inference(sr,[status(thm)],[339,83,theory(equality)])).
% cnf(448,plain,(aInteger0(esk1_2(sdtasdt0(xq,xm),xq))|~aInteger0(sdtasdt0(xq,xm))),inference(spm,[status(thm)],[110,340,theory(equality)])).
% cnf(450,plain,(sdtasdt0(xq,esk1_2(sdtasdt0(xq,xm),xq))=sdtasdt0(xq,xm)|~aInteger0(sdtasdt0(xq,xm))),inference(spm,[status(thm)],[109,340,theory(equality)])).
% cnf(479,plain,(aInteger0(esk1_2(sdtasdt0(xq,xm),xq))|~aInteger0(xm)|~aInteger0(xq)),inference(spm,[status(thm)],[448,40,theory(equality)])).
% cnf(480,plain,(aInteger0(esk1_2(sdtasdt0(xq,xm),xq))|$false|~aInteger0(xq)),inference(rw,[status(thm)],[479,92,theory(equality)])).
% cnf(481,plain,(aInteger0(esk1_2(sdtasdt0(xq,xm),xq))|$false|$false),inference(rw,[status(thm)],[480,84,theory(equality)])).
% cnf(482,plain,(aInteger0(esk1_2(sdtasdt0(xq,xm),xq))),inference(cn,[status(thm)],[481,theory(equality)])).
% cnf(521,plain,(aInteger0(sdtasdt0(xq,xm))|~aInteger0(xc)),inference(spm,[status(thm)],[137,34,theory(equality)])).
% cnf(522,plain,(aInteger0(sdtasdt0(xq,xm))|$false),inference(rw,[status(thm)],[521,82,theory(equality)])).
% cnf(523,plain,(aInteger0(sdtasdt0(xq,xm))),inference(cn,[status(thm)],[522,theory(equality)])).
% cnf(548,plain,(sdtasdt0(xq,esk1_2(sdtasdt0(xq,xm),xq))=sdtasdt0(xq,xm)|$false),inference(rw,[status(thm)],[450,523,theory(equality)])).
% cnf(549,plain,(sdtasdt0(xq,esk1_2(sdtasdt0(xq,xm),xq))=sdtasdt0(xq,xm)),inference(cn,[status(thm)],[548,theory(equality)])).
% cnf(552,plain,(sdtasdt0(sdtasdt0(xq,xm),X1)=sdtasdt0(xq,sdtasdt0(esk1_2(sdtasdt0(xq,xm),xq),X1))|~aInteger0(X1)|~aInteger0(esk1_2(sdtasdt0(xq,xm),xq))|~aInteger0(xq)),inference(spm,[status(thm)],[59,549,theory(equality)])).
% cnf(566,plain,(sdtasdt0(sdtasdt0(xq,xm),X1)=sdtasdt0(xq,sdtasdt0(esk1_2(sdtasdt0(xq,xm),xq),X1))|~aInteger0(X1)|$false|~aInteger0(xq)),inference(rw,[status(thm)],[552,482,theory(equality)])).
% cnf(567,plain,(sdtasdt0(sdtasdt0(xq,xm),X1)=sdtasdt0(xq,sdtasdt0(esk1_2(sdtasdt0(xq,xm),xq),X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[566,84,theory(equality)])).
% cnf(568,plain,(sdtasdt0(sdtasdt0(xq,xm),X1)=sdtasdt0(xq,sdtasdt0(esk1_2(sdtasdt0(xq,xm),xq),X1))|~aInteger0(X1)),inference(cn,[status(thm)],[567,theory(equality)])).
% cnf(642,plain,(sdtasdt0(xq,sz00)=sdtasdt0(sdtasdt0(xq,xm),sz00)|~aInteger0(sz00)|~aInteger0(esk1_2(sdtasdt0(xq,xm),xq))),inference(spm,[status(thm)],[568,72,theory(equality)])).
% cnf(669,plain,(sdtasdt0(xq,sz00)=sdtasdt0(sdtasdt0(xq,xm),sz00)|$false|~aInteger0(esk1_2(sdtasdt0(xq,xm),xq))),inference(rw,[status(thm)],[642,31,theory(equality)])).
% cnf(670,plain,(sdtasdt0(xq,sz00)=sdtasdt0(sdtasdt0(xq,xm),sz00)|$false|$false),inference(rw,[status(thm)],[669,482,theory(equality)])).
% cnf(671,plain,(sdtasdt0(xq,sz00)=sdtasdt0(sdtasdt0(xq,xm),sz00)),inference(cn,[status(thm)],[670,theory(equality)])).
% cnf(685,plain,(sdtasdt0(xq,sz00)=sz00|~aInteger0(sdtasdt0(xq,xm))),inference(spm,[status(thm)],[72,671,theory(equality)])).
% cnf(714,plain,(sdtasdt0(xq,sz00)=sz00|$false),inference(rw,[status(thm)],[685,523,theory(equality)])).
% cnf(715,plain,(sdtasdt0(xq,sz00)=sz00),inference(cn,[status(thm)],[714,theory(equality)])).
% cnf(724,plain,(sdtpldt0(sz00,sdtasdt0(xq,X1))=sdtasdt0(xq,sdtpldt0(sz00,X1))|~aInteger0(xq)|~aInteger0(sz00)|~aInteger0(X1)),inference(spm,[status(thm)],[67,715,theory(equality)])).
% cnf(743,plain,(sdtpldt0(sz00,sdtasdt0(xq,X1))=sdtasdt0(xq,sdtpldt0(sz00,X1))|$false|~aInteger0(sz00)|~aInteger0(X1)),inference(rw,[status(thm)],[724,84,theory(equality)])).
% cnf(744,plain,(sdtpldt0(sz00,sdtasdt0(xq,X1))=sdtasdt0(xq,sdtpldt0(sz00,X1))|$false|$false|~aInteger0(X1)),inference(rw,[status(thm)],[743,31,theory(equality)])).
% cnf(745,plain,(sdtpldt0(sz00,sdtasdt0(xq,X1))=sdtasdt0(xq,sdtpldt0(sz00,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[744,theory(equality)])).
% cnf(2052,plain,(sdtpldt0(sz00,xq)=sdtasdt0(xq,sdtpldt0(sz00,sz10))|~aInteger0(sz10)|~aInteger0(xq)),inference(spm,[status(thm)],[745,119,theory(equality)])).
% cnf(2072,plain,(sdtpldt0(sz00,xq)=sdtasdt0(xq,sdtpldt0(sz00,sz10))|$false|~aInteger0(xq)),inference(rw,[status(thm)],[2052,114,theory(equality)])).
% cnf(2073,plain,(sdtpldt0(sz00,xq)=sdtasdt0(xq,sdtpldt0(sz00,sz10))|$false|$false),inference(rw,[status(thm)],[2072,84,theory(equality)])).
% cnf(2074,plain,(sdtpldt0(sz00,xq)=sdtasdt0(xq,sdtpldt0(sz00,sz10))),inference(cn,[status(thm)],[2073,theory(equality)])).
% cnf(2104,plain,(sdtasdt0(xq,sz10)=sdtpldt0(sz00,xq)|~aInteger0(sz10)),inference(spm,[status(thm)],[2074,50,theory(equality)])).
% cnf(2123,plain,(sdtasdt0(xq,sz10)=sdtpldt0(sz00,xq)|$false),inference(rw,[status(thm)],[2104,114,theory(equality)])).
% cnf(2124,plain,(sdtasdt0(xq,sz10)=sdtpldt0(sz00,xq)),inference(cn,[status(thm)],[2123,theory(equality)])).
% cnf(2127,plain,(sdtasdt0(xq,sz10)=xq|~aInteger0(xq)),inference(spm,[status(thm)],[50,2124,theory(equality)])).
% cnf(2135,plain,(sdtasdt0(xq,sz10)=xq|$false),inference(rw,[status(thm)],[2127,84,theory(equality)])).
% cnf(2136,plain,(sdtasdt0(xq,sz10)=xq),inference(cn,[status(thm)],[2135,theory(equality)])).
% cnf(2139,plain,(sdtasdt0(xq,X1)=sdtasdt0(xq,sdtasdt0(sz10,X1))|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(xq)),inference(spm,[status(thm)],[59,2136,theory(equality)])).
% cnf(2155,plain,(sdtasdt0(xq,X1)=sdtasdt0(xq,sdtasdt0(sz10,X1))|~aInteger0(X1)|$false|~aInteger0(xq)),inference(rw,[status(thm)],[2139,114,theory(equality)])).
% cnf(2156,plain,(sdtasdt0(xq,X1)=sdtasdt0(xq,sdtasdt0(sz10,X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[2155,84,theory(equality)])).
% cnf(2157,plain,(sdtasdt0(xq,X1)=sdtasdt0(xq,sdtasdt0(sz10,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[2156,theory(equality)])).
% cnf(2352,plain,(sz00=X1|aDivisorOf0(X1,sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(csr,[status(thm)],[240,40])).
% cnf(6468,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aInteger0(X1)|~aInteger0(X3)|~aInteger0(X2)),inference(csr,[status(thm)],[286,40])).
% cnf(6479,plain,(sdtasdt0(X1,sdtasdt0(xq,sz10))=sdtasdt0(xq,X1)|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(xq)),inference(spm,[status(thm)],[2157,6468,theory(equality)])).
% cnf(6672,plain,(sdtasdt0(X1,xq)=sdtasdt0(xq,X1)|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(xq)),inference(rw,[status(thm)],[6479,2136,theory(equality)])).
% cnf(6673,plain,(sdtasdt0(X1,xq)=sdtasdt0(xq,X1)|~aInteger0(X1)|$false|~aInteger0(xq)),inference(rw,[status(thm)],[6672,114,theory(equality)])).
% cnf(6674,plain,(sdtasdt0(X1,xq)=sdtasdt0(xq,X1)|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[6673,84,theory(equality)])).
% cnf(6675,plain,(sdtasdt0(X1,xq)=sdtasdt0(xq,X1)|~aInteger0(X1)),inference(cn,[status(thm)],[6674,theory(equality)])).
% cnf(8060,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(X1,xq))|~aInteger0(X1)|~aInteger0(xq)),inference(spm,[status(thm)],[2352,6675,theory(equality)])).
% cnf(8145,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(X1,xq))|~aInteger0(X1)|$false),inference(rw,[status(thm)],[8060,84,theory(equality)])).
% cnf(8146,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(X1,xq))|~aInteger0(X1)),inference(cn,[status(thm)],[8145,theory(equality)])).
% cnf(8147,plain,(aDivisorOf0(xq,sdtasdt0(X1,xq))|~aInteger0(X1)),inference(sr,[status(thm)],[8146,83,theory(equality)])).
% cnf(9438,plain,(aDivisorOf0(xq,sdtasdt0(xq,X1))|~aInteger0(X1)|~aInteger0(xq)),inference(spm,[status(thm)],[8147,62,theory(equality)])).
% cnf(9464,plain,(aDivisorOf0(xq,sdtasdt0(xq,X1))|~aInteger0(X1)|$false),inference(rw,[status(thm)],[9438,84,theory(equality)])).
% cnf(9465,plain,(aDivisorOf0(xq,sdtasdt0(xq,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[9464,theory(equality)])).
% cnf(10566,plain,(sz00=xq|sdteqdtlpzmzozddtrp0(xa,xc,xq)|~aInteger0(xq)|~aInteger0(sdtpldt0(xn,xm))),inference(spm,[status(thm)],[326,9465,theory(equality)])).
% cnf(10572,plain,(sz00=xq|sdteqdtlpzmzozddtrp0(xa,xc,xq)|$false|~aInteger0(sdtpldt0(xn,xm))),inference(rw,[status(thm)],[10566,84,theory(equality)])).
% cnf(10573,plain,(sz00=xq|sdteqdtlpzmzozddtrp0(xa,xc,xq)|~aInteger0(sdtpldt0(xn,xm))),inference(cn,[status(thm)],[10572,theory(equality)])).
% cnf(10574,plain,(sdteqdtlpzmzozddtrp0(xa,xc,xq)|~aInteger0(sdtpldt0(xn,xm))),inference(sr,[status(thm)],[10573,83,theory(equality)])).
% cnf(10575,plain,(~aInteger0(sdtpldt0(xn,xm))),inference(sr,[status(thm)],[10574,122,theory(equality)])).
% cnf(10582,plain,(~aInteger0(xm)|~aInteger0(xn)),inference(spm,[status(thm)],[10575,37,theory(equality)])).
% cnf(10583,plain,($false|~aInteger0(xn)),inference(rw,[status(thm)],[10582,92,theory(equality)])).
% cnf(10584,plain,($false|$false),inference(rw,[status(thm)],[10583,90,theory(equality)])).
% cnf(10585,plain,($false),inference(cn,[status(thm)],[10584,theory(equality)])).
% cnf(10586,plain,($false),10585,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 595
% # ...of these trivial : 23
% # ...subsumed : 260
% # ...remaining for further processing: 312
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 26
% # Generated clauses : 3405
% # ...of the previous two non-trivial : 2660
% # Contextual simplify-reflections : 53
% # Paramodulations : 3386
% # Factorizations : 0
% # Equation resolutions : 19
% # Current number of processed clauses: 238
% # Positive orientable unit clauses: 82
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 152
% # Current number of unprocessed clauses: 2046
% # ...number of literals in the above : 8221
% # Clause-clause subsumption calls (NU) : 1831
% # Rec. Clause-clause subsumption calls : 1389
% # Unit Clause-clause subsumption calls : 21
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 28
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 270 leaves, 1.21+/-0.709 terms/leaf
% # Paramod-from index: 180 leaves, 1.11+/-0.373 terms/leaf
% # Paramod-into index: 246 leaves, 1.16+/-0.566 terms/leaf
% # -------------------------------------------------
% # User time : 0.141 s
% # System time : 0.008 s
% # Total time : 0.149 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.34 CPU 0.43 WC
% FINAL PrfWatch: 0.34 CPU 0.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP22687/NUM432+1.tptp
%
%------------------------------------------------------------------------------