YES

We show the termination of the TRS R:

  f(f(X)) -> c()
  c() -> d()
  h(X) -> c()

-- SCC decomposition.

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

p1: f#(f(X)) -> c#()
p2: h#(X) -> c#()

and R consists of:

r1: f(f(X)) -> c()
r2: c() -> d()
r3: h(X) -> c()

The estimated dependency graph contains the following SCCs:

  (no SCCs)