TSTP Solution File: NUM425+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM425+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 : art06.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 18:56:25 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP31148/NUM425+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31148/NUM425+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31148/NUM425+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 31244
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(aInteger0(X1)=>aInteger0(smndt0(X1))),file('/tmp/SRASS.s.p', mIntNeg)).
% fof(3, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>aInteger0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mIntPlus)).
% fof(15, axiom,(((aInteger0(xa)&aInteger0(xb))&aInteger0(xq))&~(xq=sz00)),file('/tmp/SRASS.s.p', m__704)).
% fof(16, axiom,sdteqdtlpzmzozddtrp0(xa,xb,xq),file('/tmp/SRASS.s.p', m__724)).
% fof(17, axiom,![X1]:![X2]:![X3]:((((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))&~(X3=sz00))=>(sdteqdtlpzmzozddtrp0(X1,X2,X3)<=>aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))))),file('/tmp/SRASS.s.p', mEquMod)).
% fof(19, axiom,![X1]:(aInteger0(X1)=>![X2]:(aDivisorOf0(X2,X1)<=>((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1)))),file('/tmp/SRASS.s.p', mDivisor)).
% fof(23, conjecture,?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__)).
% fof(24, negated_conjecture,~(?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb)))),inference(assume_negation,[status(cth)],[23])).
% fof(27, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(28, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(31, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(aInteger0(sdtpldt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[31])).
% cnf(74,plain,(xq!=sz00),inference(split_conjunct,[status(thm)],[15])).
% cnf(75,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[15])).
% cnf(76,plain,(aInteger0(xb)),inference(split_conjunct,[status(thm)],[15])).
% cnf(77,plain,(aInteger0(xa)),inference(split_conjunct,[status(thm)],[15])).
% cnf(78,plain,(sdteqdtlpzmzozddtrp0(xa,xb,xq)),inference(split_conjunct,[status(thm)],[16])).
% fof(79, plain,![X1]:![X2]:![X3]:((((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|X3=sz00)|((~(sdteqdtlpzmzozddtrp0(X1,X2,X3))|aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))))&(~(aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))))|sdteqdtlpzmzozddtrp0(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[17])).
% fof(80, plain,![X4]:![X5]:![X6]:((((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00)|((~(sdteqdtlpzmzozddtrp0(X4,X5,X6))|aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))&(~(aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))|sdteqdtlpzmzozddtrp0(X4,X5,X6)))),inference(variable_rename,[status(thm)],[79])).
% fof(81, plain,![X4]:![X5]:![X6]:(((~(sdteqdtlpzmzozddtrp0(X4,X5,X6))|aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))|(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00))&((~(aDivisorOf0(X6,sdtpldt0(X4,smndt0(X5))))|sdteqdtlpzmzozddtrp0(X4,X5,X6))|(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|X6=sz00))),inference(distribute,[status(thm)],[80])).
% cnf(83,plain,(X1=sz00|aDivisorOf0(X1,sdtpldt0(X3,smndt0(X2)))|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)|~sdteqdtlpzmzozddtrp0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[81])).
% fof(89, plain,![X1]:(~(aInteger0(X1))|![X2]:((~(aDivisorOf0(X2,X1))|((aInteger0(X2)&~(X2=sz00))&?[X3]:(aInteger0(X3)&sdtasdt0(X2,X3)=X1)))&(((~(aInteger0(X2))|X2=sz00)|![X3]:(~(aInteger0(X3))|~(sdtasdt0(X2,X3)=X1)))|aDivisorOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[19])).
% fof(90, plain,![X4]:(~(aInteger0(X4))|![X5]:((~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&?[X6]:(aInteger0(X6)&sdtasdt0(X5,X6)=X4)))&(((~(aInteger0(X5))|X5=sz00)|![X7]:(~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4)))|aDivisorOf0(X5,X4)))),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,![X4]:(~(aInteger0(X4))|![X5]:((~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&(aInteger0(esk1_2(X4,X5))&sdtasdt0(X5,esk1_2(X4,X5))=X4)))&(((~(aInteger0(X5))|X5=sz00)|![X7]:(~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4)))|aDivisorOf0(X5,X4)))),inference(skolemize,[status(esa)],[90])).
% fof(92, plain,![X4]:![X5]:![X7]:(((((~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4))|(~(aInteger0(X5))|X5=sz00))|aDivisorOf0(X5,X4))&(~(aDivisorOf0(X5,X4))|((aInteger0(X5)&~(X5=sz00))&(aInteger0(esk1_2(X4,X5))&sdtasdt0(X5,esk1_2(X4,X5))=X4))))|~(aInteger0(X4))),inference(shift_quantors,[status(thm)],[91])).
% fof(93, plain,![X4]:![X5]:![X7]:(((((~(aInteger0(X7))|~(sdtasdt0(X5,X7)=X4))|(~(aInteger0(X5))|X5=sz00))|aDivisorOf0(X5,X4))|~(aInteger0(X4)))&((((aInteger0(X5)|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))&((~(X5=sz00)|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4))))&(((aInteger0(esk1_2(X4,X5))|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))&((sdtasdt0(X5,esk1_2(X4,X5))=X4|~(aDivisorOf0(X5,X4)))|~(aInteger0(X4)))))),inference(distribute,[status(thm)],[92])).
% cnf(94,plain,(sdtasdt0(X2,esk1_2(X1,X2))=X1|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[93])).
% cnf(95,plain,(aInteger0(esk1_2(X1,X2))|~aInteger0(X1)|~aDivisorOf0(X2,X1)),inference(split_conjunct,[status(thm)],[93])).
% fof(107, negated_conjecture,![X1]:(~(aInteger0(X1))|~(sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb)))),inference(fof_nnf,[status(thm)],[24])).
% fof(108, negated_conjecture,![X2]:(~(aInteger0(X2))|~(sdtasdt0(xq,X2)=sdtpldt0(xa,smndt0(xb)))),inference(variable_rename,[status(thm)],[107])).
% cnf(109,negated_conjecture,(sdtasdt0(xq,X1)!=sdtpldt0(xa,smndt0(xb))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[108])).
% cnf(359,plain,(sz00=xq|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))|~aInteger0(xa)|~aInteger0(xb)|~aInteger0(xq)),inference(spm,[status(thm)],[83,78,theory(equality)])).
% cnf(361,plain,(sz00=xq|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))|$false|~aInteger0(xb)|~aInteger0(xq)),inference(rw,[status(thm)],[359,77,theory(equality)])).
% cnf(362,plain,(sz00=xq|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))|$false|$false|~aInteger0(xq)),inference(rw,[status(thm)],[361,76,theory(equality)])).
% cnf(363,plain,(sz00=xq|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))|$false|$false|$false),inference(rw,[status(thm)],[362,75,theory(equality)])).
% cnf(364,plain,(sz00=xq|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))),inference(cn,[status(thm)],[363,theory(equality)])).
% cnf(365,plain,(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))),inference(sr,[status(thm)],[364,74,theory(equality)])).
% cnf(366,plain,(aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))|~aInteger0(sdtpldt0(xa,smndt0(xb)))),inference(spm,[status(thm)],[95,365,theory(equality)])).
% cnf(368,plain,(sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq))=sdtpldt0(xa,smndt0(xb))|~aInteger0(sdtpldt0(xa,smndt0(xb)))),inference(spm,[status(thm)],[94,365,theory(equality)])).
% cnf(423,plain,(aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))|~aInteger0(smndt0(xb))|~aInteger0(xa)),inference(spm,[status(thm)],[366,32,theory(equality)])).
% cnf(424,plain,(aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))|~aInteger0(smndt0(xb))|$false),inference(rw,[status(thm)],[423,77,theory(equality)])).
% cnf(425,plain,(aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))|~aInteger0(smndt0(xb))),inference(cn,[status(thm)],[424,theory(equality)])).
% cnf(426,plain,(aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))|~aInteger0(xb)),inference(spm,[status(thm)],[425,29,theory(equality)])).
% cnf(427,plain,(aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))|$false),inference(rw,[status(thm)],[426,76,theory(equality)])).
% cnf(428,plain,(aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))),inference(cn,[status(thm)],[427,theory(equality)])).
% cnf(434,plain,(sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq))=sdtpldt0(xa,smndt0(xb))|~aInteger0(smndt0(xb))|~aInteger0(xa)),inference(spm,[status(thm)],[368,32,theory(equality)])).
% cnf(435,plain,(sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq))=sdtpldt0(xa,smndt0(xb))|~aInteger0(smndt0(xb))|$false),inference(rw,[status(thm)],[434,77,theory(equality)])).
% cnf(436,plain,(sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq))=sdtpldt0(xa,smndt0(xb))|~aInteger0(smndt0(xb))),inference(cn,[status(thm)],[435,theory(equality)])).
% cnf(437,plain,(sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq))=sdtpldt0(xa,smndt0(xb))|~aInteger0(xb)),inference(spm,[status(thm)],[436,29,theory(equality)])).
% cnf(438,plain,(sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq))=sdtpldt0(xa,smndt0(xb))|$false),inference(rw,[status(thm)],[437,76,theory(equality)])).
% cnf(439,plain,(sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq))=sdtpldt0(xa,smndt0(xb))),inference(cn,[status(thm)],[438,theory(equality)])).
% cnf(448,negated_conjecture,(~aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))),inference(spm,[status(thm)],[109,439,theory(equality)])).
% cnf(477,negated_conjecture,($false),inference(rw,[status(thm)],[448,428,theory(equality)])).
% cnf(478,negated_conjecture,($false),inference(cn,[status(thm)],[477,theory(equality)])).
% cnf(479,negated_conjecture,($false),478,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 93
% # ...of these trivial : 4
% # ...subsumed : 5
% # ...remaining for further processing: 84
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 166
% # ...of the previous two non-trivial : 147
% # Contextual simplify-reflections : 1
% # Paramodulations : 162
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 126
% # ...number of literals in the above : 505
% # Clause-clause subsumption calls (NU) : 231
% # Rec. Clause-clause subsumption calls : 138
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 54 leaves, 1.28+/-0.756 terms/leaf
% # Paramod-from index: 30 leaves, 1.10+/-0.300 terms/leaf
% # Paramod-into index: 45 leaves, 1.20+/-0.542 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.003 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP31148/NUM425+1.tptp
%
%------------------------------------------------------------------------------