TSTP Solution File: NUM634+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM634+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 20:44:17 EST 2010
% Result : Theorem 2.51s
% Output : Solution 2.51s
% 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/SystemOnTPTP18062/NUM634+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18062/NUM634+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18062/NUM634+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 18158
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.538 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(23, axiom,~(xK=sz00),file('/tmp/SRASS.s.p', m__3462)).
% fof(24, axiom,~(~(xK=sz00)),file('/tmp/SRASS.s.p', m__3520)).
% fof(83, plain,xK=sz00,inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% cnf(4188,plain,(xK!=sz00),inference(split_conjunct,[status(thm)],[23])).
% cnf(4189,plain,(xK=sz00),inference(split_conjunct,[status(thm)],[83])).
% cnf(4465,plain,($false),inference(rw,[status(thm)],[4188,4189,theory(equality)])).
% cnf(4466,plain,($false),inference(cn,[status(thm)],[4465,theory(equality)])).
% cnf(4467,plain,($false),4466,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 9
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 9
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # 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: 8
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 2816
% # ...number of literals in the above : 34149
% # 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 : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 11 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.512 s
% # System time : 0.027 s
% # Total time : 0.539 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.38 CPU 1.43 WC
% FINAL PrfWatch: 1.38 CPU 1.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP18062/NUM634+3.tptp
%
%------------------------------------------------------------------------------