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