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