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