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