TSTP Solution File: NUM491+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM491+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 : art02.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:57 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP29426/NUM491+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29426/NUM491+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29426/NUM491+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 29522
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(35, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(48, conjecture,(?[X1]:(aNaturalNumber0(X1)&sdtasdt0(xp,xm)=sdtasdt0(xp,X1))|doDivides0(xp,sdtasdt0(xp,xm))),file('/tmp/SRASS.s.p', m__)).
% fof(49, negated_conjecture,~((?[X1]:(aNaturalNumber0(X1)&sdtasdt0(xp,xm)=sdtasdt0(xp,X1))|doDivides0(xp,sdtasdt0(xp,xm)))),inference(assume_negation,[status(cth)],[48])).
% cnf(207,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[35])).
% fof(386, negated_conjecture,(![X1]:(~(aNaturalNumber0(X1))|~(sdtasdt0(xp,xm)=sdtasdt0(xp,X1)))&~(doDivides0(xp,sdtasdt0(xp,xm)))),inference(fof_nnf,[status(thm)],[49])).
% fof(387, negated_conjecture,(![X2]:(~(aNaturalNumber0(X2))|~(sdtasdt0(xp,xm)=sdtasdt0(xp,X2)))&~(doDivides0(xp,sdtasdt0(xp,xm)))),inference(variable_rename,[status(thm)],[386])).
% fof(388, negated_conjecture,![X2]:((~(aNaturalNumber0(X2))|~(sdtasdt0(xp,xm)=sdtasdt0(xp,X2)))&~(doDivides0(xp,sdtasdt0(xp,xm)))),inference(shift_quantors,[status(thm)],[387])).
% cnf(390,negated_conjecture,(sdtasdt0(xp,xm)!=sdtasdt0(xp,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[388])).
% cnf(438,negated_conjecture,(~aNaturalNumber0(xm)),inference(er,[status(thm)],[390,theory(equality)])).
% cnf(439,negated_conjecture,($false),inference(rw,[status(thm)],[438,207,theory(equality)])).
% cnf(440,negated_conjecture,($false),inference(cn,[status(thm)],[439,theory(equality)])).
% cnf(441,negated_conjecture,($false),440,['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 : 1
% # Generated clauses : 13
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 0
% # Paramodulations : 10
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 35
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 187
% # ...number of literals in the above : 1568
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # 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: 46 leaves, 1.02+/-0.146 terms/leaf
% # Paramod-from index: 27 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 42 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.028 s
% # System time : 0.005 s
% # Total time : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.22 WC
% FINAL PrfWatch: 0.15 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP29426/NUM491+3.tptp
%
%------------------------------------------------------------------------------