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