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