YES
Input TRS:
      1: f(0(x1)) -> s(0(x1))
      2: d(0(x1)) -> 0(x1)
      3: d(s(x1)) -> s(s(d(x1)))
      4: f(s(x1)) -> d(f(x1))
Number of strict rules: 4
Direct POLO(bPol) ... removes: 1
      d 	w: x1
      s 	w: x1
      f 	w: x1 + 11387
      0 	w: x1 + 10451
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #d(s(x1)) -> #d(x1)
     #2: #f(s(x1)) -> #d(f(x1))
     #3: #f(s(x1)) -> #f(x1)
Number of SCCs: 2, DPs: 2
  SCC { #3 }
POLO(Sum)... succeeded.
      d 	w: 0
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 0
      #d 	w: 0
      #f 	w: x1
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... succeeded.
      d 	w: 0
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 0
      #d 	w: x1
      #f 	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0