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