Consider the TRS R consisting of the rewrite rule

1: a(a(x)) -> a(b(a(x)))

There is one dependency pair:

2: A(a(x)) -> A(b(a(x)))

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