%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM487+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 : art04.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:31:10 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP32343/NUM487+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32343/NUM487+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32343/NUM487+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 32439
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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(5, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),file('/tmp/SRASS.s.p', mAddComm)).
% fof(7, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', m_AddZero)).
% fof(13, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>((sdtpldt0(X1,X2)=sdtpldt0(X1,X3)|sdtpldt0(X2,X1)=sdtpldt0(X3,X1))=>X2=X3)),file('/tmp/SRASS.s.p', mAddCanc)).
% fof(35, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(37, 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(39, axiom,((aNaturalNumber0(xr)&sdtpldt0(xp,xr)=xn)&xr=sdtmndt0(xn,xp)),file('/tmp/SRASS.s.p', m__1883)).
% fof(44, conjecture,(~(xr=xn)&(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xr,X1)=xn)|sdtlseqdt0(xr,xn))),file('/tmp/SRASS.s.p', m__)).
% fof(45, negated_conjecture,~((~(xr=xn)&(?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xr,X1)=xn)|sdtlseqdt0(xr,xn)))),inference(assume_negation,[status(cth)],[44])).
% cnf(48,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(57, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(58, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|sdtpldt0(X3,X4)=sdtpldt0(X4,X3)),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(63, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(64, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aNaturalNumber0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[64])).
% cnf(66,plain,(X1=sdtpldt0(sz00,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(89, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|((~(sdtpldt0(X1,X2)=sdtpldt0(X1,X3))&~(sdtpldt0(X2,X1)=sdtpldt0(X3,X1)))|X2=X3)),inference(fof_nnf,[status(thm)],[13])).
% fof(90, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|((~(sdtpldt0(X4,X5)=sdtpldt0(X4,X6))&~(sdtpldt0(X5,X4)=sdtpldt0(X6,X4)))|X5=X6)),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,![X4]:![X5]:![X6]:(((~(sdtpldt0(X4,X5)=sdtpldt0(X4,X6))|X5=X6)|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))&((~(sdtpldt0(X5,X4)=sdtpldt0(X6,X4))|X5=X6)|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))),inference(distribute,[status(thm)],[90])).
% cnf(92,plain,(X2=X1|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|sdtpldt0(X2,X3)!=sdtpldt0(X1,X3)),inference(split_conjunct,[status(thm)],[91])).
% cnf(202,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[35])).
% cnf(204,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[35])).
% fof(336, 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)],[37])).
% fof(337, 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)],[336])).
% fof(338, 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)],[337])).
% fof(339, 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)],[338])).
% fof(340, 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)],[339])).
% cnf(346,plain,(xp!=sz00),inference(split_conjunct,[status(thm)],[340])).
% cnf(355,plain,(sdtpldt0(xp,xr)=xn),inference(split_conjunct,[status(thm)],[39])).
% cnf(356,plain,(aNaturalNumber0(xr)),inference(split_conjunct,[status(thm)],[39])).
% fof(372, negated_conjecture,(xr=xn|(![X1]:(~(aNaturalNumber0(X1))|~(sdtpldt0(xr,X1)=xn))&~(sdtlseqdt0(xr,xn)))),inference(fof_nnf,[status(thm)],[45])).
% fof(373, negated_conjecture,(xr=xn|(![X2]:(~(aNaturalNumber0(X2))|~(sdtpldt0(xr,X2)=xn))&~(sdtlseqdt0(xr,xn)))),inference(variable_rename,[status(thm)],[372])).
% fof(374, negated_conjecture,![X2]:(((~(aNaturalNumber0(X2))|~(sdtpldt0(xr,X2)=xn))&~(sdtlseqdt0(xr,xn)))|xr=xn),inference(shift_quantors,[status(thm)],[373])).
% fof(375, negated_conjecture,![X2]:(((~(aNaturalNumber0(X2))|~(sdtpldt0(xr,X2)=xn))|xr=xn)&(~(sdtlseqdt0(xr,xn))|xr=xn)),inference(distribute,[status(thm)],[374])).
% cnf(377,negated_conjecture,(xr=xn|sdtpldt0(xr,X1)!=xn|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[375])).
% cnf(429,negated_conjecture,(xr=xn|sdtpldt0(X1,xr)!=xn|~aNaturalNumber0(X1)|~aNaturalNumber0(xr)),inference(spm,[status(thm)],[377,59,theory(equality)])).
% cnf(437,negated_conjecture,(xr=xn|sdtpldt0(X1,xr)!=xn|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[429,356,theory(equality)])).
% cnf(438,negated_conjecture,(xr=xn|sdtpldt0(X1,xr)!=xn|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[437,theory(equality)])).
% cnf(4567,negated_conjecture,(xr=xn|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[438,355,theory(equality)])).
% cnf(4572,negated_conjecture,(xr=xn|$false),inference(rw,[status(thm)],[4567,202,theory(equality)])).
% cnf(4573,negated_conjecture,(xr=xn),inference(cn,[status(thm)],[4572,theory(equality)])).
% cnf(4600,plain,(sdtpldt0(xp,xn)=xn),inference(rw,[status(thm)],[355,4573,theory(equality)])).
% cnf(4608,plain,(X1=xp|sdtpldt0(X1,xn)!=xn|~aNaturalNumber0(xn)|~aNaturalNumber0(xp)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[92,4600,theory(equality)])).
% cnf(4629,plain,(X1=xp|sdtpldt0(X1,xn)!=xn|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[4608,204,theory(equality)])).
% cnf(4630,plain,(X1=xp|sdtpldt0(X1,xn)!=xn|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[4629,202,theory(equality)])).
% cnf(4631,plain,(X1=xp|sdtpldt0(X1,xn)!=xn|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[4630,theory(equality)])).
% cnf(6787,plain,(sz00=xp|~aNaturalNumber0(sz00)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[4631,66,theory(equality)])).
% cnf(6793,plain,(sz00=xp|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[6787,48,theory(equality)])).
% cnf(6794,plain,(sz00=xp|$false|$false),inference(rw,[status(thm)],[6793,204,theory(equality)])).
% cnf(6795,plain,(sz00=xp),inference(cn,[status(thm)],[6794,theory(equality)])).
% cnf(6796,plain,($false),inference(sr,[status(thm)],[6795,346,theory(equality)])).
% cnf(6797,plain,($false),6796,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 419
% # ...of these trivial : 3
% # ...subsumed : 96
% # ...remaining for further processing: 320
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 16
% # Generated clauses : 2546
% # ...of the previous two non-trivial : 2313
% # Contextual simplify-reflections : 33
% # Paramodulations : 2440
% # Factorizations : 3
% # Equation resolutions : 103
% # Current number of processed clauses: 299
% # Positive orientable unit clauses: 45
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 247
% # Current number of unprocessed clauses: 2054
% # ...number of literals in the above : 16875
% # Clause-clause subsumption calls (NU) : 8149
% # Rec. Clause-clause subsumption calls : 1025
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 181 leaves, 1.34+/-0.953 terms/leaf
% # Paramod-from index: 94 leaves, 1.07+/-0.300 terms/leaf
% # Paramod-into index: 149 leaves, 1.18+/-0.836 terms/leaf
% # -------------------------------------------------
% # User time : 0.200 s
% # System time : 0.011 s
% # Total time : 0.211 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/SystemOnTPTP32343/NUM487+3.tptp
%
%------------------------------------------------------------------------------