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