WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a__c(X) -> c(X)
            a__c(X) -> d(X)
            a__f(X) -> f(X)
            a__f(f(X)) -> a__c(f(g(f(X))))
            a__h(X) -> a__c(d(X))
            a__h(X) -> h(X)
            mark(c(X)) -> a__c(X)
            mark(d(X)) -> d(X)
            mark(f(X)) -> a__f(mark(X))
            mark(g(X)) -> g(X)
            mark(h(X)) -> a__h(mark(X))
        - Signature:
            {a__c/1,a__f/1,a__h/1,mark/1} / {c/1,d/1,f/1,g/1,h/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a__c,a__f,a__h,mark} and constructors {c,d,f,g,h}
    + Applied Processor:
        NaturalPI {shape = Linear, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          uargs(a__f) = {1},
          uargs(a__h) = {1}
        
        Following symbols are considered usable:
          {a__c,a__f,a__h,mark}
        TcT has computed the following interpretation:
          p(a__c) = 3       
          p(a__f) = 13 + x1 
          p(a__h) = 7 + x1  
             p(c) = 2       
             p(d) = 0       
             p(f) = 7 + x1  
             p(g) = 2       
             p(h) = 4 + x1  
          p(mark) = 4 + 2*x1
        
        Following rules are strictly oriented:
           a__c(X) = 3               
                   > 2               
                   = c(X)            
        
           a__c(X) = 3               
                   > 0               
                   = d(X)            
        
           a__f(X) = 13 + X          
                   > 7 + X           
                   = f(X)            
        
        a__f(f(X)) = 20 + X          
                   > 3               
                   = a__c(f(g(f(X))))
        
           a__h(X) = 7 + X           
                   > 3               
                   = a__c(d(X))      
        
           a__h(X) = 7 + X           
                   > 4 + X           
                   = h(X)            
        
        mark(c(X)) = 8               
                   > 3               
                   = a__c(X)         
        
        mark(d(X)) = 4               
                   > 0               
                   = d(X)            
        
        mark(f(X)) = 18 + 2*X        
                   > 17 + 2*X        
                   = a__f(mark(X))   
        
        mark(g(X)) = 8               
                   > 2               
                   = g(X)            
        
        mark(h(X)) = 12 + 2*X        
                   > 11 + 2*X        
                   = a__h(mark(X))   
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))