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