MAYBE
Input TRS:
      1: b(c(x1)) -> a(b(b(x1)))
      2: b(a(x1)) -> a(c(b(x1)))
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #b(a(x1)) -> #b(x1)
     #2: #b(c(x1)) -> #b(b(x1))
     #3: #b(c(x1)) -> #b(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.