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