/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


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: 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 {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          Cons :: ["A"(0) x "A"(7)] -(7)-> "A"(7)
          Cons :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          Nil :: [] -(0)-> "A"(7)
          Nil :: [] -(0)-> "A"(14)
          foldl#3 :: ["A"(1) x "A"(7)] -(15)-> "A"(0)
          main :: ["A"(14)] -(16)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "Cons_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "Nil_A" :: [] -(0)-> "A"(1)
        

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