TSTP Solution File: NUM435+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM435+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:59:44 EST 2010
% Result : Theorem 1.22s
% Output : Solution 1.22s
% 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/SystemOnTPTP4326/NUM435+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4326/NUM435+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4326/NUM435+3.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 4422
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(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(14, 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(15, 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(17, axiom,![X1]:![X2]:![X3]:((((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))&~(X3=sz00))=>(sdteqdtlpzmzozddtrp0(X1,X2,X3)=>sdteqdtlpzmzozddtrp0(X2,X1,X3))),file('/tmp/SRASS.s.p', mEquModSym)).
% fof(19, axiom,(((((aInteger0(xa)&aInteger0(xb))&aInteger0(xp))&~(xp=sz00))&aInteger0(xq))&~(xq=sz00)),file('/tmp/SRASS.s.p', m__979)).
% fof(20, axiom,(((~(sdtasdt0(xp,xq)=sz00)&?[X1]:(aInteger0(X1)&sdtasdt0(sdtasdt0(xp,xq),X1)=sdtpldt0(xa,smndt0(xb))))&aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))))&sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))),file('/tmp/SRASS.s.p', m__1003)).
% fof(21, axiom,(aInteger0(xm)&sdtasdt0(sdtasdt0(xp,xq),xm)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__1032)).
% fof(26, conjecture,sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm)),file('/tmp/SRASS.s.p', m__)).
% fof(27, negated_conjecture,~(sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(assume_negation,[status(cth)],[26])).
% fof(29, negated_conjecture,~(sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(fof_simplification,[status(thm)],[27,theory(equality)])).
% fof(31, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(32, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(35, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(38, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(56, 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(57, 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)],[56])).
% cnf(58,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(60, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(75, 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)],[14])).
% fof(76, 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)],[75])).
% fof(77, 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)],[76])).
% fof(78, 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)],[77])).
% fof(79, 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)],[78])).
% cnf(83,plain,(aInteger0(X2)|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[79])).
% 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)],[15])).
% 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(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(93, plain,![X1]:![X2]:![X3]:((((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|X3=sz00)|(~(sdteqdtlpzmzozddtrp0(X1,X2,X3))|sdteqdtlpzmzozddtrp0(X2,X1,X3))),inference(fof_nnf,[status(thm)],[17])).
% fof(94, plain,![X4]:![X5]:![X6]:((((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00)|(~(sdteqdtlpzmzozddtrp0(X4,X5,X6))|sdteqdtlpzmzozddtrp0(X5,X4,X6))),inference(variable_rename,[status(thm)],[93])).
% cnf(95,plain,(sdteqdtlpzmzozddtrp0(X1,X2,X3)|X3=sz00|~sdteqdtlpzmzozddtrp0(X2,X1,X3)|~aInteger0(X3)|~aInteger0(X1)|~aInteger0(X2)),inference(split_conjunct,[status(thm)],[94])).
% cnf(100,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[19])).
% cnf(102,plain,(aInteger0(xp)),inference(split_conjunct,[status(thm)],[19])).
% cnf(103,plain,(aInteger0(xb)),inference(split_conjunct,[status(thm)],[19])).
% cnf(104,plain,(aInteger0(xa)),inference(split_conjunct,[status(thm)],[19])).
% fof(105, plain,(((~(sdtasdt0(xp,xq)=sz00)&?[X2]:(aInteger0(X2)&sdtasdt0(sdtasdt0(xp,xq),X2)=sdtpldt0(xa,smndt0(xb))))&aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))))&sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))),inference(variable_rename,[status(thm)],[20])).
% fof(106, plain,(((~(sdtasdt0(xp,xq)=sz00)&(aInteger0(esk2_0)&sdtasdt0(sdtasdt0(xp,xq),esk2_0)=sdtpldt0(xa,smndt0(xb))))&aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))))&sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))),inference(skolemize,[status(esa)],[105])).
% cnf(107,plain,(sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))),inference(split_conjunct,[status(thm)],[106])).
% cnf(109,plain,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)=sdtpldt0(xa,smndt0(xb))),inference(split_conjunct,[status(thm)],[106])).
% cnf(110,plain,(aInteger0(esk2_0)),inference(split_conjunct,[status(thm)],[106])).
% cnf(111,plain,(sdtasdt0(xp,xq)!=sz00),inference(split_conjunct,[status(thm)],[106])).
% cnf(112,plain,(sdtasdt0(sdtasdt0(xp,xq),xm)=sdtpldt0(xa,smndt0(xb))),inference(split_conjunct,[status(thm)],[21])).
% cnf(113,plain,(aInteger0(xm)),inference(split_conjunct,[status(thm)],[21])).
% cnf(127,negated_conjecture,(sdtpldt0(xa,smndt0(xb))!=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(split_conjunct,[status(thm)],[29])).
% cnf(128,plain,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)=sdtasdt0(sdtasdt0(xp,xq),xm)),inference(rw,[status(thm)],[109,112,theory(equality)])).
% cnf(130,negated_conjecture,(sdtasdt0(xq,sdtasdt0(xp,xm))!=sdtasdt0(sdtasdt0(xp,xq),xm)),inference(rw,[status(thm)],[127,112,theory(equality)])).
% cnf(281,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)],[61,58,theory(equality)])).
% cnf(286,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(sdtasdt0(xp,xq),xm)|~aInteger0(esk2_0)|~aInteger0(xq)|~aInteger0(xp)),inference(spm,[status(thm)],[128,58,theory(equality)])).
% cnf(288,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xq,sdtasdt0(xp,xm))|~aInteger0(xm)|~aInteger0(xq)|~aInteger0(xp)),inference(spm,[status(thm)],[130,58,theory(equality)])).
% cnf(302,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(sdtasdt0(xp,xq),xm)|$false|~aInteger0(xq)|~aInteger0(xp)),inference(rw,[status(thm)],[286,110,theory(equality)])).
% cnf(303,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(sdtasdt0(xp,xq),xm)|$false|$false|~aInteger0(xp)),inference(rw,[status(thm)],[302,100,theory(equality)])).
% cnf(304,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(sdtasdt0(xp,xq),xm)|$false|$false|$false),inference(rw,[status(thm)],[303,102,theory(equality)])).
% cnf(305,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(sdtasdt0(xp,xq),xm)),inference(cn,[status(thm)],[304,theory(equality)])).
% cnf(310,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xq,sdtasdt0(xp,xm))|$false|~aInteger0(xq)|~aInteger0(xp)),inference(rw,[status(thm)],[288,113,theory(equality)])).
% cnf(311,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xq,sdtasdt0(xp,xm))|$false|$false|~aInteger0(xp)),inference(rw,[status(thm)],[310,100,theory(equality)])).
% cnf(312,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xq,sdtasdt0(xp,xm))|$false|$false|$false),inference(rw,[status(thm)],[311,102,theory(equality)])).
% cnf(313,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(cn,[status(thm)],[312,theory(equality)])).
% cnf(434,plain,(sz00=sdtasdt0(xp,xq)|sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))|~aInteger0(sdtasdt0(xp,xq))|~aInteger0(xa)|~aInteger0(xb)),inference(spm,[status(thm)],[95,107,theory(equality)])).
% cnf(436,plain,(sz00=sdtasdt0(xp,xq)|sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))|~aInteger0(sdtasdt0(xp,xq))|$false|~aInteger0(xb)),inference(rw,[status(thm)],[434,104,theory(equality)])).
% cnf(437,plain,(sz00=sdtasdt0(xp,xq)|sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))|~aInteger0(sdtasdt0(xp,xq))|$false|$false),inference(rw,[status(thm)],[436,103,theory(equality)])).
% cnf(438,plain,(sz00=sdtasdt0(xp,xq)|sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))|~aInteger0(sdtasdt0(xp,xq))),inference(cn,[status(thm)],[437,theory(equality)])).
% cnf(439,plain,(sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))|~aInteger0(sdtasdt0(xp,xq))),inference(sr,[status(thm)],[438,111,theory(equality)])).
% cnf(474,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(xp,sdtasdt0(xq,xm))|~aInteger0(xm)|~aInteger0(xq)|~aInteger0(xp)),inference(spm,[status(thm)],[58,305,theory(equality)])).
% cnf(501,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(xp,sdtasdt0(xq,xm))|$false|~aInteger0(xq)|~aInteger0(xp)),inference(rw,[status(thm)],[474,113,theory(equality)])).
% cnf(502,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(xp,sdtasdt0(xq,xm))|$false|$false|~aInteger0(xp)),inference(rw,[status(thm)],[501,100,theory(equality)])).
% cnf(503,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(xp,sdtasdt0(xq,xm))|$false|$false|$false),inference(rw,[status(thm)],[502,102,theory(equality)])).
% cnf(504,plain,(sdtasdt0(xp,sdtasdt0(xq,esk2_0))=sdtasdt0(xp,sdtasdt0(xq,xm))),inference(cn,[status(thm)],[503,theory(equality)])).
% cnf(523,plain,(sdtasdt0(sdtasdt0(xp,xq),xm)=sdtasdt0(xp,sdtasdt0(xq,xm))),inference(rw,[status(thm)],[305,504,theory(equality)])).
% cnf(548,plain,(sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))|~aInteger0(xq)|~aInteger0(xp)),inference(spm,[status(thm)],[439,39,theory(equality)])).
% cnf(549,plain,(sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))|$false|~aInteger0(xp)),inference(rw,[status(thm)],[548,100,theory(equality)])).
% cnf(550,plain,(sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))|$false|$false),inference(rw,[status(thm)],[549,102,theory(equality)])).
% cnf(551,plain,(sdteqdtlpzmzozddtrp0(xb,xa,sdtasdt0(xp,xq))),inference(cn,[status(thm)],[550,theory(equality)])).
% cnf(553,plain,(sz00=sdtasdt0(xp,xq)|aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))|~aInteger0(xb)|~aInteger0(xa)|~aInteger0(sdtasdt0(xp,xq))),inference(spm,[status(thm)],[89,551,theory(equality)])).
% cnf(560,plain,(sz00=sdtasdt0(xp,xq)|aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))|$false|~aInteger0(xa)|~aInteger0(sdtasdt0(xp,xq))),inference(rw,[status(thm)],[553,103,theory(equality)])).
% cnf(561,plain,(sz00=sdtasdt0(xp,xq)|aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))|$false|$false|~aInteger0(sdtasdt0(xp,xq))),inference(rw,[status(thm)],[560,104,theory(equality)])).
% cnf(562,plain,(sz00=sdtasdt0(xp,xq)|aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))|~aInteger0(sdtasdt0(xp,xq))),inference(cn,[status(thm)],[561,theory(equality)])).
% cnf(563,plain,(aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))|~aInteger0(sdtasdt0(xp,xq))),inference(sr,[status(thm)],[562,111,theory(equality)])).
% cnf(568,plain,(aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))|~aInteger0(xq)|~aInteger0(xp)),inference(spm,[status(thm)],[563,39,theory(equality)])).
% cnf(569,plain,(aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))|$false|~aInteger0(xp)),inference(rw,[status(thm)],[568,100,theory(equality)])).
% cnf(570,plain,(aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))|$false|$false),inference(rw,[status(thm)],[569,102,theory(equality)])).
% cnf(571,plain,(aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xb,smndt0(xa)))),inference(cn,[status(thm)],[570,theory(equality)])).
% cnf(573,plain,(aInteger0(sdtasdt0(xp,xq))|~aInteger0(sdtpldt0(xb,smndt0(xa)))),inference(spm,[status(thm)],[83,571,theory(equality)])).
% cnf(591,plain,(sdtasdt0(xm,sdtasdt0(xp,xq))=sdtasdt0(xp,sdtasdt0(xq,xm))|~aInteger0(sdtasdt0(xp,xq))|~aInteger0(xm)),inference(spm,[status(thm)],[61,523,theory(equality)])).
% cnf(601,plain,(sdtasdt0(xm,sdtasdt0(xp,xq))=sdtasdt0(xp,sdtasdt0(xq,xm))|~aInteger0(sdtasdt0(xp,xq))|$false),inference(rw,[status(thm)],[591,113,theory(equality)])).
% cnf(602,plain,(sdtasdt0(xm,sdtasdt0(xp,xq))=sdtasdt0(xp,sdtasdt0(xq,xm))|~aInteger0(sdtasdt0(xp,xq))),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(665,plain,(aInteger0(sdtasdt0(xp,xq))|~aInteger0(smndt0(xa))|~aInteger0(xb)),inference(spm,[status(thm)],[573,36,theory(equality)])).
% cnf(666,plain,(aInteger0(sdtasdt0(xp,xq))|~aInteger0(smndt0(xa))|$false),inference(rw,[status(thm)],[665,103,theory(equality)])).
% cnf(667,plain,(aInteger0(sdtasdt0(xp,xq))|~aInteger0(smndt0(xa))),inference(cn,[status(thm)],[666,theory(equality)])).
% cnf(668,plain,(aInteger0(sdtasdt0(xp,xq))|~aInteger0(xa)),inference(spm,[status(thm)],[667,33,theory(equality)])).
% cnf(669,plain,(aInteger0(sdtasdt0(xp,xq))|$false),inference(rw,[status(thm)],[668,104,theory(equality)])).
% cnf(670,plain,(aInteger0(sdtasdt0(xp,xq))),inference(cn,[status(thm)],[669,theory(equality)])).
% cnf(758,plain,(sdtasdt0(xm,sdtasdt0(xp,xq))=sdtasdt0(xp,sdtasdt0(xq,xm))|$false),inference(rw,[status(thm)],[602,670,theory(equality)])).
% cnf(759,plain,(sdtasdt0(xm,sdtasdt0(xp,xq))=sdtasdt0(xp,sdtasdt0(xq,xm))),inference(cn,[status(thm)],[758,theory(equality)])).
% cnf(4826,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aInteger0(X1)|~aInteger0(X3)|~aInteger0(X2)),inference(csr,[status(thm)],[281,39])).
% cnf(4831,plain,(sdtasdt0(xq,sdtasdt0(xm,xp))=sdtasdt0(xp,sdtasdt0(xq,xm))|~aInteger0(xq)|~aInteger0(xp)|~aInteger0(xm)),inference(spm,[status(thm)],[759,4826,theory(equality)])).
% cnf(5061,plain,(sdtasdt0(xq,sdtasdt0(xm,xp))=sdtasdt0(xp,sdtasdt0(xq,xm))|$false|~aInteger0(xp)|~aInteger0(xm)),inference(rw,[status(thm)],[4831,100,theory(equality)])).
% cnf(5062,plain,(sdtasdt0(xq,sdtasdt0(xm,xp))=sdtasdt0(xp,sdtasdt0(xq,xm))|$false|$false|~aInteger0(xm)),inference(rw,[status(thm)],[5061,102,theory(equality)])).
% cnf(5063,plain,(sdtasdt0(xq,sdtasdt0(xm,xp))=sdtasdt0(xp,sdtasdt0(xq,xm))|$false|$false|$false),inference(rw,[status(thm)],[5062,113,theory(equality)])).
% cnf(5064,plain,(sdtasdt0(xq,sdtasdt0(xm,xp))=sdtasdt0(xp,sdtasdt0(xq,xm))),inference(cn,[status(thm)],[5063,theory(equality)])).
% cnf(5537,plain,(sdtasdt0(xq,sdtasdt0(xp,xm))=sdtasdt0(xp,sdtasdt0(xq,xm))|~aInteger0(xm)|~aInteger0(xp)),inference(spm,[status(thm)],[5064,61,theory(equality)])).
% cnf(5563,plain,(sdtasdt0(xq,sdtasdt0(xp,xm))=sdtasdt0(xp,sdtasdt0(xq,xm))|$false|~aInteger0(xp)),inference(rw,[status(thm)],[5537,113,theory(equality)])).
% cnf(5564,plain,(sdtasdt0(xq,sdtasdt0(xp,xm))=sdtasdt0(xp,sdtasdt0(xq,xm))|$false|$false),inference(rw,[status(thm)],[5563,102,theory(equality)])).
% cnf(5565,plain,(sdtasdt0(xq,sdtasdt0(xp,xm))=sdtasdt0(xp,sdtasdt0(xq,xm))),inference(cn,[status(thm)],[5564,theory(equality)])).
% cnf(5566,plain,($false),inference(sr,[status(thm)],[5565,313,theory(equality)])).
% cnf(5567,plain,($false),5566,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 361
% # ...of these trivial : 18
% # ...subsumed : 93
% # ...remaining for further processing: 250
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 36
% # Generated clauses : 1871
% # ...of the previous two non-trivial : 1494
% # Contextual simplify-reflections : 22
% # Paramodulations : 1859
% # Factorizations : 0
% # Equation resolutions : 12
% # Current number of processed clauses: 159
% # Positive orientable unit clauses: 64
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 91
% # Current number of unprocessed clauses: 1098
% # ...number of literals in the above : 4208
% # Clause-clause subsumption calls (NU) : 1041
% # Rec. Clause-clause subsumption calls : 782
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 58
% # Indexed BW rewrite successes : 28
% # Backwards rewriting index: 198 leaves, 1.25+/-0.936 terms/leaf
% # Paramod-from index: 118 leaves, 1.14+/-0.735 terms/leaf
% # Paramod-into index: 186 leaves, 1.21+/-0.870 terms/leaf
% # -------------------------------------------------
% # User time : 0.085 s
% # System time : 0.007 s
% # Total time : 0.092 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.36 WC
% FINAL PrfWatch: 0.25 CPU 0.36 WC
% SZS output end Solution for /tmp/SystemOnTPTP4326/NUM435+3.tptp
%
%------------------------------------------------------------------------------