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