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