YES

We show the termination of the TRS R:

  f(s(X),Y) -> h(s(f(h(Y),X)))

-- SCC decomposition.

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

p1: f#(s(X),Y) -> f#(h(Y),X)

and R consists of:

r1: f(s(X),Y) -> h(s(f(h(Y),X)))

The estimated dependency graph contains the following SCCs:

  (no SCCs)