WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(a(),a()) -> f(a(),b())
            f(a(),b()) -> f(s(a()),c())
            f(c(),c()) -> f(a(),a())
            f(s(X),c()) -> f(X,c())
        - Signature:
            {f/2} / {a/0,b/0,c/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {a,b,c,s}
    + Applied Processor:
        NaturalMI {miDimension = 2, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation (containing no more than 1 non-zero interpretation-entries in the diagonal of the component-wise maxima):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {f}
        TcT has computed the following interpretation:
          p(a) = [0]                      
                 [8]                      
          p(b) = [0]                      
                 [2]                      
          p(c) = [10]                     
                 [0]                      
          p(f) = [1 0] x1 + [0 1] x2 + [2]
                 [0 0]      [0 0]      [2]
          p(s) = [1 0] x1 + [1]           
                 [0 0]      [0]           
        
        Following rules are strictly oriented:
         f(a(),a()) = [10]         
                      [2]          
                    > [4]          
                      [2]          
                    = f(a(),b())   
        
         f(a(),b()) = [4]          
                      [2]          
                    > [3]          
                      [2]          
                    = f(s(a()),c())
        
         f(c(),c()) = [12]         
                      [2]          
                    > [10]         
                      [2]          
                    = f(a(),a())   
        
        f(s(X),c()) = [1 0] X + [3]
                      [0 0]     [2]
                    > [1 0] X + [2]
                      [0 0]     [2]
                    = f(X,c())     
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))