YES

We show the termination of the TRS R:

  f(f(x)) -> g(f(x))

-- SCC decomposition.

Consider the dependency pair problem (P, R), where P consists of

  (no rules)

and R consists of:

r1: f(f(x)) -> g(f(x))

The estimated dependency graph contains the following SCCs:

  (no SCCs)