YES

We show the termination of the TRS R:

  f(g(h(x,y)),f(a(),a())) -> f(h(x,x),g(f(y,a())))

-- SCC decomposition.

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

p1: f#(g(h(x,y)),f(a(),a())) -> f#(h(x,x),g(f(y,a())))
p2: f#(g(h(x,y)),f(a(),a())) -> f#(y,a())

and R consists of:

r1: f(g(h(x,y)),f(a(),a())) -> f(h(x,x),g(f(y,a())))

The estimated dependency graph contains the following SCCs:

  (no SCCs)