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