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: L(a(a(x1))) -> L(a(b(c(x1))))
      5: c(R(x1)) -> b(a(R(x1)))
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying L
      1: b(a(a(x1))) -> a(b(c(x1)))
      2: c(a(x1)) -> a(c(x1))
      3: c(b(x1)) -> b(a(x1))
      4: L^1_a(a(x1)) -> L^1_a(b(c(x1)))
      5: c(R(x1)) -> b(a(R(x1)))
      6: L(a(_1)) ->= L^1_a(_1)
Number of strict rules: 5
Direct POLO(bPol) ... removes: 6
      a 	w: x1 + 3095
      b 	w: x1
      L^1_a	w: 2 * x1 + 9728
      c 	w: x1 + 3095
      R 	w: x1 + 1
      L 	w: 2 * x1 + 3539
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #c(a(x1)) -> #c(x1)
     #2: #c(R(x1)) -> #b(a(R(x1)))
     #3: #c(b(x1)) -> #b(a(x1))
     #4: #b(a(a(x1))) -> #b(c(x1))
     #5: #b(a(a(x1))) -> #c(x1)
     #6: #L^1_a(a(x1)) -> #L^1_a(b(c(x1)))
     #7: #L^1_a(a(x1)) -> #b(c(x1))
     #8: #L^1_a(a(x1)) -> #c(x1)
Number of SCCs: 2, DPs: 5
  SCC { #6 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: max(x1 + 64576, 0)
      b 	w: max(x1 - 32287, 0)
      L^1_a	w: 0
      c 	w: max(x1 + 64576, 0)
      R 	w: max(x1 - 32288, 0)
      L 	w: 0
      #c 	w: 0
      #L^1_a	w: max(x1 - 32290, 0)
      #b 	w: 0
    USABLE RULES: { 1..3 5 }
    Removed DPs: #6
Number of SCCs: 1, DPs: 4
  SCC { #1 #3..5 }
POLO(Sum)... succeeded.
      a 	w: x1 + 10452
      b 	w: x1
      L^1_a	w: 0
      c 	w: x1 + 10452
      R 	w: 1
      L 	w: 0
      #c 	w: x1 + 10453
      #L^1_a	w: 0
      #b 	w: x1
    USABLE RULES: { 1..3 5 }
    Removed DPs: #1 #3..5
Number of SCCs: 0, DPs: 0