TSTP Solution File: NUM490+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM490+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 : art07.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:32:24 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP28968/NUM490+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28968/NUM490+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28968/NUM490+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 29064
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(37, axiom,(((((~(xp=sz00)&~(xp=sz10))&![X1]:((aNaturalNumber0(X1)&(?[X2]:(aNaturalNumber0(X2)&xp=sdtasdt0(X1,X2))|doDivides0(X1,xp)))=>(X1=sz10|X1=xp)))&isPrime0(xp))&?[X1]:(aNaturalNumber0(X1)&sdtasdt0(xn,xm)=sdtasdt0(xp,X1)))&doDivides0(xp,sdtasdt0(xn,xm))),file('/tmp/SRASS.s.p', m__1860)).
% fof(42, axiom,sdtasdt0(xn,xm)=sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),file('/tmp/SRASS.s.p', m__1951)).
% fof(47, conjecture,(sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))=sdtasdt0(xn,xm)|sdtasdt0(xr,xm)=sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))),file('/tmp/SRASS.s.p', m__)).
% fof(48, negated_conjecture,~((sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))=sdtasdt0(xn,xm)|sdtasdt0(xr,xm)=sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)))),inference(assume_negation,[status(cth)],[47])).
% fof(339, plain,(((((~(xp=sz00)&~(xp=sz10))&![X1]:((~(aNaturalNumber0(X1))|(![X2]:(~(aNaturalNumber0(X2))|~(xp=sdtasdt0(X1,X2)))&~(doDivides0(X1,xp))))|(X1=sz10|X1=xp)))&isPrime0(xp))&?[X1]:(aNaturalNumber0(X1)&sdtasdt0(xn,xm)=sdtasdt0(xp,X1)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(fof_nnf,[status(thm)],[37])).
% fof(340, plain,(((((~(xp=sz00)&~(xp=sz10))&![X3]:((~(aNaturalNumber0(X3))|(![X4]:(~(aNaturalNumber0(X4))|~(xp=sdtasdt0(X3,X4)))&~(doDivides0(X3,xp))))|(X3=sz10|X3=xp)))&isPrime0(xp))&?[X5]:(aNaturalNumber0(X5)&sdtasdt0(xn,xm)=sdtasdt0(xp,X5)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(variable_rename,[status(thm)],[339])).
% fof(341, plain,(((((~(xp=sz00)&~(xp=sz10))&![X3]:((~(aNaturalNumber0(X3))|(![X4]:(~(aNaturalNumber0(X4))|~(xp=sdtasdt0(X3,X4)))&~(doDivides0(X3,xp))))|(X3=sz10|X3=xp)))&isPrime0(xp))&(aNaturalNumber0(esk9_0)&sdtasdt0(xn,xm)=sdtasdt0(xp,esk9_0)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(skolemize,[status(esa)],[340])).
% fof(342, plain,![X3]:![X4]:((((((((~(aNaturalNumber0(X4))|~(xp=sdtasdt0(X3,X4)))&~(doDivides0(X3,xp)))|~(aNaturalNumber0(X3)))|(X3=sz10|X3=xp))&(~(xp=sz00)&~(xp=sz10)))&isPrime0(xp))&(aNaturalNumber0(esk9_0)&sdtasdt0(xn,xm)=sdtasdt0(xp,esk9_0)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(shift_quantors,[status(thm)],[341])).
% fof(343, plain,![X3]:![X4]:((((((((~(aNaturalNumber0(X4))|~(xp=sdtasdt0(X3,X4)))|~(aNaturalNumber0(X3)))|(X3=sz10|X3=xp))&((~(doDivides0(X3,xp))|~(aNaturalNumber0(X3)))|(X3=sz10|X3=xp)))&(~(xp=sz00)&~(xp=sz10)))&isPrime0(xp))&(aNaturalNumber0(esk9_0)&sdtasdt0(xn,xm)=sdtasdt0(xp,esk9_0)))&doDivides0(xp,sdtasdt0(xn,xm))),inference(distribute,[status(thm)],[342])).
% cnf(345,plain,(sdtasdt0(xn,xm)=sdtasdt0(xp,esk9_0)),inference(split_conjunct,[status(thm)],[343])).
% cnf(367,plain,(sdtasdt0(xn,xm)=sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))),inference(split_conjunct,[status(thm)],[42])).
% fof(383, negated_conjecture,(~(sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))=sdtasdt0(xn,xm))&~(sdtasdt0(xr,xm)=sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)))),inference(fof_nnf,[status(thm)],[48])).
% cnf(385,negated_conjecture,(sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))!=sdtasdt0(xn,xm)),inference(split_conjunct,[status(thm)],[383])).
% cnf(387,plain,(sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))=sdtasdt0(xp,esk9_0)),inference(rw,[status(thm)],[367,345,theory(equality)])).
% cnf(395,negated_conjecture,(sdtasdt0(xp,esk9_0)!=sdtasdt0(xn,xm)),inference(rw,[status(thm)],[385,387,theory(equality)])).
% cnf(396,negated_conjecture,($false),inference(rw,[status(thm)],[395,345,theory(equality)])).
% cnf(397,negated_conjecture,($false),inference(cn,[status(thm)],[396,theory(equality)])).
% cnf(398,negated_conjecture,($false),397,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 37
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 36
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 2
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 35
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 183
% # ...number of literals in the above : 1562
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 45 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 28 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 42 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.003 s
% # Total time : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP28968/NUM490+3.tptp
%
%------------------------------------------------------------------------------