We show that it is decidable for any given ground term rewrite systems and if there is a ground term rewrite system such that . If the answer is yes, then we can effectively construct such a ground term rewrite system . In other words, for any given finitely generated congruences and over the...