We show that it is decidable for any deterministic bottom-up tree transducer and ground term rewrite system , which one of Conditions (i)-(iv) holds. (i) , (ii) , (iii) , (iv) and are incomparable. Here is the tree transformation induced by , and is the congruence generated by