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

WORST_CASE(?,O(n^1))