Consider the TRS R consisting of the rewrite rule

1: f(X) -> g

There are no dependency pairs.
Hence the TRS is trivially terminating.