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