/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) * Step 1: Sum WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: app(cons(X),YS) -> cons(X) app(nil(),YS) -> YS from(X) -> cons(X) prefix(L) -> cons(nil()) zWadr(XS,nil()) -> nil() zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X))) zWadr(nil(),YS) -> nil() - Signature: {app/2,from/1,prefix/1,zWadr/2} / {cons/1,nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {app,from,prefix,zWadr} and constructors {cons,nil} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Ara WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: app(cons(X),YS) -> cons(X) app(nil(),YS) -> YS from(X) -> cons(X) prefix(L) -> cons(nil()) zWadr(XS,nil()) -> nil() zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X))) zWadr(nil(),YS) -> nil() - Signature: {app/2,from/1,prefix/1,zWadr/2} / {cons/1,nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {app,from,prefix,zWadr} and constructors {cons,nil} + Applied Processor: Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing} + Details: Signatures used: ---------------- app :: ["A"(0) x "A"(0)] -(1)-> "A"(0) cons :: ["A"(0)] -(0)-> "A"(0) from :: ["A"(0)] -(1)-> "A"(0) nil :: [] -(0)-> "A"(0) prefix :: ["A"(0)] -(1)-> "A"(0) zWadr :: ["A"(0) x "A"(0)] -(2)-> "A"(0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "cons_A" :: ["A"(0)] -(0)-> "A"(0) "nil_A" :: [] -(0)-> "A"(0) WORST_CASE(?,O(1))