YES
Input TRS:
      1: fst(0(),Z) -> nil()
      2: fst(s(),cons(Y)) -> cons(Y)
      3: from(X) -> cons(X)
      4: add(0(),X) -> X
      5: add(s(),Y) -> s()
      6: len(nil()) -> 0()
      7: len(cons(X)) -> s()
Number of strict rules: 7
Direct POLO(bPol) ... removes: 4 1 3 5 7 6 2
      s 	w: 1
      fst	w: 2 * x1 + 2 * x2 + 7719
      0 	w: 1
      from	w: 2 * x1 + 2
      nil	w: 7720
      cons	w: x1 + 1
      add	w: 2 * x1 + x2 + 1
      len	w: 2 * x1
Number of strict rules: 0