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