TSTP Solution File: NUM508+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM508+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 19:48:48 EST 2010
% Result : Theorem 7.49s
% Output : Solution 7.49s
% 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/SystemOnTPTP30100/NUM508+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30100/NUM508+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30100/NUM508+1.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 30232
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.02 WC
% PrfWatch: 1.96 CPU 2.03 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.95 CPU 4.03 WC
% PrfWatch: 5.78 CPU 6.04 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(6, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),file('/tmp/SRASS.s.p', mAddAsso)).
% fof(26, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>((~(X1=X2)&sdtlseqdt0(X1,X2))=>iLess0(X1,X2))),file('/tmp/SRASS.s.p', mIH_03)).
% fof(36, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(37, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>((isPrime0(X3)&doDivides0(X3,sdtasdt0(X1,X2)))=>(iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))=>(doDivides0(X3,X1)|doDivides0(X3,X2))))),file('/tmp/SRASS.s.p', m__1799)).
% fof(45, axiom,((aNaturalNumber0(xr)&doDivides0(xr,xk))&isPrime0(xr)),file('/tmp/SRASS.s.p', m__2342)).
% fof(46, axiom,(sdtlseqdt0(xr,xk)&doDivides0(xr,sdtasdt0(xn,xm))),file('/tmp/SRASS.s.p', m__2362)).
% fof(48, axiom,(~(sdtpldt0(sdtpldt0(xn,xm),xr)=sdtpldt0(sdtpldt0(xn,xm),xp))&sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))),file('/tmp/SRASS.s.p', m__2478)).
% fof(52, conjecture,(doDivides0(xr,xn)|doDivides0(xr,xm)),file('/tmp/SRASS.s.p', m__)).
% fof(53, negated_conjecture,~((doDivides0(xr,xn)|doDivides0(xr,xm))),inference(assume_negation,[status(cth)],[52])).
% fof(61, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(62, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(70, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(71, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|sdtpldt0(sdtpldt0(X4,X5),X6)=sdtpldt0(X4,sdtpldt0(X5,X6))),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(163, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((X1=X2|~(sdtlseqdt0(X1,X2)))|iLess0(X1,X2))),inference(fof_nnf,[status(thm)],[26])).
% fof(164, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|((X3=X4|~(sdtlseqdt0(X3,X4)))|iLess0(X3,X4))),inference(variable_rename,[status(thm)],[163])).
% cnf(165,plain,(iLess0(X1,X2)|X1=X2|~sdtlseqdt0(X1,X2)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[164])).
% cnf(216,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[36])).
% cnf(217,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[36])).
% cnf(218,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[36])).
% fof(219, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|((~(isPrime0(X3))|~(doDivides0(X3,sdtasdt0(X1,X2))))|(~(iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp)))|(doDivides0(X3,X1)|doDivides0(X3,X2))))),inference(fof_nnf,[status(thm)],[37])).
% fof(220, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|((~(isPrime0(X6))|~(doDivides0(X6,sdtasdt0(X4,X5))))|(~(iLess0(sdtpldt0(sdtpldt0(X4,X5),X6),sdtpldt0(sdtpldt0(xn,xm),xp)))|(doDivides0(X6,X4)|doDivides0(X6,X5))))),inference(variable_rename,[status(thm)],[219])).
% cnf(221,plain,(doDivides0(X1,X2)|doDivides0(X1,X3)|~iLess0(sdtpldt0(sdtpldt0(X3,X2),X1),sdtpldt0(sdtpldt0(xn,xm),xp))|~doDivides0(X1,sdtasdt0(X3,X2))|~isPrime0(X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[220])).
% cnf(236,plain,(isPrime0(xr)),inference(split_conjunct,[status(thm)],[45])).
% cnf(238,plain,(aNaturalNumber0(xr)),inference(split_conjunct,[status(thm)],[45])).
% cnf(239,plain,(doDivides0(xr,sdtasdt0(xn,xm))),inference(split_conjunct,[status(thm)],[46])).
% cnf(243,plain,(sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))),inference(split_conjunct,[status(thm)],[48])).
% cnf(244,plain,(sdtpldt0(sdtpldt0(xn,xm),xr)!=sdtpldt0(sdtpldt0(xn,xm),xp)),inference(split_conjunct,[status(thm)],[48])).
% fof(256, negated_conjecture,(~(doDivides0(xr,xn))&~(doDivides0(xr,xm))),inference(fof_nnf,[status(thm)],[53])).
% cnf(257,negated_conjecture,(~doDivides0(xr,xm)),inference(split_conjunct,[status(thm)],[256])).
% cnf(258,negated_conjecture,(~doDivides0(xr,xn)),inference(split_conjunct,[status(thm)],[256])).
% cnf(431,plain,(sdtpldt0(sdtpldt0(xn,xm),xr)=sdtpldt0(sdtpldt0(xn,xm),xp)|iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))),inference(spm,[status(thm)],[165,243,theory(equality)])).
% cnf(449,plain,(iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))),inference(sr,[status(thm)],[431,244,theory(equality)])).
% cnf(715,plain,(aNaturalNumber0(sdtpldt0(X1,sdtpldt0(X2,X3)))|~aNaturalNumber0(X3)|~aNaturalNumber0(sdtpldt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[63,72,theory(equality)])).
% cnf(1004,plain,(doDivides0(xr,xn)|doDivides0(xr,xm)|~isPrime0(xr)|~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))|~aNaturalNumber0(xn)|~aNaturalNumber0(xm)|~aNaturalNumber0(xr)),inference(spm,[status(thm)],[221,239,theory(equality)])).
% cnf(1014,plain,(doDivides0(xr,xn)|doDivides0(xr,xm)|$false|~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))|~aNaturalNumber0(xn)|~aNaturalNumber0(xm)|~aNaturalNumber0(xr)),inference(rw,[status(thm)],[1004,236,theory(equality)])).
% cnf(1015,plain,(doDivides0(xr,xn)|doDivides0(xr,xm)|$false|~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))|$false|~aNaturalNumber0(xm)|~aNaturalNumber0(xr)),inference(rw,[status(thm)],[1014,218,theory(equality)])).
% cnf(1016,plain,(doDivides0(xr,xn)|doDivides0(xr,xm)|$false|~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))|$false|$false|~aNaturalNumber0(xr)),inference(rw,[status(thm)],[1015,217,theory(equality)])).
% cnf(1017,plain,(doDivides0(xr,xn)|doDivides0(xr,xm)|$false|~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))|$false|$false|$false),inference(rw,[status(thm)],[1016,238,theory(equality)])).
% cnf(1018,plain,(doDivides0(xr,xn)|doDivides0(xr,xm)|~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))),inference(cn,[status(thm)],[1017,theory(equality)])).
% cnf(1019,plain,(doDivides0(xr,xm)|~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))),inference(sr,[status(thm)],[1018,258,theory(equality)])).
% cnf(1020,plain,(~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))),inference(sr,[status(thm)],[1019,257,theory(equality)])).
% cnf(3642,plain,(iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))|~aNaturalNumber0(xp)|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[449,72,theory(equality)])).
% cnf(3648,plain,(iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))|$false|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[3642,216,theory(equality)])).
% cnf(3649,plain,(iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[3648,217,theory(equality)])).
% cnf(3650,plain,(iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))|$false|$false|$false),inference(rw,[status(thm)],[3649,218,theory(equality)])).
% cnf(3651,plain,(iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))),inference(cn,[status(thm)],[3650,theory(equality)])).
% cnf(3656,plain,(~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(xp)|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[1020,72,theory(equality)])).
% cnf(3664,plain,(~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))|$false|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[3656,216,theory(equality)])).
% cnf(3665,plain,(~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[3664,217,theory(equality)])).
% cnf(3666,plain,(~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))|$false|$false|$false),inference(rw,[status(thm)],[3665,218,theory(equality)])).
% cnf(3667,plain,(~iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(xn,sdtpldt0(xm,xp)))),inference(cn,[status(thm)],[3666,theory(equality)])).
% cnf(16996,plain,(aNaturalNumber0(sdtpldt0(X1,sdtpldt0(X2,X3)))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)),inference(csr,[status(thm)],[715,63])).
% cnf(207285,plain,(~aNaturalNumber0(sdtpldt0(xn,sdtpldt0(xm,xp)))|~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))),inference(sr,[status(thm)],[3651,3667,theory(equality)])).
% cnf(207290,plain,(~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))|~aNaturalNumber0(xp)|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[207285,16996,theory(equality)])).
% cnf(207304,plain,(~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))|$false|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[207290,216,theory(equality)])).
% cnf(207305,plain,(~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[207304,217,theory(equality)])).
% cnf(207306,plain,(~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))|$false|$false|$false),inference(rw,[status(thm)],[207305,218,theory(equality)])).
% cnf(207307,plain,(~aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr))),inference(cn,[status(thm)],[207306,theory(equality)])).
% cnf(207312,plain,(~aNaturalNumber0(xr)|~aNaturalNumber0(sdtpldt0(xn,xm))),inference(spm,[status(thm)],[207307,63,theory(equality)])).
% cnf(207326,plain,($false|~aNaturalNumber0(sdtpldt0(xn,xm))),inference(rw,[status(thm)],[207312,238,theory(equality)])).
% cnf(207327,plain,(~aNaturalNumber0(sdtpldt0(xn,xm))),inference(cn,[status(thm)],[207326,theory(equality)])).
% cnf(207328,plain,(~aNaturalNumber0(xm)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[207327,63,theory(equality)])).
% cnf(207331,plain,($false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[207328,217,theory(equality)])).
% cnf(207332,plain,($false|$false),inference(rw,[status(thm)],[207331,218,theory(equality)])).
% cnf(207333,plain,($false),inference(cn,[status(thm)],[207332,theory(equality)])).
% cnf(207334,plain,($false),207333,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5303
% # ...of these trivial : 151
% # ...subsumed : 2557
% # ...remaining for further processing: 2595
% # Other redundant clauses eliminated : 82
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 87
% # Backward-rewritten : 289
% # Generated clauses : 70243
% # ...of the previous two non-trivial : 61800
% # Contextual simplify-reflections : 1669
% # Paramodulations : 69949
% # Factorizations : 16
% # Equation resolutions : 278
% # Current number of processed clauses: 2130
% # Positive orientable unit clauses: 387
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 38
% # Non-unit-clauses : 1705
% # Current number of unprocessed clauses: 50676
% # ...number of literals in the above : 254837
% # Clause-clause subsumption calls (NU) : 49547
% # Rec. Clause-clause subsumption calls : 20074
% # Unit Clause-clause subsumption calls : 1456
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 209
% # Indexed BW rewrite successes : 112
% # Backwards rewriting index: 1794 leaves, 1.22+/-0.998 terms/leaf
% # Paramod-from index: 1144 leaves, 1.20+/-0.906 terms/leaf
% # Paramod-into index: 1660 leaves, 1.20+/-0.923 terms/leaf
% # -------------------------------------------------
% # User time : 3.401 s
% # System time : 0.130 s
% # Total time : 3.531 s
% # Maximum resident set size: 0 pages
% PrfWatch: 6.39 CPU 6.81 WC
% FINAL PrfWatch: 6.39 CPU 6.81 WC
% SZS output end Solution for /tmp/SystemOnTPTP30100/NUM508+1.tptp
%
%------------------------------------------------------------------------------