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