TSTP Solution File: NUM436+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM436+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 : art05.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:00:02 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP32566/NUM436+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32566/NUM436+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32566/NUM436+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 32663
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>aInteger0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mIntMult)).
% fof(19, axiom,(((((aInteger0(xa)&aInteger0(xb))&aInteger0(xp))&~(xp=sz00))&aInteger0(xq))&~(xq=sz00)),file('/tmp/SRASS.s.p', m__979)).
% fof(21, axiom,(aInteger0(xm)&sdtasdt0(sdtasdt0(xp,xq),xm)=sdtpldt0(xa,smndt0(xb))),file('/tmp/SRASS.s.p', m__1032)).
% fof(22, axiom,(sdtasdt0(xp,sdtasdt0(xq,xm))=sdtpldt0(xa,smndt0(xb))&sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm))),file('/tmp/SRASS.s.p', m__1071)).
% fof(27, conjecture,(((?[X1]:(aInteger0(X1)&sdtasdt0(xp,X1)=sdtpldt0(xa,smndt0(xb)))|aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|sdteqdtlpzmzozddtrp0(xa,xb,xp))&((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb)))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))))|sdteqdtlpzmzozddtrp0(xa,xb,xq))),file('/tmp/SRASS.s.p', m__)).
% fof(28, negated_conjecture,~((((?[X1]:(aInteger0(X1)&sdtasdt0(xp,X1)=sdtpldt0(xa,smndt0(xb)))|aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|sdteqdtlpzmzozddtrp0(xa,xb,xp))&((?[X1]:(aInteger0(X1)&sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb)))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))))|sdteqdtlpzmzozddtrp0(xa,xb,xq)))),inference(assume_negation,[status(cth)],[27])).
% fof(37, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(38, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[38])).
% cnf(100,plain,(aInteger0(xq)),inference(split_conjunct,[status(thm)],[19])).
% cnf(102,plain,(aInteger0(xp)),inference(split_conjunct,[status(thm)],[19])).
% cnf(113,plain,(aInteger0(xm)),inference(split_conjunct,[status(thm)],[21])).
% cnf(114,plain,(sdtpldt0(xa,smndt0(xb))=sdtasdt0(xq,sdtasdt0(xp,xm))),inference(split_conjunct,[status(thm)],[22])).
% cnf(115,plain,(sdtasdt0(xp,sdtasdt0(xq,xm))=sdtpldt0(xa,smndt0(xb))),inference(split_conjunct,[status(thm)],[22])).
% fof(129, negated_conjecture,(((![X1]:(~(aInteger0(X1))|~(sdtasdt0(xp,X1)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xp)))|((![X1]:(~(aInteger0(X1))|~(sdtasdt0(xq,X1)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xq)))),inference(fof_nnf,[status(thm)],[28])).
% fof(130, negated_conjecture,(((![X2]:(~(aInteger0(X2))|~(sdtasdt0(xp,X2)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xp)))|((![X3]:(~(aInteger0(X3))|~(sdtasdt0(xq,X3)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xq)))),inference(variable_rename,[status(thm)],[129])).
% fof(131, negated_conjecture,![X2]:![X3]:((((~(aInteger0(X3))|~(sdtasdt0(xq,X3)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xq)))|(((~(aInteger0(X2))|~(sdtasdt0(xp,X2)=sdtpldt0(xa,smndt0(xb))))&~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))))&~(sdteqdtlpzmzozddtrp0(xa,xb,xp)))),inference(shift_quantors,[status(thm)],[130])).
% fof(132, negated_conjecture,![X2]:![X3]:((((((~(aInteger0(X2))|~(sdtasdt0(xp,X2)=sdtpldt0(xa,smndt0(xb))))|(~(aInteger0(X3))|~(sdtasdt0(xq,X3)=sdtpldt0(xa,smndt0(xb)))))&(~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|(~(aInteger0(X3))|~(sdtasdt0(xq,X3)=sdtpldt0(xa,smndt0(xb))))))&(~(sdteqdtlpzmzozddtrp0(xa,xb,xp))|(~(aInteger0(X3))|~(sdtasdt0(xq,X3)=sdtpldt0(xa,smndt0(xb))))))&((((~(aInteger0(X2))|~(sdtasdt0(xp,X2)=sdtpldt0(xa,smndt0(xb))))|~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))&(~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))))))&(~(sdteqdtlpzmzozddtrp0(xa,xb,xp))|~(aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))))))&((((~(aInteger0(X2))|~(sdtasdt0(xp,X2)=sdtpldt0(xa,smndt0(xb))))|~(sdteqdtlpzmzozddtrp0(xa,xb,xq)))&(~(aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))))|~(sdteqdtlpzmzozddtrp0(xa,xb,xq))))&(~(sdteqdtlpzmzozddtrp0(xa,xb,xp))|~(sdteqdtlpzmzozddtrp0(xa,xb,xq))))),inference(distribute,[status(thm)],[131])).
% cnf(141,negated_conjecture,(sdtasdt0(xq,X1)!=sdtpldt0(xa,smndt0(xb))|~aInteger0(X1)|sdtasdt0(xp,X2)!=sdtpldt0(xa,smndt0(xb))|~aInteger0(X2)),inference(split_conjunct,[status(thm)],[132])).
% cnf(143,plain,(sdtasdt0(xq,sdtasdt0(xp,xm))=sdtasdt0(xp,sdtasdt0(xq,xm))),inference(rw,[status(thm)],[114,115,theory(equality)])).
% cnf(156,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xp,X2)|sdtpldt0(xa,smndt0(xb))!=sdtasdt0(xq,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(rw,[status(thm)],[141,115,theory(equality)])).
% cnf(157,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xp,X2)|sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xq,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(rw,[status(thm)],[156,115,theory(equality)])).
% fof(158, plain,(~(epred1_0)<=>![X2]:(~(sdtasdt0(xp,sdtasdt0(xq,xm))=sdtasdt0(xp,X2))|~(aInteger0(X2)))),introduced(definition),['split']).
% cnf(159,plain,(epred1_0|~aInteger0(X2)|sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xp,X2)),inference(split_equiv,[status(thm)],[158])).
% fof(160, plain,(~(epred2_0)<=>![X1]:(~(sdtasdt0(xp,sdtasdt0(xq,xm))=sdtasdt0(xq,X1))|~(aInteger0(X1)))),introduced(definition),['split']).
% cnf(161,plain,(epred2_0|~aInteger0(X1)|sdtasdt0(xp,sdtasdt0(xq,xm))!=sdtasdt0(xq,X1)),inference(split_equiv,[status(thm)],[160])).
% cnf(162,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[157,158,theory(equality)]),160,theory(equality)]),['split']).
% cnf(296,negated_conjecture,(epred1_0|~aInteger0(sdtasdt0(xq,xm))),inference(er,[status(thm)],[159,theory(equality)])).
% cnf(309,negated_conjecture,(epred2_0|~aInteger0(sdtasdt0(xp,xm))),inference(spm,[status(thm)],[161,143,theory(equality)])).
% cnf(552,negated_conjecture,(epred1_0|~aInteger0(xm)|~aInteger0(xq)),inference(spm,[status(thm)],[296,39,theory(equality)])).
% cnf(553,negated_conjecture,(epred1_0|$false|~aInteger0(xq)),inference(rw,[status(thm)],[552,113,theory(equality)])).
% cnf(554,negated_conjecture,(epred1_0|$false|$false),inference(rw,[status(thm)],[553,100,theory(equality)])).
% cnf(555,negated_conjecture,(epred1_0),inference(cn,[status(thm)],[554,theory(equality)])).
% cnf(557,negated_conjecture,(~epred2_0|$false),inference(rw,[status(thm)],[162,555,theory(equality)])).
% cnf(558,negated_conjecture,(~epred2_0),inference(cn,[status(thm)],[557,theory(equality)])).
% cnf(585,negated_conjecture,(~aInteger0(sdtasdt0(xp,xm))),inference(sr,[status(thm)],[309,558,theory(equality)])).
% cnf(586,negated_conjecture,(~aInteger0(xm)|~aInteger0(xp)),inference(spm,[status(thm)],[585,39,theory(equality)])).
% cnf(587,negated_conjecture,($false|~aInteger0(xp)),inference(rw,[status(thm)],[586,113,theory(equality)])).
% cnf(588,negated_conjecture,($false|$false),inference(rw,[status(thm)],[587,102,theory(equality)])).
% cnf(589,negated_conjecture,($false),inference(cn,[status(thm)],[588,theory(equality)])).
% cnf(590,negated_conjecture,($false),589,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 127
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 126
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 193
% # ...of the previous two non-trivial : 179
% # Contextual simplify-reflections : 0
% # Paramodulations : 185
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 62
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 41
% # Current number of unprocessed clauses: 163
% # ...number of literals in the above : 608
% # Clause-clause subsumption calls (NU) : 272
% # Rec. Clause-clause subsumption calls : 143
% # Unit Clause-clause subsumption calls : 56
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 70 leaves, 1.30+/-0.868 terms/leaf
% # Paramod-from index: 35 leaves, 1.09+/-0.280 terms/leaf
% # Paramod-into index: 59 leaves, 1.22+/-0.640 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.003 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP32566/NUM436+3.tptp
%
%------------------------------------------------------------------------------