WORST_CASE(?,O(n^1))
* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            fmap#2(Leaf(x8)) -> Leaf(S(x8))
            fmap#2(Node(x4,x2)) -> Node(fmap#2(x4),fmap#2(x2))
            main(x1) -> fmap#2(x1)
        - Signature:
            {fmap#2/1,main/1} / {Leaf/1,Node/2,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {fmap#2,main} and constructors {Leaf,Node,S}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          Leaf_0(2) -> 2
          Leaf_1(3) -> 1
          Leaf_1(3) -> 4
          Leaf_1(3) -> 5
          Node_0(2,2) -> 2
          Node_1(4,5) -> 1
          Node_1(5,5) -> 4
          Node_1(5,5) -> 5
          S_0(2) -> 2
          S_1(2) -> 3
          fmap#2_0(2) -> 1
          fmap#2_1(2) -> 1
          fmap#2_1(2) -> 4
          fmap#2_1(2) -> 5
          main_0(2) -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            fmap#2(Leaf(x8)) -> Leaf(S(x8))
            fmap#2(Node(x4,x2)) -> Node(fmap#2(x4),fmap#2(x2))
            main(x1) -> fmap#2(x1)
        - Signature:
            {fmap#2/1,main/1} / {Leaf/1,Node/2,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {fmap#2,main} and constructors {Leaf,Node,S}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))