WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            foldl#3(x16,Cons(x24,x6)) -> foldl#3(Cons(x24,x16),x6)
            foldl#3(x2,Nil()) -> x2
            main(x1) -> foldl#3(Nil(),x1)
        - Signature:
            {foldl#3/2,main/1} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {foldl#3,main} and constructors {Cons,Nil}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
    + Details:
        Signatures used:
        ----------------
          Cons :: [A(0) x A(12)] -(12)-> A(12)
          Cons :: [A(0) x A(0)] -(0)-> A(0)
          Nil :: [] -(0)-> A(12)
          Nil :: [] -(0)-> A(9)
          foldl#3 :: [A(0) x A(12)] -(4)-> A(0)
          main :: [A(13)] -(12)-> A(0)
        
        
        Cost-free Signatures used:
        --------------------------
          Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          Nil :: [] -(0)-> A_cf(0)
          foldl#3 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          Cons_A :: [A(0) x A(1)] -(1)-> A(1)
          Nil_A :: [] -(0)-> A(1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        foldl#3(x16,Cons(x24,x6)) -> foldl#3(Cons(x24,x16),x6)
        foldl#3(x2,Nil()) -> x2
        main(x1) -> foldl#3(Nil(),x1)
    - Signature:
        {foldl#3/2,main/1} / {Cons/2,Nil/0}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {foldl#3,main} and constructors {Cons,Nil}
Following problems could not be solved:
  - Strict TRS:
      foldl#3(x16,Cons(x24,x6)) -> foldl#3(Cons(x24,x16),x6)
      foldl#3(x2,Nil()) -> x2
      main(x1) -> foldl#3(Nil(),x1)
  - Signature:
      {foldl#3/2,main/1} / {Cons/2,Nil/0}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {foldl#3,main} and constructors {Cons,Nil}
WORST_CASE(?,O(n^1))