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