Consider the TRS R consisting of the rewrite rules

1: f(x,y) -> h(x,y)
2: f(x,y) -> h(y,x)
3: h(x,x) -> x

There are 2 dependency pairs:

4: F(x,y) -> H(x,y)
5: F(x,y) -> H(y,x)

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