NO

1 decompositions
 #1 -----------
   1: b() -> h(b(),c())
   2: c() -> a()
   3: a() -> f(a())
   4: b() -> c()

unjoinable peak
    h(b(),c())
*<- b() ->*
    f(a())
NOTE: input TRS is reduced

original is
   1: b() -> h(b(),c())
   2: c() -> a()
   3: a() -> f(a())
   4: b() -> c()
   5: b() -> b()

reduced to
   1: b() -> h(b(),c())
   2: c() -> a()
   3: a() -> f(a())
   4: b() -> c()