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