%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM498+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 : art06.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 19:37:18 EST 2010
% Result : Theorem 1.31s
% Output : Solution 1.31s
% 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/SystemOnTPTP30949/NUM498+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30949/NUM498+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30949/NUM498+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 31045
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aNaturalNumber0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(10, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', m_MulUnit)).
% fof(11, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', m_MulZero)).
% fof(16, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtasdt0(X1,X2)=sz00=>(X1=sz00|X2=sz00))),file('/tmp/SRASS.s.p', mZeroMul)).
% fof(36, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(38, axiom,(((((~(xp=sz00)&~(xp=sz10))&![X1]:((aNaturalNumber0(X1)&(?[X2]:(aNaturalNumber0(X2)&xp=sdtasdt0(X1,X2))|doDivides0(X1,xp)))=>(X1=sz10|X1=xp)))&isPrime0(xp))&?[X1]:(aNaturalNumber0(X1)&sdtasdt0(xn,xm)=sdtasdt0(xp,X1)))&doDivides0(xp,sdtasdt0(xn,xm))),file('/tmp/SRASS.s.p', m__1860)).
% fof(41, axiom,(((((~(xn=xp)&?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xn,X1)=xp))&sdtlseqdt0(xn,xp))&~(xm=xp))&?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,X1)=xp))&sdtlseqdt0(xm,xp)),file('/tmp/SRASS.s.p', m__2287)).
% fof(42, axiom,((aNaturalNumber0(xk)&sdtasdt0(xn,xm)=sdtasdt0(xp,xk))&xk=sdtsldt0(sdtasdt0(xn,xm),xp)),file('/tmp/SRASS.s.p', m__2306)).
% fof(46, conjecture,((xk=sz00|xk=sz10)=>(((?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xp,X1))|doDivides0(xp,xn))|?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xp,X1)))|doDivides0(xp,xm))),file('/tmp/SRASS.s.p', m__)).
% fof(47, negated_conjecture,~(((xk=sz00|xk=sz10)=>(((?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xp,X1))|doDivides0(xp,xn))|?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xp,X1)))|doDivides0(xp,xm)))),inference(assume_negation,[status(cth)],[46])).
% cnf(50,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(76, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(77, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aNaturalNumber0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[77])).
% cnf(79,plain,(X1=sdtasdt0(sz10,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[78])).
% cnf(80,plain,(sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(81, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(82, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aNaturalNumber0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[82])).
% cnf(85,plain,(sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(107, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(~(sdtasdt0(X1,X2)=sz00)|(X1=sz00|X2=sz00))),inference(fof_nnf,[status(thm)],[16])).
% fof(108, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|(~(sdtasdt0(X3,X4)=sz00)|(X3=sz00|X4=sz00))),inference(variable_rename,[status(thm)],[107])).
% cnf(109,plain,(X1=sz00|X2=sz00|sdtasdt0(X2,X1)!=sz00|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(split_conjunct,[status(thm)],[108])).
% cnf(208,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[36])).
% cnf(209,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[36])).
% cnf(210,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[36])).
% fof(342, plain,(((((~(xp=sz00)&~(xp=sz10))&![X1]:((~(aNaturalNumber0(X1))|(![X2]:(~(aNaturalNumber0(X2))|~(xp=sdtasdt0(X1,X2)))&~(doDivides0(X1,xp))))|(X1=sz10|X1=xp)))&isPrime0(xp))&?[X1]:(aNaturalNumber0(X1)&sdtasdt0(xn,xm)=sdtasdt0(xp,X1)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(fof_nnf,[status(thm)],[38])).
% fof(343, plain,(((((~(xp=sz00)&~(xp=sz10))&![X3]:((~(aNaturalNumber0(X3))|(![X4]:(~(aNaturalNumber0(X4))|~(xp=sdtasdt0(X3,X4)))&~(doDivides0(X3,xp))))|(X3=sz10|X3=xp)))&isPrime0(xp))&?[X5]:(aNaturalNumber0(X5)&sdtasdt0(xn,xm)=sdtasdt0(xp,X5)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(variable_rename,[status(thm)],[342])).
% fof(344, plain,(((((~(xp=sz00)&~(xp=sz10))&![X3]:((~(aNaturalNumber0(X3))|(![X4]:(~(aNaturalNumber0(X4))|~(xp=sdtasdt0(X3,X4)))&~(doDivides0(X3,xp))))|(X3=sz10|X3=xp)))&isPrime0(xp))&(aNaturalNumber0(esk9_0)&sdtasdt0(xn,xm)=sdtasdt0(xp,esk9_0)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(skolemize,[status(esa)],[343])).
% fof(345, plain,![X3]:![X4]:((((((((~(aNaturalNumber0(X4))|~(xp=sdtasdt0(X3,X4)))&~(doDivides0(X3,xp)))|~(aNaturalNumber0(X3)))|(X3=sz10|X3=xp))&(~(xp=sz00)&~(xp=sz10)))&isPrime0(xp))&(aNaturalNumber0(esk9_0)&sdtasdt0(xn,xm)=sdtasdt0(xp,esk9_0)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(shift_quantors,[status(thm)],[344])).
% fof(346, plain,![X3]:![X4]:((((((((~(aNaturalNumber0(X4))|~(xp=sdtasdt0(X3,X4)))|~(aNaturalNumber0(X3)))|(X3=sz10|X3=xp))&((~(doDivides0(X3,xp))|~(aNaturalNumber0(X3)))|(X3=sz10|X3=xp)))&(~(xp=sz00)&~(xp=sz10)))&isPrime0(xp))&(aNaturalNumber0(esk9_0)&sdtasdt0(xn,xm)=sdtasdt0(xp,esk9_0)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(distribute,[status(thm)],[345])).
% cnf(348,plain,(sdtasdt0(xn,xm)=sdtasdt0(xp,esk9_0)),inference(split_conjunct,[status(thm)],[346])).
% cnf(349,plain,(aNaturalNumber0(esk9_0)),inference(split_conjunct,[status(thm)],[346])).
% cnf(354,plain,(X1=xp|X1=sz10|~aNaturalNumber0(X1)|xp!=sdtasdt0(X1,X2)|~aNaturalNumber0(X2)),inference(split_conjunct,[status(thm)],[346])).
% fof(365, plain,(((((~(xn=xp)&?[X2]:(aNaturalNumber0(X2)&sdtpldt0(xn,X2)=xp))&sdtlseqdt0(xn,xp))&~(xm=xp))&?[X3]:(aNaturalNumber0(X3)&sdtpldt0(xm,X3)=xp))&sdtlseqdt0(xm,xp)),inference(variable_rename,[status(thm)],[41])).
% fof(366, plain,(((((~(xn=xp)&(aNaturalNumber0(esk10_0)&sdtpldt0(xn,esk10_0)=xp))&sdtlseqdt0(xn,xp))&~(xm=xp))&(aNaturalNumber0(esk11_0)&sdtpldt0(xm,esk11_0)=xp))&sdtlseqdt0(xm,xp)),inference(skolemize,[status(esa)],[365])).
% cnf(374,plain,(xn!=xp),inference(split_conjunct,[status(thm)],[366])).
% cnf(376,plain,(sdtasdt0(xn,xm)=sdtasdt0(xp,xk)),inference(split_conjunct,[status(thm)],[42])).
% fof(389, negated_conjecture,((xk=sz00|xk=sz10)&(((![X1]:(~(aNaturalNumber0(X1))|~(xn=sdtasdt0(xp,X1)))&~(doDivides0(xp,xn)))&![X1]:(~(aNaturalNumber0(X1))|~(xm=sdtasdt0(xp,X1))))&~(doDivides0(xp,xm)))),inference(fof_nnf,[status(thm)],[47])).
% fof(390, negated_conjecture,((xk=sz00|xk=sz10)&(((![X2]:(~(aNaturalNumber0(X2))|~(xn=sdtasdt0(xp,X2)))&~(doDivides0(xp,xn)))&![X3]:(~(aNaturalNumber0(X3))|~(xm=sdtasdt0(xp,X3))))&~(doDivides0(xp,xm)))),inference(variable_rename,[status(thm)],[389])).
% fof(391, negated_conjecture,![X2]:![X3]:((((~(aNaturalNumber0(X3))|~(xm=sdtasdt0(xp,X3)))&((~(aNaturalNumber0(X2))|~(xn=sdtasdt0(xp,X2)))&~(doDivides0(xp,xn))))&~(doDivides0(xp,xm)))&(xk=sz00|xk=sz10)),inference(shift_quantors,[status(thm)],[390])).
% cnf(392,negated_conjecture,(xk=sz10|xk=sz00),inference(split_conjunct,[status(thm)],[391])).
% cnf(395,negated_conjecture,(xn!=sdtasdt0(xp,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[391])).
% cnf(396,negated_conjecture,(xm!=sdtasdt0(xp,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[391])).
% cnf(401,plain,(sdtasdt0(xp,esk9_0)=sdtasdt0(xp,xk)),inference(rw,[status(thm)],[348,376,theory(equality)])).
% cnf(433,negated_conjecture,(sz00!=xn|~aNaturalNumber0(sz00)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[395,85,theory(equality)])).
% cnf(438,negated_conjecture,(sz00!=xn|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[433,50,theory(equality)])).
% cnf(439,negated_conjecture,(sz00!=xn|$false|$false),inference(rw,[status(thm)],[438,208,theory(equality)])).
% cnf(440,negated_conjecture,(sz00!=xn),inference(cn,[status(thm)],[439,theory(equality)])).
% cnf(444,negated_conjecture,(sz00!=xm|~aNaturalNumber0(sz00)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[396,85,theory(equality)])).
% cnf(445,negated_conjecture,(sdtasdt0(xp,xk)!=xm|~aNaturalNumber0(esk9_0)),inference(spm,[status(thm)],[396,401,theory(equality)])).
% cnf(449,negated_conjecture,(sz00!=xm|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[444,50,theory(equality)])).
% cnf(450,negated_conjecture,(sz00!=xm|$false|$false),inference(rw,[status(thm)],[449,208,theory(equality)])).
% cnf(451,negated_conjecture,(sz00!=xm),inference(cn,[status(thm)],[450,theory(equality)])).
% cnf(452,negated_conjecture,(sdtasdt0(xp,xk)!=xm|$false),inference(rw,[status(thm)],[445,349,theory(equality)])).
% cnf(453,negated_conjecture,(sdtasdt0(xp,xk)!=xm),inference(cn,[status(thm)],[452,theory(equality)])).
% cnf(573,plain,(sz00=xm|sz00=xn|sdtasdt0(xp,xk)!=sz00|~aNaturalNumber0(xn)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[109,376,theory(equality)])).
% cnf(582,plain,(sz00=xm|sz00=xn|sdtasdt0(xp,xk)!=sz00|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[573,210,theory(equality)])).
% cnf(583,plain,(sz00=xm|sz00=xn|sdtasdt0(xp,xk)!=sz00|$false|$false),inference(rw,[status(thm)],[582,209,theory(equality)])).
% cnf(584,plain,(sz00=xm|sz00=xn|sdtasdt0(xp,xk)!=sz00),inference(cn,[status(thm)],[583,theory(equality)])).
% cnf(589,plain,(xp=xn|sz10=xn|sdtasdt0(xp,xk)!=xp|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[354,376,theory(equality)])).
% cnf(595,plain,(xp=xn|sz10=xn|sdtasdt0(xp,xk)!=xp|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[589,209,theory(equality)])).
% cnf(596,plain,(xp=xn|sz10=xn|sdtasdt0(xp,xk)!=xp|$false|$false),inference(rw,[status(thm)],[595,210,theory(equality)])).
% cnf(597,plain,(xp=xn|sz10=xn|sdtasdt0(xp,xk)!=xp),inference(cn,[status(thm)],[596,theory(equality)])).
% cnf(598,plain,(xn=sz10|sdtasdt0(xp,xk)!=xp),inference(sr,[status(thm)],[597,374,theory(equality)])).
% cnf(5922,plain,(xn=sz00|sdtasdt0(xp,xk)!=sz00),inference(sr,[status(thm)],[584,451,theory(equality)])).
% cnf(5923,plain,(sdtasdt0(xp,xk)!=sz00),inference(sr,[status(thm)],[5922,440,theory(equality)])).
% cnf(5924,negated_conjecture,(xk=sz10|sdtasdt0(xp,sz00)!=sz00),inference(spm,[status(thm)],[5923,392,theory(equality)])).
% cnf(5925,negated_conjecture,(xk=sz10|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[5924,85,theory(equality)])).
% cnf(5926,negated_conjecture,(xk=sz10|$false),inference(rw,[status(thm)],[5925,208,theory(equality)])).
% cnf(5927,negated_conjecture,(xk=sz10),inference(cn,[status(thm)],[5926,theory(equality)])).
% cnf(5931,plain,(xn=sz10|sdtasdt0(xp,sz10)!=xp),inference(rw,[status(thm)],[598,5927,theory(equality)])).
% cnf(5937,negated_conjecture,(sdtasdt0(xp,sz10)!=xm),inference(rw,[status(thm)],[453,5927,theory(equality)])).
% cnf(5946,plain,(sdtasdt0(xn,xm)=sdtasdt0(xp,sz10)),inference(rw,[status(thm)],[376,5927,theory(equality)])).
% cnf(6283,plain,(xn=sz10|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[5931,80,theory(equality)])).
% cnf(6284,plain,(xn=sz10|$false),inference(rw,[status(thm)],[6283,208,theory(equality)])).
% cnf(6285,plain,(xn=sz10),inference(cn,[status(thm)],[6284,theory(equality)])).
% cnf(6426,plain,(sdtasdt0(sz10,xm)=sdtasdt0(xp,sz10)),inference(rw,[status(thm)],[5946,6285,theory(equality)])).
% cnf(6441,plain,(sdtasdt0(xp,sz10)=xm|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[79,6426,theory(equality)])).
% cnf(6493,plain,(sdtasdt0(xp,sz10)=xm|$false),inference(rw,[status(thm)],[6441,209,theory(equality)])).
% cnf(6494,plain,(sdtasdt0(xp,sz10)=xm),inference(cn,[status(thm)],[6493,theory(equality)])).
% cnf(6495,plain,($false),inference(sr,[status(thm)],[6494,5937,theory(equality)])).
% cnf(6496,plain,($false),6495,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 304
% # ...of these trivial : 1
% # ...subsumed : 42
% # ...remaining for further processing: 261
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 161
% # Generated clauses : 2243
% # ...of the previous two non-trivial : 2292
% # Contextual simplify-reflections : 6
% # Paramodulations : 2154
% # Factorizations : 3
% # Equation resolutions : 86
% # Current number of processed clauses: 99
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 67
% # Current number of unprocessed clauses: 431
% # ...number of literals in the above : 2646
% # Clause-clause subsumption calls (NU) : 12884
% # Rec. Clause-clause subsumption calls : 548
% # Unit Clause-clause subsumption calls : 277
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 87 leaves, 1.33+/-1.013 terms/leaf
% # Paramod-from index: 44 leaves, 1.11+/-0.382 terms/leaf
% # Paramod-into index: 69 leaves, 1.28+/-1.020 terms/leaf
% # -------------------------------------------------
% # User time : 0.217 s
% # System time : 0.008 s
% # Total time : 0.225 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.43 CPU 0.52 WC
% FINAL PrfWatch: 0.43 CPU 0.52 WC
% SZS output end Solution for /tmp/SystemOnTPTP30949/NUM498+3.tptp
%
%------------------------------------------------------------------------------