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

WORST_CASE(Omega(n^1),?)