YES

We show the termination of the TRS R:

  a(b(x)) -> a(c(b(x)))

-- SCC decomposition.

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

p1: a#(b(x)) -> a#(c(b(x)))

and R consists of:

r1: a(b(x)) -> a(c(b(x)))

The estimated dependency graph contains the following SCCs:

  (no SCCs)