WORST_CASE(?,O(n^1))
* Step 1: Sum WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            even(0()) -> S(0())
            even(S(x)) -> odd(x)
            odd(0()) -> 0()
            odd(S(x)) -> even(x)
        - Signature:
            {even/1,odd/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {even,odd} and constructors {0,S}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            even(0()) -> S(0())
            even(S(x)) -> odd(x)
            odd(0()) -> 0()
            odd(S(x)) -> even(x)
        - Signature:
            {even/1,odd/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {even,odd} and constructors {0,S}
    + Applied Processor:
        NaturalPI {shape = Linear, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {even,odd}
        TcT has computed the following interpretation:
             p(0) = 0
             p(S) = 0
          p(even) = 1
           p(odd) = 1
        
        Following rules are strictly oriented:
        even(0()) = 1     
                  > 0     
                  = S(0())
        
         odd(0()) = 1     
                  > 0     
                  = 0()   
        
        
        Following rules are (at-least) weakly oriented:
        even(S(x)) =  1      
                   >= 1      
                   =  odd(x) 
        
         odd(S(x)) =  1      
                   >= 1      
                   =  even(x)
        
* Step 3: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            even(S(x)) -> odd(x)
            odd(S(x)) -> even(x)
        - Weak TRS:
            even(0()) -> S(0())
            odd(0()) -> 0()
        - Signature:
            {even/1,odd/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {even,odd} and constructors {0,S}
    + Applied Processor:
        NaturalPI {shape = Linear, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {even,odd}
        TcT has computed the following interpretation:
             p(0) = 4       
             p(S) = 4 + x1  
          p(even) = 2 + 4*x1
           p(odd) = 1 + 4*x1
        
        Following rules are strictly oriented:
        even(S(x)) = 18 + 4*x
                   > 1 + 4*x 
                   = odd(x)  
        
         odd(S(x)) = 17 + 4*x
                   > 2 + 4*x 
                   = even(x) 
        
        
        Following rules are (at-least) weakly oriented:
        even(0()) =  18    
                  >= 8     
                  =  S(0())
        
         odd(0()) =  17    
                  >= 4     
                  =  0()   
        
* Step 4: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            even(0()) -> S(0())
            even(S(x)) -> odd(x)
            odd(0()) -> 0()
            odd(S(x)) -> even(x)
        - Signature:
            {even/1,odd/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {even,odd} and constructors {0,S}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))