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