MAYBE
Input TRS:
      1: a(x1) -> b(c(b(x1)))
      2: a(b(x1)) -> x1
      3: c(c(b(x1))) -> a(c(c(x1)))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying c
      1: a(x1) -> b(c^1_b(x1))
      2: a(b(x1)) -> x1
      3: c^2_b(x1) -> a(c(c(x1)))
      4: c(b(_1)) ->= c^1_b(_1)
      5: c(c^1_b(_1)) ->= c^2_b(_1)
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #c(c^1_b(_1)) ->? #c^2_b(_1)
     #2: #c^2_b(x1) -> #a(c(c(x1)))
     #3: #c^2_b(x1) -> #c(c(x1))
     #4: #c^2_b(x1) -> #c(x1)
Number of SCCs: 1, DPs: 3
  SCC { #1 #3 #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.