* Step 1: Sum WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            not(and(x,y)) -> or(not(not(not(x))),not(not(not(y))))
            not(not(x)) -> x
            not(or(x,y)) -> and(not(not(not(x))),not(not(not(y))))
        - Signature:
            {not/1} / {and/2,or/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {not} and constructors {and,or}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            not(and(x,y)) -> or(not(not(not(x))),not(not(not(y))))
            not(not(x)) -> x
            not(or(x,y)) -> and(not(not(not(x))),not(not(not(y))))
        - Signature:
            {not/1} / {and/2,or/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {not} and constructors {and,or}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          not(x){x -> and(x,y)} =
            not(and(x,y)) ->^+ or(not(not(not(x))),not(not(not(y))))
              = C[not(x) = not(x){}]

WORST_CASE(Omega(n^1),?)