WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a__c() -> a__f(g(c()))
            a__c() -> c()
            a__f(X) -> f(X)
            a__f(g(X)) -> g(X)
            mark(c()) -> a__c()
            mark(f(X)) -> a__f(X)
            mark(g(X)) -> g(X)
        - Signature:
            {a__c/0,a__f/1,mark/1} / {c/0,f/1,g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a__c,a__f,mark} and constructors {c,f,g}
    + Applied Processor:
        NaturalPI {shape = StronglyLinear, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(stronglyLinear):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {a__c,a__f,mark}
        TcT has computed the following interpretation:
          p(a__c) = 10     
          p(a__f) = 3 + x1 
             p(c) = 9      
             p(f) = 1 + x1 
             p(g) = 2      
          p(mark) = 15 + x1
        
        Following rules are strictly oriented:
            a__c() = 10          
                   > 5           
                   = a__f(g(c()))
        
            a__c() = 10          
                   > 9           
                   = c()         
        
           a__f(X) = 3 + X       
                   > 1 + X       
                   = f(X)        
        
        a__f(g(X)) = 5           
                   > 2           
                   = g(X)        
        
         mark(c()) = 24          
                   > 10          
                   = a__c()      
        
        mark(f(X)) = 16 + X      
                   > 3 + X       
                   = a__f(X)     
        
        mark(g(X)) = 17          
                   > 2           
                   = g(X)        
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))