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

WORST_CASE(?,O(n^1))