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

% Computer : art01.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 : Sun Dec  5 10:47: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 SYN835-1.oldtptp on host art01.cs.miami.edu
% starting preprocessing loop for 536 clauses
% starting preprocessing loop for 394 clauses
% starting preprocessing loop for 162 clauses
% starting preprocessing loop for 132 clauses
% starting preprocessing loop for 113 clauses
% starting preprocessing loop for 105 clauses
% starting preprocessing loop for 95 clauses
% starting preprocessing loop for 94 clauses
% starting preprocessing loop for 92 clauses
% starting preprocessing loop for 91 clauses
% starting preprocessing loop for 90 clauses
% starting preprocessing loop for 88 clauses
% starting preprocessing loop for 84 clauses
% starting preprocessing loop for 84 clauses
% starting preprocessing loop for 80 clauses
% starting preprocessing loop for 73 clauses
% starting preprocessing loop for 65 clauses
% starting preprocessing loop for 61 clauses
% starting preprocessing loop for 54 clauses
% starting preprocessing loop for 48 clauses
% starting preprocessing loop for 41 clauses
% starting preprocessing loop for 37 clauses
% starting preprocessing loop for 36 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% problem statistics for file /tmp/SystemOnTPTP28866/SYN835-1.oldtptp
%   	Syntax :	Number of clauses :	36 ( 11 non-Horn; 12 unit)
%   			Number of literals :	95 ( 0 equality)
%   			Maximal clause size :	8
%   			Number of predicates :	15 ( 0 propositional; 7-19 arity)
%   			Number of functors :	14 ( 14 constant; 0-0 arity)
%   			Number of variables :	625 ( 315 singleton)
%   			Maximal term depth :	1
% Starting proof
% Saturation state reached.
% !!!!!!!!!!!!!!!! Exit status is success (MODEL found in 1.87 seconds) !!!!!!!!!!!!!!!!
% Proof search statistics:
% ========================
% Length initial path:        36
% Linking steps (succ/fail):  67 / 64
% Twin-clause inferences:     2
% Eager eliminations:         0
% Rewrites (subgoal/path):    0 / 0
% GR-closures total/c-foldup: 53 / 2
% Links generated/deleted:    132 / 107
% Links sweeped vector/all:   0(0) / 0(0)
% Clauses in tableau/pruned:  69 / 13
% Regularity/Tautology fails: 0 / 193 (0)
% Renamings/Contractions:     6 / 2871
% Variants deleted/subsumed:  90 / 26
% Clauses by splitting:       0
% Variant subsumption tests:  65
% Fails ful/mat/sig/len:      0 / 10 / 23 / 6
% Pre subsumption tests:      368047
% Subsumed unit/path/back:    273 / 0 / 4
% Coupled eliminations:       10
% Simplifications/lemmas:     37 / 12 (0)
% Foldups root/context:       2 / 3
% Maximum term depth/compl:   1 / 19
% Relevance vectors:          140
% Unifications/failed:        0 / 0
% Maximum tableau depth:      53
% Killed 1 orphans
% 
%------------------------------------------------------------------------------