WORST_CASE(?,O(n^1)) * Step 1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: anchored(Cons(x,xs),y) -> anchored(xs,Cons(Cons(Nil(),Nil()),y)) anchored(Nil(),y) -> y goal(x,y) -> anchored(x,y) - Signature: {anchored/2,goal/2} / {Cons/2,Nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {anchored,goal} and constructors {Cons,Nil} + Applied Processor: Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3} + Details: Signatures used: ---------------- Cons :: [A(0) x A(15)] -(15)-> A(15) Cons :: [A(0) x A(3)] -(3)-> A(3) Cons :: [A(0) x A(0)] -(0)-> A(0) Nil :: [] -(0)-> A(15) Nil :: [] -(0)-> A(13) anchored :: [A(15) x A(3)] -(2)-> A(1) goal :: [A(15) x A(13)] -(13)-> A(0) Cost-free Signatures used: -------------------------- Cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0) Nil :: [] -(0)-> A_cf(0) anchored :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0) Base Constructor Signatures used: --------------------------------- Cons_A :: [A(0) x A(1)] -(1)-> A(1) Nil_A :: [] -(0)-> A(1) * Step 2: Open MAYBE - Strict TRS: anchored(Cons(x,xs),y) -> anchored(xs,Cons(Cons(Nil(),Nil()),y)) anchored(Nil(),y) -> y goal(x,y) -> anchored(x,y) - Signature: {anchored/2,goal/2} / {Cons/2,Nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {anchored,goal} and constructors {Cons,Nil} Following problems could not be solved: - Strict TRS: anchored(Cons(x,xs),y) -> anchored(xs,Cons(Cons(Nil(),Nil()),y)) anchored(Nil(),y) -> y goal(x,y) -> anchored(x,y) - Signature: {anchored/2,goal/2} / {Cons/2,Nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {anchored,goal} and constructors {Cons,Nil} WORST_CASE(?,O(n^1))