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