%------------------------------------------------------------------------------
% File     : DCTP---1.31
% Problem  : MSC006-1 : 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 : Sat Dec  4 10:30:00 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 MSC006-1.oldtptp on host art02.cs.miami.edu
% starting preprocessing loop for 6 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% problem statistics for file /tmp/SystemOnTPTP4513/MSC006-1.oldtptp
%   	Syntax :	Number of clauses :	6 ( 1 non-Horn; 2 unit)
%   			Number of literals :	12 ( 0 equality)
%   			Maximal clause size :	3
%   			Number of predicates :	2 ( 0 propositional; 2-2 arity)
%   			Number of functors :	4 ( 4 constant; 0-0 arity)
%   			Number of variables :	10 ( 0 singleton)
%   			Maximal term depth :	1
% Starting proof
% **************** Exit status is success (PROOF found in 0.0 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path:        6
% Linking steps (succ/fail):  15 / 4
% Twin-clause inferences:     2
% Eager eliminations:         0
% Rewrites (subgoal/path):    0 / 0
% GR-closures total/c-foldup: 10 / 0
% Links generated/deleted:    28 / 19
% Links sweeped vector/all:   0(0) / 0(0)
% Clauses in tableau/pruned:  17 / 12
% Regularity/Tautology fails: 0 / 2 (0)
% Renamings/Contractions:     4 / 0
% Variants deleted/subsumed:  4 / 1
% Clauses by splitting:       0
% Variant subsumption tests:  1
% Fails ful/mat/sig/len:      0 / 0 / 0 / 0
% Pre subsumption tests:      20
% Subsumed unit/path/back:    13 / 0 / 4
% Coupled eliminations:       0
% Simplifications/lemmas:     12 / 8 (0)
% Foldups root/context:       1 / 4
% Maximum term depth/compl:   1 / 2
% Relevance vectors:          34
% Unifications/failed:        0 / 0
% Maximum tableau depth:      10
% 
%------------------------------------------------------------------------------