WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a(b(x)) -> a(c(b(x)))
        - Signature:
            {a/1} / {b/1,c/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a} and constructors {b,c}
    + 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:
          {a}
        TcT has computed the following interpretation:
          p(a) = [14] x1 + [2]
          p(b) = [1] x1 + [1] 
          p(c) = [0]          
        
        Following rules are strictly oriented:
        a(b(x)) = [14] x + [16]
                > [2]          
                = a(c(b(x)))   
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))