Consider the TRS R consisting of the rewrite rules

1: f(a) -> f(b)
2: g(b) -> g(a)

There are 2 dependency pairs:

3: F(a) -> F(b)
4: G(b) -> G(a)

The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.