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