WORST_CASE(Omega(n^1),O(n^1))
* Step 1: Sum WORST_CASE(Omega(n^1),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:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(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:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          foldl#3(x,z){z -> Cons(y,z)} =
            foldl#3(x,Cons(y,z)) ->^+ foldl#3(Cons(y,x),z)
              = C[foldl#3(Cons(y,x),z) = foldl#3(x,z){x -> Cons(y,x)}]

** Step 1.b:1: NaturalPI 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:
        NaturalPI {shape = Linear, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {foldl#3,main}
        TcT has computed the following interpretation:
             p(Cons) = 2 + x1 + x2 
              p(Nil) = 0           
          p(foldl#3) = 8*x1 + 12*x2
             p(main) = 1 + 12*x1   
        
        Following rules are strictly oriented:
        foldl#3(x16,Cons(x24,x6)) = 24 + 8*x16 + 12*x24 + 12*x6
                                  > 16 + 8*x16 + 8*x24 + 12*x6 
                                  = foldl#3(Cons(x24,x16),x6)  
        
                         main(x1) = 1 + 12*x1                  
                                  > 12*x1                      
                                  = foldl#3(Nil(),x1)          
        
        
        Following rules are (at-least) weakly oriented:
        foldl#3(x2,Nil()) =  8*x2
                          >= x2  
                          =  x2  
        
** Step 1.b:2: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            foldl#3(x2,Nil()) -> x2
        - Weak TRS:
            foldl#3(x16,Cons(x24,x6)) -> foldl#3(Cons(x24,x16),x6)
            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:
        NaturalPI {shape = Linear, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {foldl#3,main}
        TcT has computed the following interpretation:
             p(Cons) = x2      
              p(Nil) = 0       
          p(foldl#3) = 2 + 8*x1
             p(main) = 2       
        
        Following rules are strictly oriented:
        foldl#3(x2,Nil()) = 2 + 8*x2
                          > x2      
                          = x2      
        
        
        Following rules are (at-least) weakly oriented:
        foldl#3(x16,Cons(x24,x6)) =  2 + 8*x16                
                                  >= 2 + 8*x16                
                                  =  foldl#3(Cons(x24,x16),x6)
        
                         main(x1) =  2                        
                                  >= 2                        
                                  =  foldl#3(Nil(),x1)        
        
** Step 1.b:3: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak 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:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(Omega(n^1),O(n^1))