YES

TRS:

  fst(0(),Z) -> nil()
  fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z)))
  from(X) -> cons(X,n__from(n__s(X)))
  add(0(),X) -> X
  add(s(X),Y) -> s(n__add(activate(X),Y))
  len(nil()) -> 0()
  len(cons(X,Z)) -> s(n__len(activate(Z)))
  fst(X1,X2) -> n__fst(X1,X2)
  from(X) -> n__from(X)
  s(X) -> n__s(X)
  add(X1,X2) -> n__add(X1,X2)
  len(X) -> n__len(X)
  activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2))
  activate(n__from(X)) -> from(activate(X))
  activate(n__s(X)) -> s(X)
  activate(n__add(X1,X2)) -> add(activate(X1),activate(X2))
  activate(n__len(X)) -> len(activate(X))
  activate(X) -> X

max/plus interpretations on N:

  fst_A(x1,x2) = max{15, 10 + x1, 13 + x2}
  fst#_A(x1,x2) = max{15, 10 + x1, 13 + x2}
  0_A = 0
  0#_A = 0
  nil_A = 1
  nil#_A = 1
  s_A(x1) = max{4, x1}
  s#_A(x1) = max{4, x1}
  cons_A(x1,x2) = max{9, 3 + x1, x2}
  cons#_A(x1,x2) = max{9, 3 + x1, x2}
  n__fst_A(x1,x2) = max{15, 10 + x1, 13 + x2}
  n__fst#_A(x1,x2) = max{15, 10 + x1, 13 + x2}
  activate_A(x1) = max{0, x1}
  activate#_A(x1) = max{0, x1}
  from_A(x1) = max{9, 5 + x1}
  from#_A(x1) = max{9, 5 + x1}
  n__from_A(x1) = max{9, 5 + x1}
  n__from#_A(x1) = max{9, 5 + x1}
  n__s_A(x1) = max{4, x1}
  n__s#_A(x1) = max{4, x1}
  add_A(x1,x2) = max{5, 5 + x1, x2}
  add#_A(x1,x2) = max{5, 5 + x1, x2}
  n__add_A(x1,x2) = max{0, 5 + x1, x2}
  n__add#_A(x1,x2) = max{0, 5 + x1, x2}
  len_A(x1) = max{8, 8 + x1}
  len#_A(x1) = max{8, 8 + x1}
  n__len_A(x1) = max{2, 8 + x1}
  n__len#_A(x1) = max{2, 8 + x1}

precedence:

  nil = activate = len > fst = 0 = from = add > cons = n__fst = n__from = n__add > s = n__len > n__s