WORST_CASE(?,O(n^1))
* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a(a(f(x,y))) -> f(a(b(a(b(a(x))))),a(b(a(b(a(y))))))
            f(a(x),a(y)) -> a(f(x,y))
            f(b(x),b(y)) -> b(f(x,y))
        - Signature:
            {a/1,f/2} / {b/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a,f} and constructors {b}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          a_0(2) -> 1
          b_0(2) -> 2
          b_1(4) -> 3
          b_1(4) -> 4
          f_0(2,2) -> 3
          f_1(2,2) -> 4
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a(a(f(x,y))) -> f(a(b(a(b(a(x))))),a(b(a(b(a(y))))))
            f(a(x),a(y)) -> a(f(x,y))
            f(b(x),b(y)) -> b(f(x,y))
        - Signature:
            {a/1,f/2} / {b/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a,f} and constructors {b}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))