MAYBE
Input TRS:
      1: b(a(b(a(b(b(a(b(a(b(a(x1))))))))))) -> a(b(a(b(a(b(b(a(b(a(b(b(a(x1)))))))))))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying b
      1: b^1_a(b^1_a(b(b^1_a(b^1_a(b^1_a(x1)))))) -> a(b^1_a(b^1_a(b(b^1_a(b^1_a(b(b^1_a(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(b^1_a(b(b^1_a(b^1_a(b^1_a(x1)))))) -> #b^1_a(b^1_a(b(b^1_a(b^1_a(b(b^1_a(x1)))))))
     #3: #b^1_a(b^1_a(b(b^1_a(b^1_a(b^1_a(x1)))))) -> #b^1_a(b(b^1_a(b^1_a(b(b^1_a(x1))))))
     #4: #b^1_a(b^1_a(b(b^1_a(b^1_a(b^1_a(x1)))))) -> #b(b^1_a(b^1_a(b(b^1_a(x1)))))
     #5: #b^1_a(b^1_a(b(b^1_a(b^1_a(b^1_a(x1)))))) -> #b^1_a(b^1_a(b(b^1_a(x1))))
     #6: #b^1_a(b^1_a(b(b^1_a(b^1_a(b^1_a(x1)))))) -> #b^1_a(b(b^1_a(x1)))
     #7: #b^1_a(b^1_a(b(b^1_a(b^1_a(b^1_a(x1)))))) -> #b(b^1_a(x1))
Number of SCCs: 1, DPs: 7
  SCC { #1..7 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [1,1;0,0] * x1
      b 	w: [0,0;1,0] * x1 + [30850;1]
      b^1_a	w: [0,0;1,0] * x1
      #b 	w: [1,0;0,0] * x1 + [30849;0]
      #b^1_a	w: [0,1;0,0] * x1
    USABLE RULES: { 1 2 }
    Removed DPs: #1 #3 #4 #6 #7
Number of SCCs: 1, DPs: 2
  SCC { #2 #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.