%------------------------------------------------------------------------------
% File     : DCTP---1.31
% Problem  : CAT015-4 : TPTP v5.0.0. Released v1.0.0.
% Transfm  : none
% Format   : oldtptp
% Command  : dctp-wrapper -negpref -complexity -fullrewrite -alternate -resisol %s

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Dec  3 18:28:24 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 CAT015-4.oldtptp on host art11.cs.miami.edu
% starting preprocessing loop for 13 clauses
% starting preprocessing loop for 3 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% input formula is Horn
% problem statistics for file /tmp/SystemOnTPTP9149/CAT015-4.oldtptp
%   	Syntax :	Number of clauses :	3 ( 0 non-Horn; 3 unit)
%   			Number of literals :	3 ( 1 equality)
%   			Maximal clause size :	1
%   			Number of predicates :	3 ( 0 propositional; 1-2 arity)
%   			Number of functors :	0 ( 0 constant; 0-0 arity)
%   			Number of variables :	5 ( 5 singleton)
%   			Maximal term depth :	3
% Starting proof
% Saturation state reached.
% !!!!!!!!!!!!!!!! Exit status is success (MODEL found in 0.0 seconds) !!!!!!!!!!!!!!!!
% Proof search statistics:
% ========================
% Length initial path:        3
% Linking steps (succ/fail):  0 / 0
% Eq-linkings (succ/fail):  0 / 0
% Reflexivities (succ/fail):  0 / 0
% E-variants/Order viol.:     0 / 0
% Twin-clause inferences:     0
% Eager eliminations:         1
% Rewrites (subgoal/path):    0 / 0
% GR-closures total/c-foldup: 0 / 0
% Links non-eq/eq:            0 / 0(0)
% Links sweeped vector/all:   0(0) / 0(0)
% Clauses in tableau/pruned:  0 / 0
% Tautology fails:            0
% Renamings/Contractions:     0 / 0
% Variants deleted/subsumed:  0 / 0
% Clauses by splitting:       0
% Variant subsumption tests:  0
% Fails ful/mat/sig/len:      0 / 0 / 0 / 0
% Pre subsumption tests:      7
% Subsumed unit/path/back:    16 / 0 / 0
% Coupled eliminations:       0
% Simplifications/lemmas:     0 / 0 (0)
% Foldups root/context:       0 / 0
% Maximum term depth/compl:   3 / 0
% Relevance vectors:          4
% Unifications/failed:        0 / 0
% Maximum tableau depth:      0
% 
%------------------------------------------------------------------------------