TSTP Solution File: NUM514+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM514+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 : art01.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:48:05 EST 2010
% Result : Theorem 1.25s
% Output : Solution 1.25s
% 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/SystemOnTPTP12115/NUM514+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12115/NUM514+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12115/NUM514+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 12211
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.034 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(52, axiom,((((aNaturalNumber0(sdtsldt0(xk,xr))&xk=sdtasdt0(xr,sdtsldt0(xk,xr)))&aNaturalNumber0(sdtsldt0(xn,xr)))&xn=sdtasdt0(xr,sdtsldt0(xn,xr)))&sdtasdt0(xp,sdtsldt0(xk,xr))=sdtasdt0(sdtsldt0(xn,xr),xm)),file('/tmp/SRASS.s.p', m__2613)).
% fof(56, conjecture,((aNaturalNumber0(sdtsldt0(xn,xr))&xn=sdtasdt0(xr,sdtsldt0(xn,xr)))=>(?[X1]:(aNaturalNumber0(X1)&sdtasdt0(sdtsldt0(xn,xr),xm)=sdtasdt0(xp,X1))|doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)))),file('/tmp/SRASS.s.p', m__)).
% fof(57, negated_conjecture,~(((aNaturalNumber0(sdtsldt0(xn,xr))&xn=sdtasdt0(xr,sdtsldt0(xn,xr)))=>(?[X1]:(aNaturalNumber0(X1)&sdtasdt0(sdtsldt0(xn,xr),xm)=sdtasdt0(xp,X1))|doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))))),inference(assume_negation,[status(cth)],[56])).
% cnf(454,plain,(sdtasdt0(xp,sdtsldt0(xk,xr))=sdtasdt0(sdtsldt0(xn,xr),xm)),inference(split_conjunct,[status(thm)],[52])).
% cnf(458,plain,(aNaturalNumber0(sdtsldt0(xk,xr))),inference(split_conjunct,[status(thm)],[52])).
% fof(470, negated_conjecture,((aNaturalNumber0(sdtsldt0(xn,xr))&xn=sdtasdt0(xr,sdtsldt0(xn,xr)))&(![X1]:(~(aNaturalNumber0(X1))|~(sdtasdt0(sdtsldt0(xn,xr),xm)=sdtasdt0(xp,X1)))&~(doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))))),inference(fof_nnf,[status(thm)],[57])).
% fof(471, negated_conjecture,((aNaturalNumber0(sdtsldt0(xn,xr))&xn=sdtasdt0(xr,sdtsldt0(xn,xr)))&(![X2]:(~(aNaturalNumber0(X2))|~(sdtasdt0(sdtsldt0(xn,xr),xm)=sdtasdt0(xp,X2)))&~(doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))))),inference(variable_rename,[status(thm)],[470])).
% fof(472, negated_conjecture,![X2]:(((~(aNaturalNumber0(X2))|~(sdtasdt0(sdtsldt0(xn,xr),xm)=sdtasdt0(xp,X2)))&~(doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))))&(aNaturalNumber0(sdtsldt0(xn,xr))&xn=sdtasdt0(xr,sdtsldt0(xn,xr)))),inference(shift_quantors,[status(thm)],[471])).
% cnf(476,negated_conjecture,(sdtasdt0(sdtsldt0(xn,xr),xm)!=sdtasdt0(xp,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[472])).
% cnf(491,negated_conjecture,(sdtasdt0(xp,sdtsldt0(xk,xr))!=sdtasdt0(xp,X1)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[476,454,theory(equality)])).
% cnf(676,negated_conjecture,(~aNaturalNumber0(sdtsldt0(xk,xr))),inference(er,[status(thm)],[491,theory(equality)])).
% cnf(679,negated_conjecture,($false),inference(rw,[status(thm)],[676,458,theory(equality)])).
% cnf(680,negated_conjecture,($false),inference(cn,[status(thm)],[679,theory(equality)])).
% cnf(681,negated_conjecture,($false),680,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 363
% # ...of these trivial : 11
% # ...subsumed : 7
% # ...remaining for further processing: 345
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 51
% # ...of the previous two non-trivial : 31
% # Contextual simplify-reflections : 6
% # Paramodulations : 49
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 83
% # Positive orientable unit clauses: 46
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 202
% # ...number of literals in the above : 1573
% # Clause-clause subsumption calls (NU) : 11035
% # Rec. Clause-clause subsumption calls : 525
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 95 leaves, 1.02+/-0.144 terms/leaf
% # Paramod-from index: 60 leaves, 1.02+/-0.128 terms/leaf
% # Paramod-into index: 92 leaves, 1.01+/-0.104 terms/leaf
% # -------------------------------------------------
% # User time : 0.091 s
% # System time : 0.005 s
% # Total time : 0.096 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.32 WC
% FINAL PrfWatch: 0.23 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP12115/NUM514+3.tptp
%
%------------------------------------------------------------------------------