YES
Input TRS:
      1: app(nil(),y) -> y
      2: app(add(n,x),y) -> add(n,app(x,y))
      3: reverse(nil()) -> nil()
      4: reverse(add(n,x)) -> app(reverse(x),add(n,nil()))
      5: shuffle(nil()) -> nil()
      6: shuffle(add(n,x)) -> add(n,shuffle(reverse(x)))
Number of strict rules: 6
Direct POLO(bPol) ... removes: 3 5 6
      reverse	w: x1 + 20977
      shuffle	w: 2 * x1 + 31892
      nil	w: 0
      add	w: x1 + x2 + 41955
      app	w: x1 + x2
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #app(add(n,x),y) -> #app(x,y)
     #2: #reverse(add(n,x)) -> #app(reverse(x),add(n,nil()))
     #3: #reverse(add(n,x)) -> #reverse(x)
Number of SCCs: 2, DPs: 2
  SCC { #3 }
POLO(Sum)... succeeded.
      #reverse	w: x1
      reverse	w: 0
      shuffle	w: 0
      nil	w: 0
      #app	w: 0
      add	w: x2 + 1
      app	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... succeeded.
      #reverse	w: 0
      reverse	w: 0
      shuffle	w: 0
      nil	w: 0
      #app	w: x1
      add	w: x2 + 1
      app	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0