WORST_CASE(?,O(n^1))
* Step 1: Ara 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:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          Leaf :: ["A"(15)] -(15)-> "A"(15)
          Leaf :: ["A"(0)] -(0)-> "A"(0)
          Node :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
          Node :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          S :: ["A"(1)] -(1)-> "A"(1)
          fmap#2 :: ["A"(15)] -(3)-> "A"(0)
          main :: ["A"(15)] -(5)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "Leaf_A" :: ["A"(1)] -(1)-> "A"(1)
          "Node_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          "S_A" :: ["A"(1)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))