YES

Problem:
 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

Proof:
 DP Processor:
  DPs:
   fst#(s(X),cons(Y,Z)) -> activate#(Z)
   fst#(s(X),cons(Y,Z)) -> activate#(X)
   add#(s(X),Y) -> activate#(X)
   add#(s(X),Y) -> s#(n__add(activate(X),Y))
   len#(cons(X,Z)) -> activate#(Z)
   len#(cons(X,Z)) -> s#(n__len(activate(Z)))
   activate#(n__fst(X1,X2)) -> activate#(X2)
   activate#(n__fst(X1,X2)) -> activate#(X1)
   activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2))
   activate#(n__from(X)) -> activate#(X)
   activate#(n__from(X)) -> from#(activate(X))
   activate#(n__s(X)) -> s#(X)
   activate#(n__add(X1,X2)) -> activate#(X2)
   activate#(n__add(X1,X2)) -> activate#(X1)
   activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2))
   activate#(n__len(X)) -> activate#(X)
   activate#(n__len(X)) -> len#(activate(X))
  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
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [len#](x0) = x0 + 2,
    
    [s#](x0) = 0,
    
    [add#](x0, x1) = 2x0 + x1 + 2,
    
    [from#](x0) = 1,
    
    [activate#](x0) = x0 + 1,
    
    [fst#](x0, x1) = 2x0 + x1 + 2,
    
    [n__len](x0) = 2x0 + 2,
    
    [len](x0) = 2x0 + 2,
    
    [n__add](x0, x1) = 2x0 + x1 + 2,
    
    [add](x0, x1) = 2x0 + x1 + 2,
    
    [n__from](x0) = 2x0 + 1,
    
    [n__s](x0) = x0,
    
    [from](x0) = 2x0 + 1,
    
    [n__fst](x0, x1) = 3x0 + x1 + 7,
    
    [activate](x0) = x0,
    
    [cons](x0, x1) = x1,
    
    [s](x0) = x0,
    
    [nil] = 1,
    
    [fst](x0, x1) = 3x0 + x1 + 7,
    
    [0] = 1
   orientation:
    fst#(s(X),cons(Y,Z)) = 2X + Z + 2 >= Z + 1 = activate#(Z)
    
    fst#(s(X),cons(Y,Z)) = 2X + Z + 2 >= X + 1 = activate#(X)
    
    add#(s(X),Y) = 2X + Y + 2 >= X + 1 = activate#(X)
    
    add#(s(X),Y) = 2X + Y + 2 >= 0 = s#(n__add(activate(X),Y))
    
    len#(cons(X,Z)) = Z + 2 >= Z + 1 = activate#(Z)
    
    len#(cons(X,Z)) = Z + 2 >= 0 = s#(n__len(activate(Z)))
    
    activate#(n__fst(X1,X2)) = 3X1 + X2 + 8 >= X2 + 1 = activate#(X2)
    
    activate#(n__fst(X1,X2)) = 3X1 + X2 + 8 >= X1 + 1 = activate#(X1)
    
    activate#(n__fst(X1,X2)) = 3X1 + X2 + 8 >= 2X1 + X2 + 2 = fst#(activate(X1),activate(X2))
    
    activate#(n__from(X)) = 2X + 2 >= X + 1 = activate#(X)
    
    activate#(n__from(X)) = 2X + 2 >= 1 = from#(activate(X))
    
    activate#(n__s(X)) = X + 1 >= 0 = s#(X)
    
    activate#(n__add(X1,X2)) = 2X1 + X2 + 3 >= X2 + 1 = activate#(X2)
    
    activate#(n__add(X1,X2)) = 2X1 + X2 + 3 >= X1 + 1 = activate#(X1)
    
    activate#(n__add(X1,X2)) = 2X1 + X2 + 3 >= 2X1 + X2 + 2 = add#(activate(X1),activate(X2))
    
    activate#(n__len(X)) = 2X + 3 >= X + 1 = activate#(X)
    
    activate#(n__len(X)) = 2X + 3 >= X + 2 = len#(activate(X))
    
    fst(0(),Z) = Z + 10 >= 1 = nil()
    
    fst(s(X),cons(Y,Z)) = 3X + Z + 7 >= 3X + Z + 7 = cons(Y,n__fst(activate(X),activate(Z)))
    
    from(X) = 2X + 1 >= 2X + 1 = cons(X,n__from(n__s(X)))
    
    add(0(),X) = X + 4 >= X = X
    
    add(s(X),Y) = 2X + Y + 2 >= 2X + Y + 2 = s(n__add(activate(X),Y))
    
    len(nil()) = 4 >= 1 = 0()
    
    len(cons(X,Z)) = 2Z + 2 >= 2Z + 2 = s(n__len(activate(Z)))
    
    fst(X1,X2) = 3X1 + X2 + 7 >= 3X1 + X2 + 7 = n__fst(X1,X2)
    
    from(X) = 2X + 1 >= 2X + 1 = n__from(X)
    
    s(X) = X >= X = n__s(X)
    
    add(X1,X2) = 2X1 + X2 + 2 >= 2X1 + X2 + 2 = n__add(X1,X2)
    
    len(X) = 2X + 2 >= 2X + 2 = n__len(X)
    
    activate(n__fst(X1,X2)) = 3X1 + X2 + 7 >= 3X1 + X2 + 7 = fst(activate(X1),activate(X2))
    
    activate(n__from(X)) = 2X + 1 >= 2X + 1 = from(activate(X))
    
    activate(n__s(X)) = X >= X = s(X)
    
    activate(n__add(X1,X2)) = 2X1 + X2 + 2 >= 2X1 + X2 + 2 = add(activate(X1),activate(X2))
    
    activate(n__len(X)) = 2X + 2 >= 2X + 2 = len(activate(X))
    
    activate(X) = X >= X = X
   problem:
    DPs:
     
    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
   Qed