WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__f(X)) -> f(X)
            f(X) -> if(X,c(),n__f(true()))
            f(X) -> n__f(X)
            if(false(),X,Y) -> activate(Y)
            if(true(),X,Y) -> X
        - Signature:
            {activate/1,f/1,if/3} / {c/0,false/0,n__f/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,f,if} and constructors {c,false,n__f,true}
    + 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:
          none
        
        Following symbols are considered usable:
          {activate,f,if}
        TcT has computed the following interpretation:
          p(activate) = [2] x1 + [9]                  
                 p(c) = [1]                           
                 p(f) = [2] x1 + [8]                  
             p(false) = [8]                           
                p(if) = [2] x1 + [4] x2 + [4] x3 + [1]
              p(n__f) = [1] x1 + [0]                  
              p(true) = [0]                           
        
        Following rules are strictly oriented:
              activate(X) = [2] X + [9]           
                          > [1] X + [0]           
                          = X                     
        
        activate(n__f(X)) = [2] X + [9]           
                          > [2] X + [8]           
                          = f(X)                  
        
                     f(X) = [2] X + [8]           
                          > [2] X + [5]           
                          = if(X,c(),n__f(true()))
        
                     f(X) = [2] X + [8]           
                          > [1] X + [0]           
                          = n__f(X)               
        
          if(false(),X,Y) = [4] X + [4] Y + [17]  
                          > [2] Y + [9]           
                          = activate(Y)           
        
           if(true(),X,Y) = [4] X + [4] Y + [1]   
                          > [1] X + [0]           
                          = X                     
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))