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