%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM521+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 : art03.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:52:19 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP15045/NUM521+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15045/NUM521+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15045/NUM521+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 15141
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,(aNaturalNumber0(sz10)&~(sz10=sz00)),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(10, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', m_MulUnit)).
% fof(21, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),file('/tmp/SRASS.s.p', mLETotal)).
% fof(34, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(37, axiom,~((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xp,X1)=xn)|sdtlseqdt0(xp,xn))),file('/tmp/SRASS.s.p', m__1870)).
% fof(38, axiom,~((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xp,X1)=xm)|sdtlseqdt0(xp,xm))),file('/tmp/SRASS.s.p', m__2075)).
% fof(39, 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(45, conjecture,(((?[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(46, negated_conjecture,~((((?[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)],[45])).
% cnf(51,plain,(aNaturalNumber0(sz10)),inference(split_conjunct,[status(thm)],[2])).
% fof(75, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(76, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aNaturalNumber0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[76])).
% cnf(79,plain,(sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[77])).
% fof(126, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(sdtlseqdt0(X1,X2)|(~(X2=X1)&sdtlseqdt0(X2,X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(127, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|(sdtlseqdt0(X3,X4)|(~(X4=X3)&sdtlseqdt0(X4,X3)))),inference(variable_rename,[status(thm)],[126])).
% fof(128, plain,![X3]:![X4]:(((~(X4=X3)|sdtlseqdt0(X3,X4))|(~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4))))&((sdtlseqdt0(X4,X3)|sdtlseqdt0(X3,X4))|(~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4))))),inference(distribute,[status(thm)],[127])).
% cnf(129,plain,(sdtlseqdt0(X2,X1)|sdtlseqdt0(X1,X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(split_conjunct,[status(thm)],[128])).
% cnf(196,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[34])).
% cnf(197,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[34])).
% cnf(198,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[34])).
% fof(343, plain,(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xp,X1)=xn))&~(sdtlseqdt0(xp,xn))),inference(fof_nnf,[status(thm)],[37])).
% fof(344, plain,(![X2]:(~(aNaturalNumber0(X2))|~(sdtpldt0(xp,X2)=xn))&~(sdtlseqdt0(xp,xn))),inference(variable_rename,[status(thm)],[343])).
% fof(345, plain,![X2]:((~(aNaturalNumber0(X2))|~(sdtpldt0(xp,X2)=xn))&~(sdtlseqdt0(xp,xn))),inference(shift_quantors,[status(thm)],[344])).
% cnf(346,plain,(~sdtlseqdt0(xp,xn)),inference(split_conjunct,[status(thm)],[345])).
% fof(348, plain,(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xp,X1)=xm))&~(sdtlseqdt0(xp,xm))),inference(fof_nnf,[status(thm)],[38])).
% fof(349, plain,(![X2]:(~(aNaturalNumber0(X2))|~(sdtpldt0(xp,X2)=xm))&~(sdtlseqdt0(xp,xm))),inference(variable_rename,[status(thm)],[348])).
% fof(350, plain,![X2]:((~(aNaturalNumber0(X2))|~(sdtpldt0(xp,X2)=xm))&~(sdtlseqdt0(xp,xm))),inference(shift_quantors,[status(thm)],[349])).
% cnf(351,plain,(~sdtlseqdt0(xp,xm)),inference(split_conjunct,[status(thm)],[350])).
% fof(353, plain,(((xn=xp|(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xn,X1)=xp))&~(sdtlseqdt0(xn,xp))))|xm=xp)|(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xm,X1)=xp))&~(sdtlseqdt0(xm,xp)))),inference(fof_nnf,[status(thm)],[39])).
% fof(354, 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)],[353])).
% fof(355, plain,![X2]:![X3]:(((~(aNaturalNumber0(X3))|~(sdtpldt0(xm,X3)=xp))&~(sdtlseqdt0(xm,xp)))|((((~(aNaturalNumber0(X2))|~(sdtpldt0(xn,X2)=xp))&~(sdtlseqdt0(xn,xp)))|xn=xp)|xm=xp)),inference(shift_quantors,[status(thm)],[354])).
% fof(356, plain,![X2]:![X3]:((((((~(aNaturalNumber0(X2))|~(sdtpldt0(xn,X2)=xp))|xn=xp)|xm=xp)|(~(aNaturalNumber0(X3))|~(sdtpldt0(xm,X3)=xp)))&(((~(sdtlseqdt0(xn,xp))|xn=xp)|xm=xp)|(~(aNaturalNumber0(X3))|~(sdtpldt0(xm,X3)=xp))))&(((((~(aNaturalNumber0(X2))|~(sdtpldt0(xn,X2)=xp))|xn=xp)|xm=xp)|~(sdtlseqdt0(xm,xp)))&(((~(sdtlseqdt0(xn,xp))|xn=xp)|xm=xp)|~(sdtlseqdt0(xm,xp))))),inference(distribute,[status(thm)],[355])).
% cnf(357,plain,(xm=xp|xn=xp|~sdtlseqdt0(xm,xp)|~sdtlseqdt0(xn,xp)),inference(split_conjunct,[status(thm)],[356])).
% fof(383, negated_conjecture,(((![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)],[46])).
% fof(384, negated_conjecture,(((![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)],[383])).
% fof(385, negated_conjecture,![X2]:![X3]:(((~(aNaturalNumber0(X3))|~(xm=sdtasdt0(xp,X3)))&((~(aNaturalNumber0(X2))|~(xn=sdtasdt0(xp,X2)))&~(doDivides0(xp,xn))))&~(doDivides0(xp,xm))),inference(shift_quantors,[status(thm)],[384])).
% cnf(388,negated_conjecture,(xn!=sdtasdt0(xp,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[385])).
% cnf(389,negated_conjecture,(xm!=sdtasdt0(xp,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[385])).
% cnf(402,negated_conjecture,(xp!=xn|~aNaturalNumber0(sz10)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[388,79,theory(equality)])).
% cnf(403,negated_conjecture,(xp!=xm|~aNaturalNumber0(sz10)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[389,79,theory(equality)])).
% cnf(404,negated_conjecture,(xp!=xn|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[402,51,theory(equality)])).
% cnf(405,negated_conjecture,(xp!=xn|$false|$false),inference(rw,[status(thm)],[404,196,theory(equality)])).
% cnf(406,negated_conjecture,(xp!=xn),inference(cn,[status(thm)],[405,theory(equality)])).
% cnf(407,negated_conjecture,(xp!=xm|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[403,51,theory(equality)])).
% cnf(408,negated_conjecture,(xp!=xm|$false|$false),inference(rw,[status(thm)],[407,196,theory(equality)])).
% cnf(409,negated_conjecture,(xp!=xm),inference(cn,[status(thm)],[408,theory(equality)])).
% cnf(533,plain,(xm=xp|xn=xp|sdtlseqdt0(xp,xn)|~sdtlseqdt0(xm,xp)|~aNaturalNumber0(xn)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[357,129,theory(equality)])).
% cnf(535,plain,(xm=xp|xn=xp|sdtlseqdt0(xp,xn)|~sdtlseqdt0(xm,xp)|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[533,198,theory(equality)])).
% cnf(536,plain,(xm=xp|xn=xp|sdtlseqdt0(xp,xn)|~sdtlseqdt0(xm,xp)|$false|$false),inference(rw,[status(thm)],[535,196,theory(equality)])).
% cnf(537,plain,(xm=xp|xn=xp|sdtlseqdt0(xp,xn)|~sdtlseqdt0(xm,xp)),inference(cn,[status(thm)],[536,theory(equality)])).
% cnf(538,plain,(xm=xp|xn=xp|~sdtlseqdt0(xm,xp)),inference(sr,[status(thm)],[537,346,theory(equality)])).
% cnf(4562,plain,(xn=xp|~sdtlseqdt0(xm,xp)),inference(sr,[status(thm)],[538,409,theory(equality)])).
% cnf(4563,plain,(~sdtlseqdt0(xm,xp)),inference(sr,[status(thm)],[4562,406,theory(equality)])).
% cnf(4564,plain,(sdtlseqdt0(xp,xm)|~aNaturalNumber0(xm)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[4563,129,theory(equality)])).
% cnf(4566,plain,(sdtlseqdt0(xp,xm)|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[4564,197,theory(equality)])).
% cnf(4567,plain,(sdtlseqdt0(xp,xm)|$false|$false),inference(rw,[status(thm)],[4566,196,theory(equality)])).
% cnf(4568,plain,(sdtlseqdt0(xp,xm)),inference(cn,[status(thm)],[4567,theory(equality)])).
% cnf(4569,plain,($false),inference(sr,[status(thm)],[4568,351,theory(equality)])).
% cnf(4570,plain,($false),4569,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 259
% # ...of these trivial : 0
% # ...subsumed : 30
% # ...remaining for further processing: 229
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 1868
% # ...of the previous two non-trivial : 1775
% # Contextual simplify-reflections : 6
% # Paramodulations : 1780
% # Factorizations : 2
% # Equation resolutions : 86
% # Current number of processed clauses: 227
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 202
% # Current number of unprocessed clauses: 1732
% # ...number of literals in the above : 15509
% # Clause-clause subsumption calls (NU) : 12926
% # Rec. Clause-clause subsumption calls : 554
% # Unit Clause-clause subsumption calls : 274
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 96 leaves, 1.57+/-1.223 terms/leaf
% # Paramod-from index: 34 leaves, 1.15+/-0.429 terms/leaf
% # Paramod-into index: 63 leaves, 1.38+/-1.240 terms/leaf
% # -------------------------------------------------
% # User time : 0.180 s
% # System time : 0.004 s
% # Total time : 0.184 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.39 CPU 0.47 WC
% FINAL PrfWatch: 0.39 CPU 0.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP15045/NUM521+3.tptp
%
%------------------------------------------------------------------------------