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