MAYBE
Input TRS:
      1: b(b(c(a(a(a(a(a(a(x1))))))))) -> a(a(a(a(a(a(a(b(b(c(b(b(c(x1)))))))))))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying b
      1: b^2_c(a(a(a(a(a(a(x1))))))) -> a(a(a(a(a(a(a(b^2_c(b^2_c(x1)))))))))
      2: b(c(_1)) ->= b^1_c(_1)
      3: b(b^1_c(_1)) ->= b^2_c(_1)
Number of strict rules: 1
Direct POLO(bPol) ... removes: 3 2
      a 	w: x1
      b 	w: x1
      b^1_c	w: x1 + 1
      c 	w: x1 + 2
      b^2_c	w: x1
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #b^2_c(a(a(a(a(a(a(x1))))))) -> #b^2_c(b^2_c(x1))
     #2: #b^2_c(a(a(a(a(a(a(x1))))))) -> #b^2_c(x1)
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.