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

% Computer : art04.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 : Sat Dec  4 10:50:58 EST 2010

% Result   : Satisfiable 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 NLP137-1.oldtptp on host art04.cs.miami.edu
% starting preprocessing loop for 60 clauses
% starting preprocessing loop for 60 clauses
% starting preprocessing loop for 58 clauses
% starting preprocessing loop for 56 clauses
% starting preprocessing loop for 55 clauses
% starting preprocessing loop for 54 clauses
% starting preprocessing loop for 52 clauses
% starting preprocessing loop for 51 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% problem statistics for file /tmp/SystemOnTPTP10107/NLP137-1.oldtptp
%   	Syntax :	Number of clauses :	51 ( 24 non-Horn; 2 unit)
%   			Number of literals :	187 ( 0 equality)
%   			Maximal clause size :	23
%   			Number of predicates :	25 ( 1 propositional; 0-3 arity)
%   			Number of functors :	18 ( 13 constant; 0-2 arity)
%   			Number of variables :	40 ( 1 singleton)
%   			Maximal term depth :	2
% Starting proof
% Saturation state reached.
% !!!!!!!!!!!!!!!! Exit status is success (MODEL found in 0.01 seconds) !!!!!!!!!!!!!!!!
% Proof search statistics:
% ========================
% Length initial path:        51
% Linking steps (succ/fail):  31 / 373
% Twin-clause inferences:     5
% Eager eliminations:         0
% Rewrites (subgoal/path):    0 / 0
% GR-closures total/c-foldup: 92 / 0
% Links generated/deleted:    404 / 33
% Links sweeped vector/all:   0(0) / 0(0)
% Clauses in tableau/pruned:  36 / 0
% Regularity/Tautology fails: 346 / 3 (0)
% Renamings/Contractions:     22 / 1
% Variants deleted/subsumed:  29 / 0
% Clauses by splitting:       0
% Variant subsumption tests:  2
% Fails ful/mat/sig/len:      0 / 2 / 0 / 0
% Pre subsumption tests:      22704
% Subsumed unit/path/back:    16 / 0 / 0
% Coupled eliminations:       366
% Simplifications/lemmas:     1 / 0 (0)
% Foldups root/context:       0 / 0
% Maximum term depth/compl:   3 / 7
% Relevance vectors:          131
% Unifications/failed:        0 / 0
% Maximum tableau depth:      35
% Killed 1 orphans
% 
%------------------------------------------------------------------------------