WORST_CASE(?,O(1))
* Step 1: NaturalPI WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            eq(x,x) -> true()
        - Signature:
            {eq/2} / {true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {eq} and constructors {true}
    + Applied Processor:
        NaturalPI {shape = Mixed 2, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(mixed(2)):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {eq}
        TcT has computed the following interpretation:
            p(eq) = 9
          p(true) = 1
        
        Following rules are strictly oriented:
        eq(x,x) = 9     
                > 1     
                = true()
        
        
        Following rules are (at-least) weakly oriented:
        
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            eq(x,x) -> true()
        - Signature:
            {eq/2} / {true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {eq} and constructors {true}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(1))