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