WORST_CASE(?,O(n^2))
* Step 1: NaturalMI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            a__first(X1,X2) -> first(X1,X2)
            a__first(0(),X) -> nil()
            a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z))
            a__from(X) -> cons(mark(X),from(s(X)))
            a__from(X) -> from(X)
            mark(0()) -> 0()
            mark(cons(X1,X2)) -> cons(mark(X1),X2)
            mark(first(X1,X2)) -> a__first(mark(X1),mark(X2))
            mark(from(X)) -> a__from(mark(X))
            mark(nil()) -> nil()
            mark(s(X)) -> s(mark(X))
        - Signature:
            {a__first/2,a__from/1,mark/1} / {0/0,cons/2,first/2,from/1,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a__first,a__from,mark} and constructors {0,cons,first
            ,from,nil,s}
    + Applied Processor:
        NaturalMI {miDimension = 2, miDegree = 2, 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(a__first) = {1,2},
          uargs(a__from) = {1},
          uargs(cons) = {1},
          uargs(s) = {1}
        
        Following symbols are considered usable:
          {a__first,a__from,mark}
        TcT has computed the following interpretation:
                 p(0) = [0]                      
                        [0]                      
          p(a__first) = [1 4] x1 + [1 4] x2 + [2]
                        [0 1]      [0 1]      [2]
           p(a__from) = [1 4] x1 + [5]           
                        [0 1]      [2]           
              p(cons) = [1 0] x1 + [0]           
                        [0 1]      [1]           
             p(first) = [1 4] x1 + [1 4] x2 + [0]
                        [0 1]      [0 1]      [2]
              p(from) = [1 4] x1 + [0]           
                        [0 1]      [2]           
              p(mark) = [1 4] x1 + [4]           
                        [0 1]      [0]           
               p(nil) = [0]                      
                        [1]                      
                 p(s) = [1 0] x1 + [0]           
                        [0 1]      [1]           
        
        Following rules are strictly oriented:
                 a__first(X1,X2) = [1 4] X1 + [1 4] X2 + [2]  
                                   [0 1]      [0 1]      [2]  
                                 > [1 4] X1 + [1 4] X2 + [0]  
                                   [0 1]      [0 1]      [2]  
                                 = first(X1,X2)               
        
                 a__first(0(),X) = [1 4] X + [2]              
                                   [0 1]     [2]              
                                 > [0]                        
                                   [1]                        
                                 = nil()                      
        
        a__first(s(X),cons(Y,Z)) = [1 4] X + [1 4] Y + [10]   
                                   [0 1]     [0 1]     [4]    
                                 > [1 4] Y + [4]              
                                   [0 1]     [1]              
                                 = cons(mark(Y),first(X,Z))   
        
                      a__from(X) = [1 4] X + [5]              
                                   [0 1]     [2]              
                                 > [1 4] X + [4]              
                                   [0 1]     [1]              
                                 = cons(mark(X),from(s(X)))   
        
                      a__from(X) = [1 4] X + [5]              
                                   [0 1]     [2]              
                                 > [1 4] X + [0]              
                                   [0 1]     [2]              
                                 = from(X)                    
        
                       mark(0()) = [4]                        
                                   [0]                        
                                 > [0]                        
                                   [0]                        
                                 = 0()                        
        
               mark(cons(X1,X2)) = [1 4] X1 + [8]             
                                   [0 1]      [1]             
                                 > [1 4] X1 + [4]             
                                   [0 1]      [1]             
                                 = cons(mark(X1),X2)          
        
              mark(first(X1,X2)) = [1 8] X1 + [1 8] X2 + [12] 
                                   [0 1]      [0 1]      [2]  
                                 > [1 8] X1 + [1 8] X2 + [10] 
                                   [0 1]      [0 1]      [2]  
                                 = a__first(mark(X1),mark(X2))
        
                   mark(from(X)) = [1 8] X + [12]             
                                   [0 1]     [2]              
                                 > [1 8] X + [9]              
                                   [0 1]     [2]              
                                 = a__from(mark(X))           
        
                     mark(nil()) = [8]                        
                                   [1]                        
                                 > [0]                        
                                   [1]                        
                                 = nil()                      
        
                      mark(s(X)) = [1 4] X + [8]              
                                   [0 1]     [1]              
                                 > [1 4] X + [4]              
                                   [0 1]     [1]              
                                 = s(mark(X))                 
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^2))