YES

TRS:

  a__fst(0(),Z) -> nil()
  a__fst(s(X),cons(Y,Z)) -> cons(mark(Y),fst(X,Z))
  a__from(X) -> cons(mark(X),from(s(X)))
  a__add(0(),X) -> mark(X)
  a__add(s(X),Y) -> s(add(X,Y))
  a__len(nil()) -> 0()
  a__len(cons(X,Z)) -> s(len(Z))
  mark(fst(X1,X2)) -> a__fst(mark(X1),mark(X2))
  mark(from(X)) -> a__from(mark(X))
  mark(add(X1,X2)) -> a__add(mark(X1),mark(X2))
  mark(len(X)) -> a__len(mark(X))
  mark(0()) -> 0()
  mark(s(X)) -> s(X)
  mark(nil()) -> nil()
  mark(cons(X1,X2)) -> cons(mark(X1),X2)
  a__fst(X1,X2) -> fst(X1,X2)
  a__from(X) -> from(X)
  a__add(X1,X2) -> add(X1,X2)
  a__len(X) -> len(X)

linear polynomial interpretations on N:

  a__fst_A(x1,x2) = x1 + x2 + 4
  a__fst#_A(x1,x2) = x2 + 5
  0_A = 1
  0#_A = 0
  nil_A = 1
  nil#_A = 4
  s_A(x1) = 1
  s#_A(x1) = 0
  cons_A(x1,x2) = x1 + 1
  cons#_A(x1,x2) = 1
  mark_A(x1) = x1
  mark#_A(x1) = x1 + 2
  fst_A(x1,x2) = x1 + x2 + 4
  fst#_A(x1,x2) = 4
  a__from_A(x1) = x1 + 1
  a__from#_A(x1) = x1 + 3
  from_A(x1) = x1 + 1
  from#_A(x1) = 1
  a__add_A(x1,x2) = x1 + x2 + 2
  a__add#_A(x1,x2) = x2 + 3
  add_A(x1,x2) = x1 + x2 + 2
  add#_A(x1,x2) = 1
  a__len_A(x1) = x1
  a__len#_A(x1) = 1
  len_A(x1) = x1
  len#_A(x1) = 0

precedence:

  nil > a__fst > fst = from = a__add = len > mark > a__from = add = a__len > 0 = cons > s