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