TSTP Solution File: SWV263-1 by DCTP---1.31

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : DCTP---1.31
% Problem  : SWV263-1 : TPTP v5.0.0. Released v3.2.0.
% Transfm  : none
% Format   : oldtptp
% Command  : dctp-wrapper -negpref -complexity -fullrewrite -alternate -resisol %s

% Computer : art05.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 : Sun Dec  5 02:02:38 EST 2010

% Result   : Unsatisfiable 0.00s
% Output   : Assurance 0.00s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% running dctp on problem file SWV263-1.oldtptp on host art05.cs.miami.edu
% starting preprocessing loop for 1355 clauses
% starting preprocessing loop for 1353 clauses
% starting preprocessing loop for 1352 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% problem statistics for file /tmp/SystemOnTPTP16194/SWV263-1.oldtptp
%   	Syntax :	Number of clauses :	1352 ( 28 non-Horn; 197 unit)
%   			Number of literals :	2569 ( 198 equality)
%   			Maximal clause size :	4
%   			Number of predicates :	82 ( 0 propositional; 1-3 arity)
%   			Number of functors :	135 ( 23 constant; 0-6 arity)
%   			Number of variables :	1903 ( 193 singleton)
%   			Maximal term depth :	4
% Starting proof
% **************** Exit status is success (PROOF found in 0.23 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path:        1352
% Linking steps (succ/fail):  11 / 6
% Eq-linkings (succ/fail):  0 / 1
% Reflexivities (succ/fail):  0 / 0
% E-variants/Order viol.:     0 / 0
% Twin-clause inferences:     0
% Eager eliminations:         0
% Rewrites (subgoal/path):    1 / 0
% GR-closures total/c-foldup: 0 / 0
% Links non-eq/eq:            1117 / 40(0)
% Links sweeped vector/all:   0(0) / 0(0)
% Clauses in tableau/pruned:  11 / 10
% Tautology fails:            1
% Renamings/Contractions:     10 / 0
% Variants deleted/subsumed:  0 / 0
% Clauses by splitting:       0
% Variant subsumption tests:  0
% Fails ful/mat/sig/len:      0 / 0 / 0 / 0
% Subsumed unit/path/back:    637 / 0 / 0
% Coupled eliminations:       1
% Simplifications/lemmas:     14 / 7 (0)
% Foldups root/context:       0 / 0
% Maximum term depth/compl:   8 / 115
% Relevance vectors:          208
% Unifications/failed:        0 / 0
% Maximum tableau depth:      9
% Killed 1 orphans
% 
%------------------------------------------------------------------------------