WORST_CASE(Omega(n^1),O(n^1))
* Step 1: Sum WORST_CASE(Omega(n^1),O(n^1))
    + Considered Problem:
        - Strict TRS:
            copy(0(),y,z) -> f(z)
            copy(s(x),y,z) -> copy(x,y,cons(f(y),z))
            f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z)
            f(cons(nil(),y)) -> y
        - Signature:
            {copy/3,f/1} / {0/0,cons/2,n/0,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {copy,f} and constructors {0,cons,n,nil,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            copy(0(),y,z) -> f(z)
            copy(s(x),y,z) -> copy(x,y,cons(f(y),z))
            f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z)
            f(cons(nil(),y)) -> y
        - Signature:
            {copy/3,f/1} / {0/0,cons/2,n/0,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {copy,f} and constructors {0,cons,n,nil,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          copy(x,y,z){x -> s(x)} =
            copy(s(x),y,z) ->^+ copy(x,y,cons(f(y),z))
              = C[copy(x,y,cons(f(y),z)) = copy(x,y,z){z -> cons(f(y),z)}]

** Step 1.b:1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            copy(0(),y,z) -> f(z)
            copy(s(x),y,z) -> copy(x,y,cons(f(y),z))
            f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z)
            f(cons(nil(),y)) -> y
        - Signature:
            {copy/3,f/1} / {0/0,cons/2,n/0,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {copy,f} and constructors {0,cons,n,nil,s}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 1, araTimeout = 8, araRuleShifting = Just 1}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(3)
          cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          copy :: ["A"(3) x "A"(0) x "A"(0)] -(3)-> "A"(0)
          f :: ["A"(0)] -(2)-> "A"(0)
          n :: [] -(0)-> "A"(3)
          nil :: [] -(0)-> "A"(0)
          s :: ["A"(3)] -(3)-> "A"(3)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
        
        
        
        Following Still Strict Rules were Typed as:
        -------------------------------------------
        1. Strict:
          copy(0(),y,z) -> f(z)
          copy(s(x),y,z) -> copy(x,y,cons(f(y),z))
          f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z)
          f(cons(nil(),y)) -> y
        2. Weak:
          

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