YES

Problem:
 first(0(),X) -> nil()
 first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
 from(X) -> cons(X,n__from(s(X)))
 first(X1,X2) -> n__first(X1,X2)
 from(X) -> n__from(X)
 activate(n__first(X1,X2)) -> first(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [n__from](x0) = x0 + 1,
   
   [from](x0) = 3x0 + 5,
   
   [n__first](x0, x1) = x0 + x1 + 2,
   
   [activate](x0) = 3x0 + 2,
   
   [cons](x0, x1) = 2x0 + x1 + 4,
   
   [s](x0) = x0,
   
   [nil] = 0,
   
   [first](x0, x1) = 3x0 + 3x1 + 3,
   
   [0] = 0
  orientation:
   first(0(),X) = 3X + 3 >= 0 = nil()
   
   first(s(X),cons(Y,Z)) = 3X + 6Y + 3Z + 15 >= X + 2Y + 3Z + 8 = cons(Y,n__first(X,activate(Z)))
   
   from(X) = 3X + 5 >= 3X + 5 = cons(X,n__from(s(X)))
   
   first(X1,X2) = 3X1 + 3X2 + 3 >= X1 + X2 + 2 = n__first(X1,X2)
   
   from(X) = 3X + 5 >= X + 1 = n__from(X)
   
   activate(n__first(X1,X2)) = 3X1 + 3X2 + 8 >= 3X1 + 3X2 + 3 = first(X1,X2)
   
   activate(n__from(X)) = 3X + 5 >= 3X + 5 = from(X)
   
   activate(X) = 3X + 2 >= X = X
  problem:
   from(X) -> cons(X,n__from(s(X)))
   activate(n__from(X)) -> from(X)
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [n__from](x0) = x0,
    
    [from](x0) = 3x0,
    
    [activate](x0) = 4x0 + 1,
    
    [cons](x0, x1) = x0 + 2x1,
    
    [s](x0) = x0
   orientation:
    from(X) = 3X >= 3X = cons(X,n__from(s(X)))
    
    activate(n__from(X)) = 4X + 1 >= 3X = from(X)
   problem:
    from(X) -> cons(X,n__from(s(X)))
   Matrix Interpretation Processor: dim=1
    
    interpretation:
     [n__from](x0) = 2x0,
     
     [from](x0) = 5x0 + 4,
     
     [cons](x0, x1) = x0 + x1,
     
     [s](x0) = 2x0
    orientation:
     from(X) = 5X + 4 >= 5X = cons(X,n__from(s(X)))
    problem:
     
    Qed