WORST_CASE(?,O(n^2))
* Step 1: NaturalPI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            and(tt(),X) -> activate(X)
            plus(N,0()) -> N
            plus(N,s(M)) -> s(plus(N,M))
            x(N,0()) -> 0()
            x(N,s(M)) -> plus(x(N,M),N)
        - Signature:
            {activate/1,and/2,plus/2,x/2} / {0/0,s/1,tt/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,and,plus,x} and constructors {0,s,tt}
    + Applied Processor:
        NaturalPI {shape = Mixed 2, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(mixed(2)):
        The following argument positions are considered usable:
          uargs(plus) = {1},
          uargs(s) = {1}
        
        Following symbols are considered usable:
          {activate,and,plus,x}
        TcT has computed the following interpretation:
                 p(0) = 2                      
          p(activate) = 2 + 4*x1               
               p(and) = 3 + 4*x1 + x1*x2 + 6*x2
              p(plus) = x1 + 3*x2              
                 p(s) = 2 + x1                 
                p(tt) = 0                      
                 p(x) = 2*x1*x2 + 2*x2^2       
        
        Following rules are strictly oriented:
         activate(X) = 2 + 4*X                      
                     > X                            
                     = X                            
        
         and(tt(),X) = 3 + 6*X                      
                     > 2 + 4*X                      
                     = activate(X)                  
        
         plus(N,0()) = 6 + N                        
                     > N                            
                     = N                            
        
        plus(N,s(M)) = 6 + 3*M + N                  
                     > 2 + 3*M + N                  
                     = s(plus(N,M))                 
        
            x(N,0()) = 8 + 4*N                      
                     > 2                            
                     = 0()                          
        
           x(N,s(M)) = 8 + 8*M + 2*M*N + 2*M^2 + 4*N
                     > 2*M*N + 2*M^2 + 3*N          
                     = plus(x(N,M),N)               
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^2))