DependencySet ds1 = entry.getValue();
boolean allIndependent = isIndependent && ds1.isIndependent() && ds2.isIndependent();
if( allIndependent ) {
if( log.isLoggable( Level.FINE ) )
log.fine( roots[root] + " has " + c + " " + roots[otherRoot]
+ " has negation " + ds1.max() + " " + ds2.max() );
return Bool.FALSE;
}
else {
if( log.isLoggable( Level.FINE ) )
log.fine( roots[root] + " has " + c + " " + roots[otherRoot]