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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM838+1 : TPTP v5.0.0. Released v4.1.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 20:45:14 EST 2010

% Result   : Theorem 1.03s
% Output   : Solution 1.03s
% 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/SystemOnTPTP14788/NUM838+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP14788/NUM838+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14788/NUM838+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 14884
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,greater(vd301,vd302),file('/tmp/SRASS.s.p', 'holds(antec(195), 304, 0)')).
% fof(2, axiom,![X1]:![X2]:![X3]:(greater(X2,X3)=>greater(vplus(X2,X1),vplus(X3,X1))),file('/tmp/SRASS.s.p', 'ass(cond(proof(196), 0), 4)')).
% fof(44, conjecture,greater(vplus(vd301,vd303),vplus(vd302,vd303)),file('/tmp/SRASS.s.p', 'holds(conseq(195), 305, 0)')).
% fof(45, negated_conjecture,~(greater(vplus(vd301,vd303),vplus(vd302,vd303))),inference(assume_negation,[status(cth)],[44])).
% fof(49, negated_conjecture,~(greater(vplus(vd301,vd303),vplus(vd302,vd303))),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% cnf(50,plain,(greater(vd301,vd302)),inference(split_conjunct,[status(thm)],[1])).
% fof(51, plain,![X1]:![X2]:![X3]:(~(greater(X2,X3))|greater(vplus(X2,X1),vplus(X3,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(52, plain,![X4]:![X5]:![X6]:(~(greater(X5,X6))|greater(vplus(X5,X4),vplus(X6,X4))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(greater(vplus(X1,X2),vplus(X3,X2))|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[52])).
% cnf(183,negated_conjecture,(~greater(vplus(vd301,vd303),vplus(vd302,vd303))),inference(split_conjunct,[status(thm)],[49])).
% cnf(270,plain,(greater(vplus(vd301,X1),vplus(vd302,X1))),inference(spm,[status(thm)],[53,50,theory(equality)])).
% cnf(2638,negated_conjecture,($false),inference(rw,[status(thm)],[183,270,theory(equality)])).
% cnf(2639,negated_conjecture,($false),inference(cn,[status(thm)],[2638,theory(equality)])).
% cnf(2640,negated_conjecture,($false),2639,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 650
% # ...of these trivial                : 25
% # ...subsumed                        : 391
% # ...remaining for further processing: 234
% # Other redundant clauses eliminated : 39
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 8
% # Backward-rewritten                 : 2
% # Generated clauses                  : 2106
% # ...of the previous two non-trivial : 1905
% # Contextual simplify-reflections    : 2
% # Paramodulations                    : 2031
% # Factorizations                     : 2
% # Equation resolutions               : 73
% # Current number of processed clauses: 218
% #    Positive orientable unit clauses: 45
% #    Positive unorientable unit clauses: 3
% #    Negative unit clauses           : 52
% #    Non-unit-clauses                : 118
% # Current number of unprocessed clauses: 1252
% # ...number of literals in the above : 2474
% # Clause-clause subsumption calls (NU) : 1515
% # Rec. Clause-clause subsumption calls : 1512
% # Unit Clause-clause subsumption calls : 169
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 85
% # Indexed BW rewrite successes       : 69
% # Backwards rewriting index:   127 leaves,   1.32+/-1.279 terms/leaf
% # Paramod-from index:           54 leaves,   1.13+/-0.387 terms/leaf
% # Paramod-into index:          113 leaves,   1.35+/-1.281 terms/leaf
% # -------------------------------------------------
% # User time              : 0.073 s
% # System time            : 0.004 s
% # Total time             : 0.077 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP14788/NUM838+1.tptp
% 
%------------------------------------------------------------------------------