WORST_CASE(?,O(n^2))
* Step 1: MI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            f(x,c(y)) -> f(x,s(f(y,y)))
            f(s(x),s(y)) -> f(x,s(c(s(y))))
        - Signature:
            {f/2} / {c/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {c,s}
    + Applied Processor:
        MI {miKind = Automaton Nothing, miDimension = 2, miUArgs = NoUArgs, miURules = NoURules, miSelector = Nothing}
    + Details:
        We apply a matrix interpretation of kind Automaton Nothing:
        
        
        Following symbols are considered usable:
          all
        TcT has computed the following interpretation:
          p(c) = [1 0] x_1 + [0]            
                 [1 1]       [7]            
          p(f) = [2 0] x_1 + [1 2] x_2 + [0]
                 [0 0]       [0 0]       [4]
          p(s) = [1 0] x_1 + [4]            
                 [0 0]       [1]            
        
        Following rules are strictly oriented:
           f(x,c(y)) = [2 0] x + [3 2] y + [14]
                       [0 0]     [0 0]     [4] 
                     > [2 0] x + [3 2] y + [6] 
                       [0 0]     [0 0]     [4] 
                     = f(x,s(f(y,y)))          
        
        f(s(x),s(y)) = [2 0] x + [1 0] y + [14]
                       [0 0]     [0 0]     [4] 
                     > [2 0] x + [1 0] y + [10]
                       [0 0]     [0 0]     [4] 
                     = f(x,s(c(s(y))))         
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^2))