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