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