WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a(b(x)) -> b(b(a(x)))
        - Signature:
            {a/1} / {b/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a} and constructors {b}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
    + Details:
        Signatures used:
        ----------------
          a :: [A(4)] -(0)-> A(0)
          b :: [A(4)] -(4)-> A(4)
          b :: [A(0)] -(0)-> A(0)
        
        
        Cost-free Signatures used:
        --------------------------
          a :: [A_cf(0)] -(0)-> A_cf(0)
          b :: [A_cf(0)] -(0)-> A_cf(0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          b_A :: [A(1)] -(1)-> A(1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        a(b(x)) -> b(b(a(x)))
    - Signature:
        {a/1} / {b/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {a} and constructors {b}
Following problems could not be solved:
  - Strict TRS:
      a(b(x)) -> b(b(a(x)))
  - Signature:
      {a/1} / {b/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {a} and constructors {b}
WORST_CASE(?,O(n^1))