%------------------------------------------------------------------------------
% File     : DCTP---1.31
% Problem  : GRP123-4.004 : TPTP v5.0.0. Bugfixed v1.2.1.
% 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 23:33:11 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 GRP123-4.004.oldtptp on host art11.cs.miami.edu
% starting preprocessing loop for 25 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% problem statistics for file /tmp/SystemOnTPTP26861/GRP123-4.004.oldtptp
%   	Syntax :	Number of clauses :	25 ( 3 non-Horn; 17 unit)
%   			Number of literals :	54 ( 0 equality)
%   			Maximal clause size :	6
%   			Number of predicates :	3 ( 0 propositional; 1-3 arity)
%   			Number of functors :	4 ( 4 constant; 0-0 arity)
%   			Number of variables :	31 ( 0 singleton)
%   			Maximal term depth :	1
% Starting proof
% Saturation state reached.
% !!!!!!!!!!!!!!!! Exit status is success (MODEL found in 0.02 seconds) !!!!!!!!!!!!!!!!
% Proof search statistics:
% ========================
% Length initial path:        25
% Linking steps (succ/fail):  314 / 278
% Twin-clause inferences:     0
% Eager eliminations:         0
% Rewrites (subgoal/path):    0 / 0
% GR-closures total/c-foldup: 245 / 19
% Links generated/deleted:    1102 / 1068
% Links sweeped vector/all:   0(0) / 0(0)
% Clauses in tableau/pruned:  314 / 123
% Regularity/Tautology fails: 240 / 0 (0)
% Renamings/Contractions:     0 / 0
% Variants deleted/subsumed:  0 / 38
% Clauses by splitting:       0
% Variant subsumption tests:  693
% Fails ful/mat/sig/len:      32 / 623 / 0 / 0
% Pre subsumption tests:      192
% Subsumed unit/path/back:    203 / 0 / 21
% Coupled eliminations:       3
% Simplifications/lemmas:     298 / 22 (0)
% Foldups root/context:       21 / 26
% Maximum term depth/compl:   1 / 3
% Relevance vectors:          624
% Unifications/failed:        0 / 0
% Maximum tableau depth:      164
% Killed 1 orphans
% 
%------------------------------------------------------------------------------