%------------------------------------------------------------------------------
% File     : DCTP---1.31
% Problem  : GRP041-2 : TPTP v5.0.0. Released v1.0.0.
% Transfm  : none
% Format   : oldtptp
% Command  : dctp-wrapper -negpref -complexity -fullrewrite -alternate -resisol %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 : Fri Dec  3 23:09:39 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 GRP041-2.oldtptp on host art02.cs.miami.edu
% starting preprocessing loop for 8 clauses
% found unit link between input subgoals +product(identity,X1,X1) and -product(X1,X2,a)
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is Horn
% problem statistics for file /tmp/SystemOnTPTP12874/GRP041-2.oldtptp
%   	Syntax :	Number of clauses :	8 ( 0 non-Horn; 5 unit)
%   			Number of literals :	17 ( 0 equality)
%   			Maximal clause size :	4
%   			Number of predicates :	2 ( 0 propositional; 2-3 arity)
%   			Number of functors :	4 ( 2 constant; 0-2 arity)
%   			Number of variables :	24 ( 2 singleton)
%   			Maximal term depth :	2
% complementary unit pair generated by formula preprocessing.
% **************** Exit status is success (PROOF found in 0.0 seconds) ****************
% 
%------------------------------------------------------------------------------