WORST_CASE(?,O(1))
* Step 1: NaturalMI WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            *(x,0()) -> 0()
            *(*(x,y),z) -> *(x,*(y,z))
            *(1(),y) -> y
            *(i(x),x) -> 1()
        - Signature:
            {*/2} / {0/0,1/0,i/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {*} and constructors {0,1,i}
    + 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(*) = {2}
        
        Following symbols are considered usable:
          {*}
        TcT has computed the following interpretation:
          p(*) = [2] x1 + [1] x2 + [8]
          p(0) = [8]                  
          p(1) = [4]                  
          p(i) = [9]                  
        
        Following rules are strictly oriented:
           *(x,0()) = [2] x + [16]                
                    > [8]                         
                    = 0()                         
        
        *(*(x,y),z) = [4] x + [2] y + [1] z + [24]
                    > [2] x + [2] y + [1] z + [16]
                    = *(x,*(y,z))                 
        
           *(1(),y) = [1] y + [16]                
                    > [1] y + [0]                 
                    = y                           
        
          *(i(x),x) = [1] x + [26]                
                    > [4]                         
                    = 1()                         
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(1))