WORST_CASE(?,O(n^1))
* Step 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 = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + 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:
        ---------------------------------
          "0_A" :: [] -(0)-> "A"(0)
          "cons_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          "n_A" :: [] -(0)-> "A"(0)
          "nil_A" :: [] -(0)-> "A"(0)
          "s_A" :: ["A"(0)] -(0)-> "A"(0)
        

WORST_CASE(?,O(n^1))