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