TSTP Solution File: NUM519+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM519+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 : 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:56:28 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/SystemOnTPTP4017/NUM519+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4017/NUM519+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4017/NUM519+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 4149
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(48, axiom,((?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xr,X1))&doDivides0(xr,xn))|(?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xr,X1))&doDivides0(xr,xm))),file('/tmp/SRASS.s.p', m__2449)).
% fof(49, axiom,~((?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xr,X1))|doDivides0(xr,xn))),file('/tmp/SRASS.s.p', m__2487)).
% fof(50, axiom,~((?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xr,X1))|doDivides0(xr,xm))),file('/tmp/SRASS.s.p', m__2698)).
% fof(418, plain,((?[X2]:(aNaturalNumber0(X2)&xn=sdtasdt0(xr,X2))&doDivides0(xr,xn))|(?[X3]:(aNaturalNumber0(X3)&xm=sdtasdt0(xr,X3))&doDivides0(xr,xm))),inference(variable_rename,[status(thm)],[48])).
% fof(419, plain,(((aNaturalNumber0(esk16_0)&xn=sdtasdt0(xr,esk16_0))&doDivides0(xr,xn))|((aNaturalNumber0(esk17_0)&xm=sdtasdt0(xr,esk17_0))&doDivides0(xr,xm))),inference(skolemize,[status(esa)],[418])).
% fof(420, plain,(((((aNaturalNumber0(esk17_0)|aNaturalNumber0(esk16_0))&(xm=sdtasdt0(xr,esk17_0)|aNaturalNumber0(esk16_0)))&(doDivides0(xr,xm)|aNaturalNumber0(esk16_0)))&(((aNaturalNumber0(esk17_0)|xn=sdtasdt0(xr,esk16_0))&(xm=sdtasdt0(xr,esk17_0)|xn=sdtasdt0(xr,esk16_0)))&(doDivides0(xr,xm)|xn=sdtasdt0(xr,esk16_0))))&(((aNaturalNumber0(esk17_0)|doDivides0(xr,xn))&(xm=sdtasdt0(xr,esk17_0)|doDivides0(xr,xn)))&(doDivides0(xr,xm)|doDivides0(xr,xn)))),inference(distribute,[status(thm)],[419])).
% cnf(421,plain,(doDivides0(xr,xn)|doDivides0(xr,xm)),inference(split_conjunct,[status(thm)],[420])).
% fof(430, plain,(![X1]:(~(aNaturalNumber0(X1))|~(xn=sdtasdt0(xr,X1)))&~(doDivides0(xr,xn))),inference(fof_nnf,[status(thm)],[49])).
% fof(431, plain,(![X2]:(~(aNaturalNumber0(X2))|~(xn=sdtasdt0(xr,X2)))&~(doDivides0(xr,xn))),inference(variable_rename,[status(thm)],[430])).
% fof(432, plain,![X2]:((~(aNaturalNumber0(X2))|~(xn=sdtasdt0(xr,X2)))&~(doDivides0(xr,xn))),inference(shift_quantors,[status(thm)],[431])).
% cnf(433,plain,(~doDivides0(xr,xn)),inference(split_conjunct,[status(thm)],[432])).
% fof(435, plain,(![X1]:(~(aNaturalNumber0(X1))|~(xm=sdtasdt0(xr,X1)))&~(doDivides0(xr,xm))),inference(fof_nnf,[status(thm)],[50])).
% fof(436, plain,(![X2]:(~(aNaturalNumber0(X2))|~(xm=sdtasdt0(xr,X2)))&~(doDivides0(xr,xm))),inference(variable_rename,[status(thm)],[435])).
% fof(437, plain,![X2]:((~(aNaturalNumber0(X2))|~(xm=sdtasdt0(xr,X2)))&~(doDivides0(xr,xm))),inference(shift_quantors,[status(thm)],[436])).
% cnf(438,plain,(~doDivides0(xr,xm)),inference(split_conjunct,[status(thm)],[437])).
% cnf(461,plain,(doDivides0(xr,xm)),inference(sr,[status(thm)],[421,433,theory(equality)])).
% cnf(462,plain,($false),inference(sr,[status(thm)],[461,438,theory(equality)])).
% cnf(463,plain,($false),462,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 41
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 39
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 37
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 217
% # ...number of literals in the above : 1634
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 45 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 23 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 44 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.026 s
% # System time : 0.006 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.21 WC
% FINAL PrfWatch: 0.15 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP4017/NUM519+3.tptp
%
%------------------------------------------------------------------------------