%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM433+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 : 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 18:59:02 EST 2010
% Result : Theorem 1.94s
% Output : Solution 1.94s
% 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/SystemOnTPTP32048/NUM433+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32048/NUM433+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32048/NUM433+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 32144
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 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(19, axiom,(((((aInteger0(xa)&aInteger0(xb))&aInteger0(xp))&~(xp=sz00))&aInteger0(xq))&~(xq=sz00)),file('/tmp/SRASS.s.p', m__979)).
% fof(24, conjecture,((((~(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)))=>(((?[X1]:(aInteger0(X1)&sdtasdt0(xp,X1)=sdtpldt0(xa,smndt0(xb)))|aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|sdteqdtlpzmzozddtrp0(xa,xb,xp))&((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb)))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))))|sdteqdtlpzmzozddtrp0(xa,xb,xq)))),file('/tmp/SRASS.s.p', m__)).
% fof(25, negated_conjecture,~(((((~(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)))=>(((?[X1]:(aInteger0(X1)&sdtasdt0(xp,X1)=sdtpldt0(xa,smndt0(xb)))|aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|sdteqdtlpzmzozddtrp0(xa,xb,xp))&((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb)))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))))|sdteqdtlpzmzozddtrp0(xa,xb,xq))))),inference(assume_negation,[status(cth)],[24])).
% fof(28, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(29, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(32, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(35, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(53, 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(54, 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)],[53])).
% cnf(55,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(sdtasdt0(X1,X2),X3)|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[10])).
% fof(57, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(72, 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(73, 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)],[72])).
% fof(74, 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)],[73])).
% fof(75, 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)],[74])).
% fof(76, 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)],[75])).
% cnf(80,plain,(aInteger0(X2)|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[76])).
% cnf(97,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[19])).
% cnf(99,plain,(aInteger0(xp)),inference(split_conjunct,[status(thm)],[19])).
% cnf(100,plain,(aInteger0(xb)),inference(split_conjunct,[status(thm)],[19])).
% cnf(101,plain,(aInteger0(xa)),inference(split_conjunct,[status(thm)],[19])).
% fof(115, negated_conjecture,((((~(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)))&(((![X1]:(~(aInteger0(X1))|~(sdtasdt0(xp,X1)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xp)))|((![X1]:(~(aInteger0(X1))|~(sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xq))))),inference(fof_nnf,[status(thm)],[25])).
% fof(116, negated_conjecture,((((~(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)))&(((![X3]:(~(aInteger0(X3))|~(sdtasdt0(xp,X3)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xp)))|((![X4]:(~(aInteger0(X4))|~(sdtasdt0(xq,X4)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xq))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, negated_conjecture,((((~(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)))&(((![X3]:(~(aInteger0(X3))|~(sdtasdt0(xp,X3)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xp)))|((![X4]:(~(aInteger0(X4))|~(sdtasdt0(xq,X4)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xq))))),inference(skolemize,[status(esa)],[116])).
% fof(118, negated_conjecture,![X3]:![X4]:(((((~(aInteger0(X4))|~(sdtasdt0(xq,X4)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xq)))|(((~(aInteger0(X3))|~(sdtasdt0(xp,X3)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xp))))&(((~(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(shift_quantors,[status(thm)],[117])).
% fof(119, negated_conjecture,![X3]:![X4]:(((((((~(aInteger0(X3))|~(sdtasdt0(xp,X3)=sdtpldt0(xa,smndt0(xb))))|(~(aInteger0(X4))|~(sdtasdt0(xq,X4)=sdtpldt0(xa,smndt0(xb)))))&(~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|(~(aInteger0(X4))|~(sdtasdt0(xq,X4)=sdtpldt0(xa,smndt0(xb))))))&(~(sdteqdtlpzmzozddtrp0(xa,xb,xp))|(~(aInteger0(X4))|~(sdtasdt0(xq,X4)=sdtpldt0(xa,smndt0(xb))))))&((((~(aInteger0(X3))|~(sdtasdt0(xp,X3)=sdtpldt0(xa,smndt0(xb))))|~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))&(~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))))))&(~(sdteqdtlpzmzozddtrp0(xa,xb,xp))|~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))))&((((~(aInteger0(X3))|~(sdtasdt0(xp,X3)=sdtpldt0(xa,smndt0(xb))))|~(sdteqdtlpzmzozddtrp0(xa,xb,xq)))&(~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|~(sdteqdtlpzmzozddtrp0(xa,xb,xq))))&(~(sdteqdtlpzmzozddtrp0(xa,xb,xp))|~(sdteqdtlpzmzozddtrp0(xa,xb,xq)))))&(((~(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(distribute,[status(thm)],[118])).
% cnf(121,negated_conjecture,(aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))),inference(split_conjunct,[status(thm)],[119])).
% cnf(122,negated_conjecture,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)=sdtpldt0(xa,smndt0(xb))),inference(split_conjunct,[status(thm)],[119])).
% cnf(123,negated_conjecture,(aInteger0(esk2_0)),inference(split_conjunct,[status(thm)],[119])).
% cnf(133,negated_conjecture,(sdtasdt0(xq,X1)!=sdtpldt0(xa,smndt0(xb))|~aInteger0(X1)|sdtasdt0(xp,X2)!=sdtpldt0(xa,smndt0(xb))|~aInteger0(X2)),inference(split_conjunct,[status(thm)],[119])).
% cnf(134,negated_conjecture,(aDivisorOf0(sdtasdt0(xp,xq),sdtasdt0(sdtasdt0(xp,xq),esk2_0))),inference(rw,[status(thm)],[121,122,theory(equality)])).
% cnf(145,negated_conjecture,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(xp,X2)|sdtpldt0(xa,smndt0(xb))!=sdtasdt0(xq,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(rw,[status(thm)],[133,122,theory(equality)])).
% cnf(146,negated_conjecture,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(xp,X2)|sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(xq,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(rw,[status(thm)],[145,122,theory(equality)])).
% fof(147, plain,(~(epred1_0)<=>![X2]:(~(sdtasdt0(sdtasdt0(xp,xq),esk2_0)=sdtasdt0(xp,X2))|~(aInteger0(X2)))),introduced(definition),['split']).
% cnf(148,plain,(epred1_0|~aInteger0(X2)|sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(xp,X2)),inference(split_equiv,[status(thm)],[147])).
% fof(149, plain,(~(epred2_0)<=>![X1]:(~(sdtasdt0(sdtasdt0(xp,xq),esk2_0)=sdtasdt0(xq,X1))|~(aInteger0(X1)))),introduced(definition),['split']).
% cnf(150,plain,(epred2_0|~aInteger0(X1)|sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(xq,X1)),inference(split_equiv,[status(thm)],[149])).
% cnf(151,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[146,147,theory(equality)]),149,theory(equality)]),['split']).
% cnf(158,negated_conjecture,(aInteger0(sdtasdt0(sdtasdt0(xp,xq),esk2_0))|~aInteger0(smndt0(xb))|~aInteger0(xa)),inference(spm,[status(thm)],[33,122,theory(equality)])).
% cnf(163,negated_conjecture,(aInteger0(sdtasdt0(sdtasdt0(xp,xq),esk2_0))|~aInteger0(smndt0(xb))|$false),inference(rw,[status(thm)],[158,101,theory(equality)])).
% cnf(164,negated_conjecture,(aInteger0(sdtasdt0(sdtasdt0(xp,xq),esk2_0))|~aInteger0(smndt0(xb))),inference(cn,[status(thm)],[163,theory(equality)])).
% cnf(171,negated_conjecture,(aInteger0(sdtasdt0(xp,xq))|~aInteger0(sdtasdt0(sdtasdt0(xp,xq),esk2_0))),inference(spm,[status(thm)],[80,134,theory(equality)])).
% cnf(219,negated_conjecture,(epred2_0|sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(X1,xq)|~aInteger0(X1)|~aInteger0(xq)),inference(spm,[status(thm)],[150,58,theory(equality)])).
% cnf(244,negated_conjecture,(epred2_0|sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(X1,xq)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[219,97,theory(equality)])).
% cnf(245,negated_conjecture,(epred2_0|sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(X1,xq)|~aInteger0(X1)),inference(cn,[status(thm)],[244,theory(equality)])).
% cnf(343,negated_conjecture,(epred1_0|sdtasdt0(xp,sdtasdt0(xq,esk2_0))!=sdtasdt0(xp,X1)|~aInteger0(X1)|~aInteger0(esk2_0)|~aInteger0(xq)|~aInteger0(xp)),inference(spm,[status(thm)],[148,55,theory(equality)])).
% cnf(365,negated_conjecture,(epred1_0|sdtasdt0(xp,sdtasdt0(xq,esk2_0))!=sdtasdt0(xp,X1)|~aInteger0(X1)|$false|~aInteger0(xq)|~aInteger0(xp)),inference(rw,[status(thm)],[343,123,theory(equality)])).
% cnf(366,negated_conjecture,(epred1_0|sdtasdt0(xp,sdtasdt0(xq,esk2_0))!=sdtasdt0(xp,X1)|~aInteger0(X1)|$false|$false|~aInteger0(xp)),inference(rw,[status(thm)],[365,97,theory(equality)])).
% cnf(367,negated_conjecture,(epred1_0|sdtasdt0(xp,sdtasdt0(xq,esk2_0))!=sdtasdt0(xp,X1)|~aInteger0(X1)|$false|$false|$false),inference(rw,[status(thm)],[366,99,theory(equality)])).
% cnf(368,negated_conjecture,(epred1_0|sdtasdt0(xp,sdtasdt0(xq,esk2_0))!=sdtasdt0(xp,X1)|~aInteger0(X1)),inference(cn,[status(thm)],[367,theory(equality)])).
% cnf(588,negated_conjecture,(aInteger0(sdtasdt0(sdtasdt0(xp,xq),esk2_0))|~aInteger0(xb)),inference(spm,[status(thm)],[164,30,theory(equality)])).
% cnf(589,negated_conjecture,(aInteger0(sdtasdt0(sdtasdt0(xp,xq),esk2_0))|$false),inference(rw,[status(thm)],[588,100,theory(equality)])).
% cnf(590,negated_conjecture,(aInteger0(sdtasdt0(sdtasdt0(xp,xq),esk2_0))),inference(cn,[status(thm)],[589,theory(equality)])).
% cnf(618,negated_conjecture,(aInteger0(sdtasdt0(xp,xq))|$false),inference(rw,[status(thm)],[171,590,theory(equality)])).
% cnf(619,negated_conjecture,(aInteger0(sdtasdt0(xp,xq))),inference(cn,[status(thm)],[618,theory(equality)])).
% cnf(626,negated_conjecture,(epred2_0|sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(xq,X1)|~aInteger0(X1)|~aInteger0(xq)),inference(spm,[status(thm)],[245,58,theory(equality)])).
% cnf(635,negated_conjecture,(epred2_0|sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(xq,X1)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[626,97,theory(equality)])).
% cnf(636,negated_conjecture,(epred2_0|sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(xq,X1)|~aInteger0(X1)),inference(cn,[status(thm)],[635,theory(equality)])).
% cnf(683,negated_conjecture,(epred1_0|~aInteger0(sdtasdt0(xq,esk2_0))),inference(er,[status(thm)],[368,theory(equality)])).
% cnf(693,negated_conjecture,(epred1_0|~aInteger0(esk2_0)|~aInteger0(xq)),inference(spm,[status(thm)],[683,36,theory(equality)])).
% cnf(694,negated_conjecture,(epred1_0|$false|~aInteger0(xq)),inference(rw,[status(thm)],[693,123,theory(equality)])).
% cnf(695,negated_conjecture,(epred1_0|$false|$false),inference(rw,[status(thm)],[694,97,theory(equality)])).
% cnf(696,negated_conjecture,(epred1_0),inference(cn,[status(thm)],[695,theory(equality)])).
% cnf(703,negated_conjecture,(~epred2_0|$false),inference(rw,[status(thm)],[151,696,theory(equality)])).
% cnf(704,negated_conjecture,(~epred2_0),inference(cn,[status(thm)],[703,theory(equality)])).
% cnf(769,negated_conjecture,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(xq,X1)|~aInteger0(X1)),inference(sr,[status(thm)],[636,704,theory(equality)])).
% cnf(771,negated_conjecture,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(X1,xq)|~aInteger0(X1)|~aInteger0(xq)),inference(spm,[status(thm)],[769,58,theory(equality)])).
% cnf(778,negated_conjecture,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(X1,xq)|~aInteger0(X1)|$false),inference(rw,[status(thm)],[771,97,theory(equality)])).
% cnf(779,negated_conjecture,(sdtasdt0(sdtasdt0(xp,xq),esk2_0)!=sdtasdt0(X1,xq)|~aInteger0(X1)),inference(cn,[status(thm)],[778,theory(equality)])).
% cnf(863,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xp,xq))!=sdtasdt0(X1,xq)|~aInteger0(X1)|~aInteger0(sdtasdt0(xp,xq))|~aInteger0(esk2_0)),inference(spm,[status(thm)],[779,58,theory(equality)])).
% cnf(874,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xp,xq))!=sdtasdt0(X1,xq)|~aInteger0(X1)|$false|~aInteger0(esk2_0)),inference(rw,[status(thm)],[863,619,theory(equality)])).
% cnf(875,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xp,xq))!=sdtasdt0(X1,xq)|~aInteger0(X1)|$false|$false),inference(rw,[status(thm)],[874,123,theory(equality)])).
% cnf(876,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xp,xq))!=sdtasdt0(X1,xq)|~aInteger0(X1)),inference(cn,[status(thm)],[875,theory(equality)])).
% cnf(926,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xp,xq))!=sdtasdt0(X1,sdtasdt0(X2,xq))|~aInteger0(sdtasdt0(X1,X2))|~aInteger0(xq)|~aInteger0(X2)|~aInteger0(X1)),inference(spm,[status(thm)],[876,55,theory(equality)])).
% cnf(930,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xp,xq))!=sdtasdt0(X1,sdtasdt0(X2,xq))|~aInteger0(sdtasdt0(X1,X2))|$false|~aInteger0(X2)|~aInteger0(X1)),inference(rw,[status(thm)],[926,97,theory(equality)])).
% cnf(931,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xp,xq))!=sdtasdt0(X1,sdtasdt0(X2,xq))|~aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(cn,[status(thm)],[930,theory(equality)])).
% cnf(42192,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xp,xq))!=sdtasdt0(X1,sdtasdt0(X2,xq))|~aInteger0(X2)|~aInteger0(X1)),inference(csr,[status(thm)],[931,36])).
% cnf(42193,negated_conjecture,(~aInteger0(xp)|~aInteger0(esk2_0)),inference(er,[status(thm)],[42192,theory(equality)])).
% cnf(42226,negated_conjecture,($false|~aInteger0(esk2_0)),inference(rw,[status(thm)],[42193,99,theory(equality)])).
% cnf(42227,negated_conjecture,($false|$false),inference(rw,[status(thm)],[42226,123,theory(equality)])).
% cnf(42228,negated_conjecture,($false),inference(cn,[status(thm)],[42227,theory(equality)])).
% cnf(42229,negated_conjecture,($false),42228,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1215
% # ...of these trivial : 70
% # ...subsumed : 550
% # ...remaining for further processing: 595
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 58
% # Generated clauses : 14038
% # ...of the previous two non-trivial : 11493
% # Contextual simplify-reflections : 89
% # Paramodulations : 14011
% # Factorizations : 0
% # Equation resolutions : 24
% # Current number of processed clauses: 473
% # Positive orientable unit clauses: 157
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 23
% # Non-unit-clauses : 293
% # Current number of unprocessed clauses: 9838
% # ...number of literals in the above : 38266
% # Clause-clause subsumption calls (NU) : 5674
% # Rec. Clause-clause subsumption calls : 3888
% # Unit Clause-clause subsumption calls : 247
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 66
% # Indexed BW rewrite successes : 34
% # Backwards rewriting index: 490 leaves, 1.27+/-0.874 terms/leaf
% # Paramod-from index: 309 leaves, 1.18+/-0.493 terms/leaf
% # Paramod-into index: 437 leaves, 1.23+/-0.715 terms/leaf
% # -------------------------------------------------
% # User time : 0.514 s
% # System time : 0.026 s
% # Total time : 0.540 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.13 CPU 1.21 WC
% FINAL PrfWatch: 1.13 CPU 1.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP32048/NUM433+3.tptp
%
%------------------------------------------------------------------------------