WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            goal(x,xs) -> member(x,xs)
            member(x,Nil()) -> False()
            member(x',Cons(x,xs)) -> member[Ite][True][Ite](!EQ(x',x),x',Cons(x,xs))
            notEmpty(Cons(x,xs)) -> True()
            notEmpty(Nil()) -> False()
        - Weak TRS:
            !EQ(0(),0()) -> True()
            !EQ(0(),S(y)) -> False()
            !EQ(S(x),0()) -> False()
            !EQ(S(x),S(y)) -> !EQ(x,y)
            member[Ite][True][Ite](False(),x',Cons(x,xs)) -> member(x',xs)
            member[Ite][True][Ite](True(),x,xs) -> True()
        - Signature:
            {!EQ/2,goal/2,member/2,member[Ite][True][Ite]/3,notEmpty/1} / {0/0,Cons/2,False/0,Nil/0,S/1,True/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {!EQ,goal,member,member[Ite][True][Ite]
            ,notEmpty} and constructors {0,Cons,False,Nil,S,True}
    + Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation:
        The following argument positions are considered usable:
          uargs(member[Ite][True][Ite]) = {1}
        
        Following symbols are considered usable:
          {!EQ,goal,member,member[Ite][True][Ite],notEmpty}
        TcT has computed the following interpretation:
                             p(!EQ) = [0]                   
                               p(0) = [8]                   
                            p(Cons) = [1] x2 + [1]          
                           p(False) = [0]                   
                             p(Nil) = [1]                   
                               p(S) = [1] x1 + [8]          
                            p(True) = [0]                   
                            p(goal) = [1] x1 + [4] x2 + [14]
                          p(member) = [4] x2 + [4]          
          p(member[Ite][True][Ite]) = [8] x1 + [4] x3 + [2] 
                        p(notEmpty) = [3] x1 + [2]          
        
        Following rules are strictly oriented:
                   goal(x,xs) = [1] x + [4] xs + [14]                          
                              > [4] xs + [4]                                   
                              = member(x,xs)                                   
        
              member(x,Nil()) = [8]                                            
                              > [0]                                            
                              = False()                                        
        
        member(x',Cons(x,xs)) = [4] xs + [8]                                   
                              > [4] xs + [6]                                   
                              = member[Ite][True][Ite](!EQ(x',x),x',Cons(x,xs))
        
         notEmpty(Cons(x,xs)) = [3] xs + [5]                                   
                              > [0]                                            
                              = True()                                         
        
              notEmpty(Nil()) = [5]                                            
                              > [0]                                            
                              = False()                                        
        
        
        Following rules are (at-least) weakly oriented:
                                         !EQ(0(),0()) =  [0]          
                                                      >= [0]          
                                                      =  True()       
        
                                        !EQ(0(),S(y)) =  [0]          
                                                      >= [0]          
                                                      =  False()      
        
                                        !EQ(S(x),0()) =  [0]          
                                                      >= [0]          
                                                      =  False()      
        
                                       !EQ(S(x),S(y)) =  [0]          
                                                      >= [0]          
                                                      =  !EQ(x,y)     
        
        member[Ite][True][Ite](False(),x',Cons(x,xs)) =  [4] xs + [6] 
                                                      >= [4] xs + [4] 
                                                      =  member(x',xs)
        
                  member[Ite][True][Ite](True(),x,xs) =  [4] xs + [2] 
                                                      >= [0]          
                                                      =  True()       
        

WORST_CASE(?,O(n^1))