TSTP Solution File: SWV150+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWV150+1 : TPTP v5.0.0. Bugfixed v3.3.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 : Thu Dec 30 08:37:47 EST 2010

% Result   : Theorem 1.32s
% Output   : Solution 1.32s
% 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/SystemOnTPTP4502/SWV150+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP4502/SWV150+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4502/SWV150+1.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 4598
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:leq(X1,X1),file('/tmp/SRASS.s.p', reflexivity_leq)).
% fof(85, conjecture,(~(leq(tptp_float_0_001,tptp_float_0_001))=>leq(s_worst7,n3)),file('/tmp/SRASS.s.p', gauss_array_0020)).
% fof(86, negated_conjecture,~((~(leq(tptp_float_0_001,tptp_float_0_001))=>leq(s_worst7,n3))),inference(assume_negation,[status(cth)],[85])).
% fof(88, negated_conjecture,~((~(leq(tptp_float_0_001,tptp_float_0_001))=>leq(s_worst7,n3))),inference(fof_simplification,[status(thm)],[86,theory(equality)])).
% fof(91, plain,![X2]:leq(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(92,plain,(leq(X1,X1)),inference(split_conjunct,[status(thm)],[91])).
% fof(375, negated_conjecture,(~(leq(tptp_float_0_001,tptp_float_0_001))&~(leq(s_worst7,n3))),inference(fof_nnf,[status(thm)],[88])).
% cnf(377,negated_conjecture,(~leq(tptp_float_0_001,tptp_float_0_001)),inference(split_conjunct,[status(thm)],[375])).
% cnf(435,negated_conjecture,($false),inference(rw,[status(thm)],[377,92,theory(equality)])).
% cnf(436,negated_conjecture,($false),inference(cn,[status(thm)],[435,theory(equality)])).
% cnf(437,negated_conjecture,($false),436,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 3
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 3
% # 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: 2
% #    Positive orientable unit clauses: 1
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 0
% # Current number of unprocessed clauses: 189
% # ...number of literals in the above : 800
% # 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        : 2
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:     5 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            1 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            4 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.22 WC
% FINAL PrfWatch: 0.15 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP4502/SWV150+1.tptp
% 
%------------------------------------------------------------------------------