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