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