TSTP Solution File: NUM504+3 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM504+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 : art02.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:40:34 EST 2010

% Result   : Theorem 1.58s
% Output   : Solution 1.58s
% 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/SystemOnTPTP2684/NUM504+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP2684/NUM504+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2684/NUM504+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 2780
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(4, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(19, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mLEAsym)).
% 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(45, axiom,((((((aNaturalNumber0(xr)&?[X1]:(aNaturalNumber0(X1)&xk=sdtasdt0(xr,X1)))&doDivides0(xr,xk))&~(xr=sz00))&~(xr=sz10))&![X1]:((aNaturalNumber0(X1)&(?[X2]:(aNaturalNumber0(X2)&xr=sdtasdt0(X1,X2))|doDivides0(X1,xr)))=>(X1=sz10|X1=xr)))&isPrime0(xr)),file('/tmp/SRASS.s.p', m__2342)).
% fof(46, axiom,((?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xr,X1)=xk)&?[X1]:(aNaturalNumber0(X1)&sdtasdt0(xn,xm)=sdtasdt0(xr,X1)))&doDivides0(xr,sdtasdt0(xn,xm))),file('/tmp/SRASS.s.p', m__2362)).
% fof(48, axiom,(((((~(sdtasdt0(xn,xm)=sdtasdt0(xp,xm))&?[X1]:(aNaturalNumber0(X1)&sdtpldt0(sdtasdt0(xn,xm),X1)=sdtasdt0(xp,xm)))&sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)))&~(sdtasdt0(xp,xm)=sdtasdt0(xp,xk)))&?[X1]:(aNaturalNumber0(X1)&sdtpldt0(sdtasdt0(xp,xm),X1)=sdtasdt0(xp,xk)))&sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk))),file('/tmp/SRASS.s.p', m__2414)).
% fof(60, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(61, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(64, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(128, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[19])).
% fof(129, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[128])).
% cnf(130,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[129])).
% cnf(383,plain,(sdtasdt0(xn,xm)=sdtasdt0(xp,xk)),inference(split_conjunct,[status(thm)],[42])).
% fof(390, plain,((((((aNaturalNumber0(xr)&?[X1]:(aNaturalNumber0(X1)&xk=sdtasdt0(xr,X1)))&doDivides0(xr,xk))&~(xr=sz00))&~(xr=sz10))&![X1]:((~(aNaturalNumber0(X1))|(![X2]:(~(aNaturalNumber0(X2))|~(xr=sdtasdt0(X1,X2)))&~(doDivides0(X1,xr))))|(X1=sz10|X1=xr)))&isPrime0(xr)),inference(fof_nnf,[status(thm)],[45])).
% fof(391, plain,((((((aNaturalNumber0(xr)&?[X3]:(aNaturalNumber0(X3)&xk=sdtasdt0(xr,X3)))&doDivides0(xr,xk))&~(xr=sz00))&~(xr=sz10))&![X4]:((~(aNaturalNumber0(X4))|(![X5]:(~(aNaturalNumber0(X5))|~(xr=sdtasdt0(X4,X5)))&~(doDivides0(X4,xr))))|(X4=sz10|X4=xr)))&isPrime0(xr)),inference(variable_rename,[status(thm)],[390])).
% fof(392, plain,((((((aNaturalNumber0(xr)&(aNaturalNumber0(esk12_0)&xk=sdtasdt0(xr,esk12_0)))&doDivides0(xr,xk))&~(xr=sz00))&~(xr=sz10))&![X4]:((~(aNaturalNumber0(X4))|(![X5]:(~(aNaturalNumber0(X5))|~(xr=sdtasdt0(X4,X5)))&~(doDivides0(X4,xr))))|(X4=sz10|X4=xr)))&isPrime0(xr)),inference(skolemize,[status(esa)],[391])).
% fof(393, plain,![X4]:![X5]:((((((~(aNaturalNumber0(X5))|~(xr=sdtasdt0(X4,X5)))&~(doDivides0(X4,xr)))|~(aNaturalNumber0(X4)))|(X4=sz10|X4=xr))&((((aNaturalNumber0(xr)&(aNaturalNumber0(esk12_0)&xk=sdtasdt0(xr,esk12_0)))&doDivides0(xr,xk))&~(xr=sz00))&~(xr=sz10)))&isPrime0(xr)),inference(shift_quantors,[status(thm)],[392])).
% fof(394, plain,![X4]:![X5]:((((((~(aNaturalNumber0(X5))|~(xr=sdtasdt0(X4,X5)))|~(aNaturalNumber0(X4)))|(X4=sz10|X4=xr))&((~(doDivides0(X4,xr))|~(aNaturalNumber0(X4)))|(X4=sz10|X4=xr)))&((((aNaturalNumber0(xr)&(aNaturalNumber0(esk12_0)&xk=sdtasdt0(xr,esk12_0)))&doDivides0(xr,xk))&~(xr=sz00))&~(xr=sz10)))&isPrime0(xr)),inference(distribute,[status(thm)],[393])).
% cnf(401,plain,(aNaturalNumber0(xr)),inference(split_conjunct,[status(thm)],[394])).
% fof(404, plain,((?[X2]:(aNaturalNumber0(X2)&sdtpldt0(xr,X2)=xk)&?[X3]:(aNaturalNumber0(X3)&sdtasdt0(xn,xm)=sdtasdt0(xr,X3)))&doDivides0(xr,sdtasdt0(xn,xm))),inference(variable_rename,[status(thm)],[46])).
% fof(405, plain,(((aNaturalNumber0(esk13_0)&sdtpldt0(xr,esk13_0)=xk)&(aNaturalNumber0(esk14_0)&sdtasdt0(xn,xm)=sdtasdt0(xr,esk14_0)))&doDivides0(xr,sdtasdt0(xn,xm))),inference(skolemize,[status(esa)],[404])).
% cnf(407,plain,(sdtasdt0(xn,xm)=sdtasdt0(xr,esk14_0)),inference(split_conjunct,[status(thm)],[405])).
% cnf(408,plain,(aNaturalNumber0(esk14_0)),inference(split_conjunct,[status(thm)],[405])).
% fof(416, plain,(((((~(sdtasdt0(xn,xm)=sdtasdt0(xp,xm))&?[X2]:(aNaturalNumber0(X2)&sdtpldt0(sdtasdt0(xn,xm),X2)=sdtasdt0(xp,xm)))&sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)))&~(sdtasdt0(xp,xm)=sdtasdt0(xp,xk)))&?[X3]:(aNaturalNumber0(X3)&sdtpldt0(sdtasdt0(xp,xm),X3)=sdtasdt0(xp,xk)))&sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk))),inference(variable_rename,[status(thm)],[48])).
% fof(417, plain,(((((~(sdtasdt0(xn,xm)=sdtasdt0(xp,xm))&(aNaturalNumber0(esk16_0)&sdtpldt0(sdtasdt0(xn,xm),esk16_0)=sdtasdt0(xp,xm)))&sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)))&~(sdtasdt0(xp,xm)=sdtasdt0(xp,xk)))&(aNaturalNumber0(esk17_0)&sdtpldt0(sdtasdt0(xp,xm),esk17_0)=sdtasdt0(xp,xk)))&sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk))),inference(skolemize,[status(esa)],[416])).
% cnf(418,plain,(sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk))),inference(split_conjunct,[status(thm)],[417])).
% cnf(422,plain,(sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))),inference(split_conjunct,[status(thm)],[417])).
% cnf(423,plain,(sdtpldt0(sdtasdt0(xn,xm),esk16_0)=sdtasdt0(xp,xm)),inference(split_conjunct,[status(thm)],[417])).
% cnf(424,plain,(aNaturalNumber0(esk16_0)),inference(split_conjunct,[status(thm)],[417])).
% cnf(425,plain,(sdtasdt0(xn,xm)!=sdtasdt0(xp,xm)),inference(split_conjunct,[status(thm)],[417])).
% cnf(439,plain,(sdtasdt0(xr,esk14_0)=sdtasdt0(xp,xk)),inference(rw,[status(thm)],[407,383,theory(equality)])).
% cnf(463,plain,(sdtasdt0(xp,xm)!=sdtasdt0(xp,xk)),inference(rw,[status(thm)],[425,383,theory(equality)])).
% cnf(464,plain,(sdtpldt0(sdtasdt0(xp,xk),esk16_0)=sdtasdt0(xp,xm)),inference(rw,[status(thm)],[423,383,theory(equality)])).
% cnf(465,plain,(sdtlseqdt0(sdtasdt0(xp,xk),sdtasdt0(xp,xm))),inference(rw,[status(thm)],[422,383,theory(equality)])).
% cnf(508,plain,(aNaturalNumber0(sdtasdt0(xp,xm))|~aNaturalNumber0(esk16_0)|~aNaturalNumber0(sdtasdt0(xp,xk))),inference(spm,[status(thm)],[62,464,theory(equality)])).
% cnf(529,plain,(aNaturalNumber0(sdtasdt0(xp,xm))|$false|~aNaturalNumber0(sdtasdt0(xp,xk))),inference(rw,[status(thm)],[508,424,theory(equality)])).
% cnf(530,plain,(aNaturalNumber0(sdtasdt0(xp,xm))|~aNaturalNumber0(sdtasdt0(xp,xk))),inference(cn,[status(thm)],[529,theory(equality)])).
% cnf(608,plain,(aNaturalNumber0(sdtasdt0(xp,xk))|~aNaturalNumber0(esk14_0)|~aNaturalNumber0(xr)),inference(spm,[status(thm)],[65,439,theory(equality)])).
% cnf(618,plain,(aNaturalNumber0(sdtasdt0(xp,xk))|$false|~aNaturalNumber0(xr)),inference(rw,[status(thm)],[608,408,theory(equality)])).
% cnf(619,plain,(aNaturalNumber0(sdtasdt0(xp,xk))|$false|$false),inference(rw,[status(thm)],[618,401,theory(equality)])).
% cnf(620,plain,(aNaturalNumber0(sdtasdt0(xp,xk))),inference(cn,[status(thm)],[619,theory(equality)])).
% cnf(819,plain,(sdtasdt0(xp,xm)=sdtasdt0(xp,xk)|~sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk))|~aNaturalNumber0(sdtasdt0(xp,xk))|~aNaturalNumber0(sdtasdt0(xp,xm))),inference(spm,[status(thm)],[130,465,theory(equality)])).
% cnf(836,plain,(sdtasdt0(xp,xm)=sdtasdt0(xp,xk)|$false|~aNaturalNumber0(sdtasdt0(xp,xk))|~aNaturalNumber0(sdtasdt0(xp,xm))),inference(rw,[status(thm)],[819,418,theory(equality)])).
% cnf(837,plain,(sdtasdt0(xp,xm)=sdtasdt0(xp,xk)|~aNaturalNumber0(sdtasdt0(xp,xk))|~aNaturalNumber0(sdtasdt0(xp,xm))),inference(cn,[status(thm)],[836,theory(equality)])).
% cnf(838,plain,(~aNaturalNumber0(sdtasdt0(xp,xk))|~aNaturalNumber0(sdtasdt0(xp,xm))),inference(sr,[status(thm)],[837,463,theory(equality)])).
% cnf(9022,plain,(aNaturalNumber0(sdtasdt0(xp,xm))|$false),inference(rw,[status(thm)],[530,620,theory(equality)])).
% cnf(9023,plain,(aNaturalNumber0(sdtasdt0(xp,xm))),inference(cn,[status(thm)],[9022,theory(equality)])).
% cnf(14379,plain,($false|~aNaturalNumber0(sdtasdt0(xp,xm))),inference(rw,[status(thm)],[838,620,theory(equality)])).
% cnf(14380,plain,($false|$false),inference(rw,[status(thm)],[14379,9023,theory(equality)])).
% cnf(14381,plain,($false),inference(cn,[status(thm)],[14380,theory(equality)])).
% cnf(14382,plain,($false),14381,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 548
% # ...of these trivial                : 7
% # ...subsumed                        : 132
% # ...remaining for further processing: 409
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 3
% # Backward-rewritten                 : 19
% # Generated clauses                  : 4132
% # ...of the previous two non-trivial : 3847
% # Contextual simplify-reflections    : 12
% # Paramodulations                    : 4016
% # Factorizations                     : 6
% # Equation resolutions               : 110
% # Current number of processed clauses: 385
% #    Positive orientable unit clauses: 73
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 24
% #    Non-unit-clauses                : 288
% # Current number of unprocessed clauses: 3131
% # ...number of literals in the above : 25568
% # Clause-clause subsumption calls (NU) : 12510
% # Rec. Clause-clause subsumption calls : 1003
% # Unit Clause-clause subsumption calls : 117
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 10
% # Indexed BW rewrite successes       : 10
% # Backwards rewriting index:   214 leaves,   1.28+/-0.883 terms/leaf
% # Paramod-from index:          116 leaves,   1.04+/-0.242 terms/leaf
% # Paramod-into index:          178 leaves,   1.14+/-0.770 terms/leaf
% # -------------------------------------------------
% # User time              : 0.319 s
% # System time            : 0.020 s
% # Total time             : 0.339 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.71 CPU 0.80 WC
% FINAL PrfWatch: 0.71 CPU 0.80 WC
% SZS output end Solution for /tmp/SystemOnTPTP2684/NUM504+3.tptp
% 
%------------------------------------------------------------------------------