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