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