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