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