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