YES
Input TRS:
      1: b(c(x1)) -> c(b(x1))
      2: c(b(x1)) -> a(a(a(x1)))
      3: a(a(a(a(x1)))) -> b(c(x1))
Number of strict rules: 3
Direct POLO(bPol) ... removes: 3 2
      a 	w: x1 + 2
      b 	w: x1 + 6
      c 	w: x1 + 1
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #b(c(x1)) -> #b(x1)
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... succeeded.
      a 	w: 0
      b 	w: 0
      c 	w: x1 + 1
      #b 	w: x1
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0