TSTP Solution File: NUM427+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM427+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:01:43 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP28597/NUM427+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28597/NUM427+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28597/NUM427+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 28729
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.03 WC
% # Preprocessing time : 0.012 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(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(15, axiom,(((aInteger0(xa)&aInteger0(xb))&aInteger0(xq))&~(xq=sz00)),file('/tmp/SRASS.s.p', m__704)).
% fof(16, axiom,sdteqdtlpzmzozddtrp0(xa,xb,xq),file('/tmp/SRASS.s.p', m__724)).
% fof(17, axiom,(aInteger0(xn)&sdtasdt0(xq,xn)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__747)).
% fof(18, axiom,sdtasdt0(xq,smndt0(xn))=sdtpldt0(xb,smndt0(xa)),file('/tmp/SRASS.s.p', m__767)).
% fof(19, 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(21, 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(22, axiom,aInteger0(sz10),file('/tmp/SRASS.s.p', mIntOne)).
% fof(23, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', mMulOne)).
% fof(25, conjecture,sdteqdtlpzmzozddtrp0(xb,xa,xq),file('/tmp/SRASS.s.p', m__)).
% fof(26, negated_conjecture,~(sdteqdtlpzmzozddtrp0(xb,xa,xq)),inference(assume_negation,[status(cth)],[25])).
% fof(28, negated_conjecture,~(sdteqdtlpzmzozddtrp0(xb,xa,xq)),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% cnf(29,plain,(aInteger0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(30, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(31, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(36, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(37, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(45, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(46, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aInteger0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[46])).
% cnf(48,plain,(X1=sdtpldt0(sz00,X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(55, 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(56, 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)],[55])).
% cnf(57,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(59, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(61, 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(62, 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)],[61])).
% fof(63, 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)],[62])).
% cnf(65,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)),inference(split_conjunct,[status(thm)],[63])).
% fof(66, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(67, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[66])).
% fof(68, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aInteger0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[67])).
% cnf(70,plain,(sdtasdt0(X1,sz00)=sz00|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[68])).
% cnf(77,plain,(xq!=sz00),inference(split_conjunct,[status(thm)],[15])).
% cnf(78,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[15])).
% cnf(79,plain,(aInteger0(xb)),inference(split_conjunct,[status(thm)],[15])).
% cnf(80,plain,(aInteger0(xa)),inference(split_conjunct,[status(thm)],[15])).
% cnf(81,plain,(sdteqdtlpzmzozddtrp0(xa,xb,xq)),inference(split_conjunct,[status(thm)],[16])).
% cnf(82,plain,(sdtasdt0(xq,xn)=sdtpldt0(xa,smndt0(xb))),inference(split_conjunct,[status(thm)],[17])).
% cnf(83,plain,(aInteger0(xn)),inference(split_conjunct,[status(thm)],[17])).
% cnf(84,plain,(sdtasdt0(xq,smndt0(xn))=sdtpldt0(xb,smndt0(xa))),inference(split_conjunct,[status(thm)],[18])).
% fof(85, 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)],[19])).
% fof(86, 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)],[85])).
% fof(87, 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)],[86])).
% cnf(88,plain,(X1=sz00|sdteqdtlpzmzozddtrp0(X3,X2,X1)|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)|~aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2)))),inference(split_conjunct,[status(thm)],[87])).
% cnf(89,plain,(X1=sz00|aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2)))|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)|~sdteqdtlpzmzozddtrp0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[87])).
% fof(95, 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)],[21])).
% fof(96, 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)],[95])).
% fof(97, 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)],[96])).
% fof(98, 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)],[97])).
% fof(99, 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)],[98])).
% cnf(100,plain,(sdtasdt0(X2,esk1_2(X1,X2))=X1|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[99])).
% cnf(101,plain,(aInteger0(esk1_2(X1,X2))|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[99])).
% cnf(104,plain,(aDivisorOf0(X2,X1)|X2=sz00|~aInteger0(X1)|~aInteger0(X2)|sdtasdt0(X2,X3)!=X1|~aInteger0(X3)),inference(split_conjunct,[status(thm)],[99])).
% cnf(105,plain,(aInteger0(sz10)),inference(split_conjunct,[status(thm)],[22])).
% fof(106, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[23])).
% fof(107, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[106])).
% fof(108, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aInteger0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[107])).
% cnf(110,plain,(sdtasdt0(X1,sz10)=X1|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[108])).
% cnf(113,negated_conjecture,(~sdteqdtlpzmzozddtrp0(xb,xa,xq)),inference(split_conjunct,[status(thm)],[28])).
% cnf(215,plain,(sz00=X1|aDivisorOf0(X1,sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)|~aInteger0(sdtasdt0(X1,X2))),inference(er,[status(thm)],[104,theory(equality)])).
% cnf(258,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)],[60,57,theory(equality)])).
% cnf(284,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xb,xa,X1)|~aDivisorOf0(X1,sdtasdt0(xq,smndt0(xn)))|~aInteger0(xb)|~aInteger0(xa)|~aInteger0(X1)),inference(spm,[status(thm)],[88,84,theory(equality)])).
% cnf(292,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xb,xa,X1)|~aDivisorOf0(X1,sdtasdt0(xq,smndt0(xn)))|$false|~aInteger0(xa)|~aInteger0(X1)),inference(rw,[status(thm)],[284,79,theory(equality)])).
% cnf(293,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xb,xa,X1)|~aDivisorOf0(X1,sdtasdt0(xq,smndt0(xn)))|$false|$false|~aInteger0(X1)),inference(rw,[status(thm)],[292,80,theory(equality)])).
% cnf(294,plain,(sz00=X1|sdteqdtlpzmzozddtrp0(xb,xa,X1)|~aDivisorOf0(X1,sdtasdt0(xq,smndt0(xn)))|~aInteger0(X1)),inference(cn,[status(thm)],[293,theory(equality)])).
% cnf(300,plain,(sz00=xq|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))|~aInteger0(xa)|~aInteger0(xb)|~aInteger0(xq)),inference(spm,[status(thm)],[89,81,theory(equality)])).
% cnf(302,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xn))|~aInteger0(xa)|~aInteger0(xb)|~aInteger0(xq)),inference(rw,[status(thm)],[300,82,theory(equality)])).
% cnf(303,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xn))|$false|~aInteger0(xb)|~aInteger0(xq)),inference(rw,[status(thm)],[302,80,theory(equality)])).
% cnf(304,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xn))|$false|$false|~aInteger0(xq)),inference(rw,[status(thm)],[303,79,theory(equality)])).
% cnf(305,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xn))|$false|$false|$false),inference(rw,[status(thm)],[304,78,theory(equality)])).
% cnf(306,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(xq,xn))),inference(cn,[status(thm)],[305,theory(equality)])).
% cnf(307,plain,(aDivisorOf0(xq,sdtasdt0(xq,xn))),inference(sr,[status(thm)],[306,77,theory(equality)])).
% cnf(385,plain,(aInteger0(esk1_2(sdtasdt0(xq,xn),xq))|~aInteger0(sdtasdt0(xq,xn))),inference(spm,[status(thm)],[101,307,theory(equality)])).
% cnf(387,plain,(sdtasdt0(xq,esk1_2(sdtasdt0(xq,xn),xq))=sdtasdt0(xq,xn)|~aInteger0(sdtasdt0(xq,xn))),inference(spm,[status(thm)],[100,307,theory(equality)])).
% cnf(392,plain,(aInteger0(esk1_2(sdtasdt0(xq,xn),xq))|~aInteger0(xn)|~aInteger0(xq)),inference(spm,[status(thm)],[385,38,theory(equality)])).
% cnf(393,plain,(aInteger0(esk1_2(sdtasdt0(xq,xn),xq))|$false|~aInteger0(xq)),inference(rw,[status(thm)],[392,83,theory(equality)])).
% cnf(394,plain,(aInteger0(esk1_2(sdtasdt0(xq,xn),xq))|$false|$false),inference(rw,[status(thm)],[393,78,theory(equality)])).
% cnf(395,plain,(aInteger0(esk1_2(sdtasdt0(xq,xn),xq))),inference(cn,[status(thm)],[394,theory(equality)])).
% cnf(397,plain,(sdtasdt0(xq,esk1_2(sdtasdt0(xq,xn),xq))=sdtasdt0(xq,xn)|~aInteger0(xn)|~aInteger0(xq)),inference(spm,[status(thm)],[387,38,theory(equality)])).
% cnf(398,plain,(sdtasdt0(xq,esk1_2(sdtasdt0(xq,xn),xq))=sdtasdt0(xq,xn)|$false|~aInteger0(xq)),inference(rw,[status(thm)],[397,83,theory(equality)])).
% cnf(399,plain,(sdtasdt0(xq,esk1_2(sdtasdt0(xq,xn),xq))=sdtasdt0(xq,xn)|$false|$false),inference(rw,[status(thm)],[398,78,theory(equality)])).
% cnf(400,plain,(sdtasdt0(xq,esk1_2(sdtasdt0(xq,xn),xq))=sdtasdt0(xq,xn)),inference(cn,[status(thm)],[399,theory(equality)])).
% cnf(402,plain,(aInteger0(sdtasdt0(xq,xn))|~aInteger0(esk1_2(sdtasdt0(xq,xn),xq))|~aInteger0(xq)),inference(spm,[status(thm)],[38,400,theory(equality)])).
% cnf(403,plain,(sdtasdt0(sdtasdt0(xq,xn),X1)=sdtasdt0(xq,sdtasdt0(esk1_2(sdtasdt0(xq,xn),xq),X1))|~aInteger0(X1)|~aInteger0(esk1_2(sdtasdt0(xq,xn),xq))|~aInteger0(xq)),inference(spm,[status(thm)],[57,400,theory(equality)])).
% cnf(414,plain,(aInteger0(sdtasdt0(xq,xn))|$false|~aInteger0(xq)),inference(rw,[status(thm)],[402,395,theory(equality)])).
% cnf(415,plain,(aInteger0(sdtasdt0(xq,xn))|$false|$false),inference(rw,[status(thm)],[414,78,theory(equality)])).
% cnf(416,plain,(aInteger0(sdtasdt0(xq,xn))),inference(cn,[status(thm)],[415,theory(equality)])).
% cnf(417,plain,(sdtasdt0(sdtasdt0(xq,xn),X1)=sdtasdt0(xq,sdtasdt0(esk1_2(sdtasdt0(xq,xn),xq),X1))|~aInteger0(X1)|$false|~aInteger0(xq)),inference(rw,[status(thm)],[403,395,theory(equality)])).
% cnf(418,plain,(sdtasdt0(sdtasdt0(xq,xn),X1)=sdtasdt0(xq,sdtasdt0(esk1_2(sdtasdt0(xq,xn),xq),X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[417,78,theory(equality)])).
% cnf(419,plain,(sdtasdt0(sdtasdt0(xq,xn),X1)=sdtasdt0(xq,sdtasdt0(esk1_2(sdtasdt0(xq,xn),xq),X1))|~aInteger0(X1)),inference(cn,[status(thm)],[418,theory(equality)])).
% cnf(485,plain,(sdtasdt0(xq,sz00)=sdtasdt0(sdtasdt0(xq,xn),sz00)|~aInteger0(sz00)|~aInteger0(esk1_2(sdtasdt0(xq,xn),xq))),inference(spm,[status(thm)],[419,70,theory(equality)])).
% cnf(512,plain,(sdtasdt0(xq,sz00)=sdtasdt0(sdtasdt0(xq,xn),sz00)|$false|~aInteger0(esk1_2(sdtasdt0(xq,xn),xq))),inference(rw,[status(thm)],[485,29,theory(equality)])).
% cnf(513,plain,(sdtasdt0(xq,sz00)=sdtasdt0(sdtasdt0(xq,xn),sz00)|$false|$false),inference(rw,[status(thm)],[512,395,theory(equality)])).
% cnf(514,plain,(sdtasdt0(xq,sz00)=sdtasdt0(sdtasdt0(xq,xn),sz00)),inference(cn,[status(thm)],[513,theory(equality)])).
% cnf(528,plain,(sdtasdt0(xq,sz00)=sz00|~aInteger0(sdtasdt0(xq,xn))),inference(spm,[status(thm)],[70,514,theory(equality)])).
% cnf(557,plain,(sdtasdt0(xq,sz00)=sz00|$false),inference(rw,[status(thm)],[528,416,theory(equality)])).
% cnf(558,plain,(sdtasdt0(xq,sz00)=sz00),inference(cn,[status(thm)],[557,theory(equality)])).
% cnf(567,plain,(sdtpldt0(sz00,sdtasdt0(xq,X1))=sdtasdt0(xq,sdtpldt0(sz00,X1))|~aInteger0(xq)|~aInteger0(sz00)|~aInteger0(X1)),inference(spm,[status(thm)],[65,558,theory(equality)])).
% cnf(586,plain,(sdtpldt0(sz00,sdtasdt0(xq,X1))=sdtasdt0(xq,sdtpldt0(sz00,X1))|$false|~aInteger0(sz00)|~aInteger0(X1)),inference(rw,[status(thm)],[567,78,theory(equality)])).
% cnf(587,plain,(sdtpldt0(sz00,sdtasdt0(xq,X1))=sdtasdt0(xq,sdtpldt0(sz00,X1))|$false|$false|~aInteger0(X1)),inference(rw,[status(thm)],[586,29,theory(equality)])).
% cnf(588,plain,(sdtpldt0(sz00,sdtasdt0(xq,X1))=sdtasdt0(xq,sdtpldt0(sz00,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[587,theory(equality)])).
% cnf(1965,plain,(sdtpldt0(sz00,xq)=sdtasdt0(xq,sdtpldt0(sz00,sz10))|~aInteger0(sz10)|~aInteger0(xq)),inference(spm,[status(thm)],[588,110,theory(equality)])).
% cnf(1984,plain,(sdtpldt0(sz00,xq)=sdtasdt0(xq,sdtpldt0(sz00,sz10))|$false|~aInteger0(xq)),inference(rw,[status(thm)],[1965,105,theory(equality)])).
% cnf(1985,plain,(sdtpldt0(sz00,xq)=sdtasdt0(xq,sdtpldt0(sz00,sz10))|$false|$false),inference(rw,[status(thm)],[1984,78,theory(equality)])).
% cnf(1986,plain,(sdtpldt0(sz00,xq)=sdtasdt0(xq,sdtpldt0(sz00,sz10))),inference(cn,[status(thm)],[1985,theory(equality)])).
% cnf(2014,plain,(sdtasdt0(xq,sz10)=sdtpldt0(sz00,xq)|~aInteger0(sz10)),inference(spm,[status(thm)],[1986,48,theory(equality)])).
% cnf(2033,plain,(sdtasdt0(xq,sz10)=sdtpldt0(sz00,xq)|$false),inference(rw,[status(thm)],[2014,105,theory(equality)])).
% cnf(2034,plain,(sdtasdt0(xq,sz10)=sdtpldt0(sz00,xq)),inference(cn,[status(thm)],[2033,theory(equality)])).
% cnf(2037,plain,(sdtasdt0(xq,sz10)=xq|~aInteger0(xq)),inference(spm,[status(thm)],[48,2034,theory(equality)])).
% cnf(2045,plain,(sdtasdt0(xq,sz10)=xq|$false),inference(rw,[status(thm)],[2037,78,theory(equality)])).
% cnf(2046,plain,(sdtasdt0(xq,sz10)=xq),inference(cn,[status(thm)],[2045,theory(equality)])).
% cnf(2049,plain,(sdtasdt0(xq,X1)=sdtasdt0(xq,sdtasdt0(sz10,X1))|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(xq)),inference(spm,[status(thm)],[57,2046,theory(equality)])).
% cnf(2065,plain,(sdtasdt0(xq,X1)=sdtasdt0(xq,sdtasdt0(sz10,X1))|~aInteger0(X1)|$false|~aInteger0(xq)),inference(rw,[status(thm)],[2049,105,theory(equality)])).
% cnf(2066,plain,(sdtasdt0(xq,X1)=sdtasdt0(xq,sdtasdt0(sz10,X1))|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[2065,78,theory(equality)])).
% cnf(2067,plain,(sdtasdt0(xq,X1)=sdtasdt0(xq,sdtasdt0(sz10,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[2066,theory(equality)])).
% cnf(2135,plain,(sz00=X1|aDivisorOf0(X1,sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(csr,[status(thm)],[215,38])).
% cnf(5968,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aInteger0(X1)|~aInteger0(X3)|~aInteger0(X2)),inference(csr,[status(thm)],[258,38])).
% cnf(5979,plain,(sdtasdt0(X1,sdtasdt0(xq,sz10))=sdtasdt0(xq,X1)|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(xq)),inference(spm,[status(thm)],[2067,5968,theory(equality)])).
% cnf(6168,plain,(sdtasdt0(X1,xq)=sdtasdt0(xq,X1)|~aInteger0(X1)|~aInteger0(sz10)|~aInteger0(xq)),inference(rw,[status(thm)],[5979,2046,theory(equality)])).
% cnf(6169,plain,(sdtasdt0(X1,xq)=sdtasdt0(xq,X1)|~aInteger0(X1)|$false|~aInteger0(xq)),inference(rw,[status(thm)],[6168,105,theory(equality)])).
% cnf(6170,plain,(sdtasdt0(X1,xq)=sdtasdt0(xq,X1)|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[6169,78,theory(equality)])).
% cnf(6171,plain,(sdtasdt0(X1,xq)=sdtasdt0(xq,X1)|~aInteger0(X1)),inference(cn,[status(thm)],[6170,theory(equality)])).
% cnf(6733,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(X1,xq))|~aInteger0(X1)|~aInteger0(xq)),inference(spm,[status(thm)],[2135,6171,theory(equality)])).
% cnf(6813,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(X1,xq))|~aInteger0(X1)|$false),inference(rw,[status(thm)],[6733,78,theory(equality)])).
% cnf(6814,plain,(sz00=xq|aDivisorOf0(xq,sdtasdt0(X1,xq))|~aInteger0(X1)),inference(cn,[status(thm)],[6813,theory(equality)])).
% cnf(6815,plain,(aDivisorOf0(xq,sdtasdt0(X1,xq))|~aInteger0(X1)),inference(sr,[status(thm)],[6814,77,theory(equality)])).
% cnf(7928,plain,(aDivisorOf0(xq,sdtasdt0(xq,X1))|~aInteger0(X1)|~aInteger0(xq)),inference(spm,[status(thm)],[6815,60,theory(equality)])).
% cnf(7951,plain,(aDivisorOf0(xq,sdtasdt0(xq,X1))|~aInteger0(X1)|$false),inference(rw,[status(thm)],[7928,78,theory(equality)])).
% cnf(7952,plain,(aDivisorOf0(xq,sdtasdt0(xq,X1))|~aInteger0(X1)),inference(cn,[status(thm)],[7951,theory(equality)])).
% cnf(9661,plain,(sz00=xq|sdteqdtlpzmzozddtrp0(xb,xa,xq)|~aInteger0(xq)|~aInteger0(smndt0(xn))),inference(spm,[status(thm)],[294,7952,theory(equality)])).
% cnf(9667,plain,(sz00=xq|sdteqdtlpzmzozddtrp0(xb,xa,xq)|$false|~aInteger0(smndt0(xn))),inference(rw,[status(thm)],[9661,78,theory(equality)])).
% cnf(9668,plain,(sz00=xq|sdteqdtlpzmzozddtrp0(xb,xa,xq)|~aInteger0(smndt0(xn))),inference(cn,[status(thm)],[9667,theory(equality)])).
% cnf(9669,plain,(sdteqdtlpzmzozddtrp0(xb,xa,xq)|~aInteger0(smndt0(xn))),inference(sr,[status(thm)],[9668,77,theory(equality)])).
% cnf(9670,plain,(~aInteger0(smndt0(xn))),inference(sr,[status(thm)],[9669,113,theory(equality)])).
% cnf(9677,plain,(~aInteger0(xn)),inference(spm,[status(thm)],[9670,32,theory(equality)])).
% cnf(9678,plain,($false),inference(rw,[status(thm)],[9677,83,theory(equality)])).
% cnf(9679,plain,($false),inference(cn,[status(thm)],[9678,theory(equality)])).
% cnf(9680,plain,($false),9679,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 550
% # ...of these trivial : 26
% # ...subsumed : 249
% # ...remaining for further processing: 275
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 21
% # Generated clauses : 3147
% # ...of the previous two non-trivial : 2477
% # Contextual simplify-reflections : 48
% # Paramodulations : 3129
% # Factorizations : 0
% # Equation resolutions : 18
% # Current number of processed clauses: 212
% # Positive orientable unit clauses: 65
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 143
% # Current number of unprocessed clauses: 1910
% # ...number of literals in the above : 7807
% # Clause-clause subsumption calls (NU) : 1764
% # Rec. Clause-clause subsumption calls : 1335
% # Unit Clause-clause subsumption calls : 31
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 17
% # Backwards rewriting index: 242 leaves, 1.21+/-0.735 terms/leaf
% # Paramod-from index: 163 leaves, 1.09+/-0.364 terms/leaf
% # Paramod-into index: 219 leaves, 1.16+/-0.576 terms/leaf
% # -------------------------------------------------
% # User time : 0.123 s
% # System time : 0.006 s
% # Total time : 0.129 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.33 CPU 0.50 WC
% FINAL PrfWatch: 0.33 CPU 0.50 WC
% SZS output end Solution for /tmp/SystemOnTPTP28597/NUM427+1.tptp
%
%------------------------------------------------------------------------------