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