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