TSTP Solution File: NUM496+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM496+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 : art09.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:35:19 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP8010/NUM496+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8010/NUM496+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8010/NUM496+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 8106
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtlseqdt0(X1,X2)=>![X3]:(X3=sdtmndt0(X2,X1)<=>(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2)))),file('/tmp/SRASS.s.p', mDefDiff)).
% fof(17, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(19, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>((doDivides0(X1,X2)&doDivides0(X1,X3))=>doDivides0(X1,sdtpldt0(X2,X3)))),file('/tmp/SRASS.s.p', mDivSum)).
% fof(21, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(24, axiom,sdtlseqdt0(xp,xn),file('/tmp/SRASS.s.p', m__1870)).
% fof(25, axiom,xr=sdtmndt0(xn,xp),file('/tmp/SRASS.s.p', m__1883)).
% fof(28, axiom,(doDivides0(xp,xr)|doDivides0(xp,xm)),file('/tmp/SRASS.s.p', m__2027)).
% fof(41, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', m_MulUnit)).
% fof(44, axiom,(aNaturalNumber0(sz10)&~(sz10=sz00)),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(47, conjecture,(doDivides0(xp,xn)|doDivides0(xp,xm)),file('/tmp/SRASS.s.p', m__)).
% fof(48, negated_conjecture,~((doDivides0(xp,xn)|doDivides0(xp,xm))),inference(assume_negation,[status(cth)],[47])).
% fof(87, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(~(sdtlseqdt0(X1,X2))|![X3]:((~(X3=sdtmndt0(X2,X1))|(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&((~(aNaturalNumber0(X3))|~(sdtpldt0(X1,X3)=X2))|X3=sdtmndt0(X2,X1))))),inference(fof_nnf,[status(thm)],[10])).
% fof(88, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|(~(sdtlseqdt0(X4,X5))|![X6]:((~(X6=sdtmndt0(X5,X4))|(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4))))),inference(variable_rename,[status(thm)],[87])).
% fof(89, plain,![X4]:![X5]:![X6]:((((~(X6=sdtmndt0(X5,X4))|(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[88])).
% fof(90, plain,![X4]:![X5]:![X6]:(((((aNaturalNumber0(X6)|~(X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((sdtpldt0(X4,X6)=X5|~(X6=sdtmndt0(X5,X4)))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))&((((~(aNaturalNumber0(X6))|~(sdtpldt0(X4,X6)=X5))|X6=sdtmndt0(X5,X4))|~(sdtlseqdt0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))),inference(distribute,[status(thm)],[89])).
% cnf(92,plain,(sdtpldt0(X2,X3)=X1|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)|X3!=sdtmndt0(X1,X2)),inference(split_conjunct,[status(thm)],[90])).
% cnf(93,plain,(aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~sdtlseqdt0(X2,X1)|X3!=sdtmndt0(X1,X2)),inference(split_conjunct,[status(thm)],[90])).
% fof(119, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(doDivides0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&(![X3]:(~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|doDivides0(X1,X2)))),inference(fof_nnf,[status(thm)],[17])).
% fof(120, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(variable_rename,[status(thm)],[119])).
% fof(121, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|(aNaturalNumber0(esk2_2(X4,X5))&X5=sdtasdt0(X4,esk2_2(X4,X5))))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[120])).
% fof(122, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aNaturalNumber0(esk2_2(X4,X5))&X5=sdtasdt0(X4,esk2_2(X4,X5)))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[121])).
% fof(123, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk2_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((X5=sdtasdt0(X4,esk2_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[122])).
% cnf(126,plain,(doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|X1!=sdtasdt0(X2,X3)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[123])).
% fof(130, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|((~(doDivides0(X1,X2))|~(doDivides0(X1,X3)))|doDivides0(X1,sdtpldt0(X2,X3)))),inference(fof_nnf,[status(thm)],[19])).
% fof(131, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|((~(doDivides0(X4,X5))|~(doDivides0(X4,X6)))|doDivides0(X4,sdtpldt0(X5,X6)))),inference(variable_rename,[status(thm)],[130])).
% cnf(132,plain,(doDivides0(X1,sdtpldt0(X2,X3))|~doDivides0(X1,X3)|~doDivides0(X1,X2)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[131])).
% cnf(136,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[21])).
% cnf(138,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[21])).
% cnf(144,plain,(sdtlseqdt0(xp,xn)),inference(split_conjunct,[status(thm)],[24])).
% cnf(145,plain,(xr=sdtmndt0(xn,xp)),inference(split_conjunct,[status(thm)],[25])).
% cnf(149,plain,(doDivides0(xp,xm)|doDivides0(xp,xr)),inference(split_conjunct,[status(thm)],[28])).
% fof(217, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[41])).
% fof(218, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[217])).
% fof(219, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aNaturalNumber0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[218])).
% cnf(221,plain,(sdtasdt0(X1,sz10)=X1|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[219])).
% cnf(226,plain,(aNaturalNumber0(sz10)),inference(split_conjunct,[status(thm)],[44])).
% fof(234, negated_conjecture,(~(doDivides0(xp,xn))&~(doDivides0(xp,xm))),inference(fof_nnf,[status(thm)],[48])).
% cnf(235,negated_conjecture,(~doDivides0(xp,xm)),inference(split_conjunct,[status(thm)],[234])).
% cnf(236,negated_conjecture,(~doDivides0(xp,xn)),inference(split_conjunct,[status(thm)],[234])).
% cnf(237,plain,(doDivides0(xp,xr)),inference(sr,[status(thm)],[149,235,theory(equality)])).
% cnf(435,plain,(doDivides0(X1,X2)|X1!=X2|~aNaturalNumber0(sz10)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[126,221,theory(equality)])).
% cnf(444,plain,(doDivides0(X1,X2)|X1!=X2|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(rw,[status(thm)],[435,226,theory(equality)])).
% cnf(445,plain,(doDivides0(X1,X2)|X1!=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)),inference(cn,[status(thm)],[444,theory(equality)])).
% cnf(446,plain,(doDivides0(X1,X1)|~aNaturalNumber0(X1)),inference(er,[status(thm)],[445,theory(equality)])).
% cnf(475,plain,(aNaturalNumber0(X1)|xr!=X1|~sdtlseqdt0(xp,xn)|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[93,145,theory(equality)])).
% cnf(476,plain,(aNaturalNumber0(X1)|xr!=X1|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[475,144,theory(equality)])).
% cnf(477,plain,(aNaturalNumber0(X1)|xr!=X1|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[476,136,theory(equality)])).
% cnf(478,plain,(aNaturalNumber0(X1)|xr!=X1|$false|$false|$false),inference(rw,[status(thm)],[477,138,theory(equality)])).
% cnf(479,plain,(aNaturalNumber0(X1)|xr!=X1),inference(cn,[status(thm)],[478,theory(equality)])).
% cnf(531,plain,(doDivides0(xp,sdtpldt0(X1,xr))|~doDivides0(xp,X1)|~aNaturalNumber0(xr)|~aNaturalNumber0(X1)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[132,237,theory(equality)])).
% cnf(534,plain,(doDivides0(xp,sdtpldt0(X1,xr))|~doDivides0(xp,X1)|~aNaturalNumber0(xr)|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[531,136,theory(equality)])).
% cnf(535,plain,(doDivides0(xp,sdtpldt0(X1,xr))|~doDivides0(xp,X1)|~aNaturalNumber0(xr)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[534,theory(equality)])).
% cnf(576,plain,(sdtpldt0(xp,X1)=xn|xr!=X1|~sdtlseqdt0(xp,xn)|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[92,145,theory(equality)])).
% cnf(577,plain,(sdtpldt0(xp,X1)=xn|xr!=X1|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[576,144,theory(equality)])).
% cnf(578,plain,(sdtpldt0(xp,X1)=xn|xr!=X1|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[577,136,theory(equality)])).
% cnf(579,plain,(sdtpldt0(xp,X1)=xn|xr!=X1|$false|$false|$false),inference(rw,[status(thm)],[578,138,theory(equality)])).
% cnf(580,plain,(sdtpldt0(xp,X1)=xn|xr!=X1),inference(cn,[status(thm)],[579,theory(equality)])).
% cnf(987,plain,(aNaturalNumber0(xr)),inference(er,[status(thm)],[479,theory(equality)])).
% cnf(1105,plain,(sdtpldt0(xp,xr)=xn),inference(er,[status(thm)],[580,theory(equality)])).
% cnf(9267,plain,(doDivides0(xp,sdtpldt0(X1,xr))|~doDivides0(xp,X1)|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[535,987,theory(equality)])).
% cnf(9268,plain,(doDivides0(xp,sdtpldt0(X1,xr))|~doDivides0(xp,X1)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[9267,theory(equality)])).
% cnf(9271,plain,(doDivides0(xp,sdtpldt0(xp,xr))|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[9268,446,theory(equality)])).
% cnf(9283,plain,(doDivides0(xp,xn)|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[9271,1105,theory(equality)])).
% cnf(9284,plain,(doDivides0(xp,xn)|$false),inference(rw,[status(thm)],[9283,136,theory(equality)])).
% cnf(9285,plain,(doDivides0(xp,xn)),inference(cn,[status(thm)],[9284,theory(equality)])).
% cnf(9286,plain,($false),inference(sr,[status(thm)],[9285,236,theory(equality)])).
% cnf(9287,plain,($false),9286,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 873
% # ...of these trivial : 18
% # ...subsumed : 285
% # ...remaining for further processing: 570
% # Other redundant clauses eliminated : 35
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 19
% # Backward-rewritten : 64
% # Generated clauses : 2775
% # ...of the previous two non-trivial : 2199
% # Contextual simplify-reflections : 118
% # Paramodulations : 2665
% # Factorizations : 4
% # Equation resolutions : 106
% # Current number of processed clauses: 410
% # Positive orientable unit clauses: 106
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 297
% # Current number of unprocessed clauses: 1147
% # ...number of literals in the above : 5060
% # Clause-clause subsumption calls (NU) : 2404
% # Rec. Clause-clause subsumption calls : 1482
% # Unit Clause-clause subsumption calls : 152
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 42
% # Indexed BW rewrite successes : 30
% # Backwards rewriting index: 349 leaves, 1.17+/-0.634 terms/leaf
% # Paramod-from index: 213 leaves, 1.10+/-0.381 terms/leaf
% # Paramod-into index: 313 leaves, 1.13+/-0.588 terms/leaf
% # -------------------------------------------------
% # User time : 0.165 s
% # System time : 0.011 s
% # Total time : 0.176 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.37 CPU 0.45 WC
% FINAL PrfWatch: 0.37 CPU 0.45 WC
% SZS output end Solution for /tmp/SystemOnTPTP8010/NUM496+1.tptp
%
%------------------------------------------------------------------------------