YES

1 decompositions
 #0 -----------
   1: b(a(x)) -> c(c(x))
   2: c(c(x)) -> a(b(x))
   3: c(a(x)) -> c(c(x))
   4: b(c(x)) -> a(b(x))
   5: a(c(x)) -> a(b(x))
   6: c(b(x)) -> a(c(x))
   7: b(c(x)) -> b(b(x))
   8: b(b(x)) -> b(a(x))
   9: a(c(x)) -> c(a(x))

@Rule Labeling
--- R
   1: b(a(x)) -> c(c(x))
   2: c(c(x)) -> a(b(x))
   3: c(a(x)) -> c(c(x))
   4: b(c(x)) -> a(b(x))
   5: a(c(x)) -> a(b(x))
   6: c(b(x)) -> a(c(x))
   7: b(c(x)) -> b(b(x))
   8: b(b(x)) -> b(a(x))
   9: a(c(x)) -> c(a(x))

--- S
   1: b(a(x)) -> c(c(x))
   2: c(c(x)) -> a(b(x))
   3: c(a(x)) -> c(c(x))
   4: b(c(x)) -> a(b(x))
   5: a(c(x)) -> a(b(x))
   6: c(b(x)) -> a(c(x))
   7: b(c(x)) -> b(b(x))
   8: b(b(x)) -> b(a(x))
   9: a(c(x)) -> c(a(x))