WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__first(X1,X2)) -> first(X1,X2)
            activate(n__from(X)) -> from(X)
            first(X1,X2) -> n__first(X1,X2)
            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)))
            from(X) -> n__from(X)
        - Signature:
            {activate/1,first/2,from/1} / {0/0,cons/2,n__first/2,n__from/1,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,first,from} and constructors {0,cons,n__first
            ,n__from,nil,s}
    + Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation:
        The following argument positions are considered usable:
          uargs(cons) = {2},
          uargs(n__first) = {2}
        
        Following symbols are considered usable:
          {activate,first,from}
        TcT has computed the following interpretation:
                 p(0) = [8]                  
          p(activate) = [6] x1 + [8]         
              p(cons) = [1] x1 + [1] x2 + [1]
             p(first) = [6] x2 + [7]         
              p(from) = [4] x1 + [13]        
          p(n__first) = [1] x2 + [0]         
           p(n__from) = [1] x1 + [3]         
               p(nil) = [2]                  
                 p(s) = [8]                  
        
        Following rules are strictly oriented:
                      activate(X) = [6] X + [8]                    
                                  > [1] X + [0]                    
                                  = X                              
        
        activate(n__first(X1,X2)) = [6] X2 + [8]                   
                                  > [6] X2 + [7]                   
                                  = first(X1,X2)                   
        
             activate(n__from(X)) = [6] X + [26]                   
                                  > [4] X + [13]                   
                                  = from(X)                        
        
                     first(X1,X2) = [6] X2 + [7]                   
                                  > [1] X2 + [0]                   
                                  = n__first(X1,X2)                
        
                     first(0(),X) = [6] X + [7]                    
                                  > [2]                            
                                  = nil()                          
        
            first(s(X),cons(Y,Z)) = [6] Y + [6] Z + [13]           
                                  > [1] Y + [6] Z + [9]            
                                  = cons(Y,n__first(X,activate(Z)))
        
                          from(X) = [4] X + [13]                   
                                  > [1] X + [12]                   
                                  = cons(X,n__from(s(X)))          
        
                          from(X) = [4] X + [13]                   
                                  > [1] X + [3]                    
                                  = n__from(X)                     
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))