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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWV123+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 : art06.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:33:06 EST 2010

% Result   : Theorem 1.24s
% Output   : Solution 1.24s
% 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/SystemOnTPTP12514/SWV123+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP12514/SWV123+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12514/SWV123+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 12610
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,true,file('/tmp/SRASS.s.p', ttrue)).
% fof(102, conjecture,(geq(minus(n3,n1),n0)=>(geq(minus(n6,n1),n0)=>((geq(n2,n0)&geq(minus(n999,n1),n0))=>(geq(minus(n6,n1),n0)=>(geq(minus(n6,n1),n0)=>(geq(minus(n6,n1),n0)=>((geq(minus(n3,n1),n0)&geq(minus(n999,n1),n0))=>true))))))),file('/tmp/SRASS.s.p', quaternion_ds1_symm_0016)).
% fof(103, negated_conjecture,~((geq(minus(n3,n1),n0)=>(geq(minus(n6,n1),n0)=>((geq(n2,n0)&geq(minus(n999,n1),n0))=>(geq(minus(n6,n1),n0)=>(geq(minus(n6,n1),n0)=>(geq(minus(n6,n1),n0)=>((geq(minus(n3,n1),n0)&geq(minus(n999,n1),n0))=>true)))))))),inference(assume_negation,[status(cth)],[102])).
% cnf(107,plain,(true),inference(split_conjunct,[status(thm)],[1])).
% fof(410, negated_conjecture,(geq(minus(n3,n1),n0)&(geq(minus(n6,n1),n0)&((geq(n2,n0)&geq(minus(n999,n1),n0))&(geq(minus(n6,n1),n0)&(geq(minus(n6,n1),n0)&(geq(minus(n6,n1),n0)&((geq(minus(n3,n1),n0)&geq(minus(n999,n1),n0))&~(true)))))))),inference(fof_nnf,[status(thm)],[103])).
% cnf(411,negated_conjecture,(~true),inference(split_conjunct,[status(thm)],[410])).
% cnf(479,negated_conjecture,($false),inference(rw,[status(thm)],[411,107,theory(equality)])).
% cnf(480,negated_conjecture,($false),inference(cn,[status(thm)],[479,theory(equality)])).
% cnf(481,negated_conjecture,($false),480,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 2
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 2
% # 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: 1
% #    Positive orientable unit clauses: 1
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 0
% # Current number of unprocessed clauses: 215
% # ...number of literals in the above : 834
% # 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:     2 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            1 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            1 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.027 s
% # System time            : 0.004 s
% # Total time             : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP12514/SWV123+1.tptp
% 
%------------------------------------------------------------------------------