YES
Input TRS:
      1: a(a(x1)) -> d(c(x1))
      2: a(b(x1)) -> c(c(c(x1)))
      3: b(b(x1)) -> a(c(c(x1)))
      4: c(c(x1)) -> b(x1)
      5: c(d(x1)) -> a(a(x1))
      6: d(d(x1)) -> b(a(c(x1)))
Number of strict rules: 6
Direct POLO(bPol) ... removes: 4 3 6 2
      a 	w: x1 + 17
      d 	w: x1 + 24
      b 	w: x1 + 19
      c 	w: x1 + 10
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #c(d(x1)) -> #a(a(x1))
     #2: #c(d(x1)) -> #a(x1)
     #3: #a(a(x1)) -> #c(x1)
Number of SCCs: 1, DPs: 3
  SCC { #1..3 }
POLO(Sum)... succeeded.
      a 	w: x1 + 8857
      d 	w: x1 + 2
      b 	w: 0
      c 	w: x1 + 17712
      #c 	w: x1 + 8856
      #a 	w: x1
    USABLE RULES: { 1 5 }
    Removed DPs: #1..3
Number of SCCs: 0, DPs: 0