WORST_CASE(?,O(n^1)) * Step 1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) minus(X,0()) -> X minus(s(X),s(Y)) -> p(minus(X,Y)) p(s(X)) -> X - Signature: {div/2,minus/2,p/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {div,minus,p} and constructors {0,s} + Applied Processor: Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT} + Details: Signatures used: ---------------- 0 :: [] -(0)-> A(13) 0 :: [] -(0)-> A(0) div :: [A(13) x A(1)] -(0)-> A(0) minus :: [A(13) x A(0)] -(4)-> A(13) p :: [A(13)] -(8)-> A(13) s :: [A(1)] -(1)-> A(1) s :: [A(13)] -(13)-> A(13) s :: [A(0)] -(0)-> A(0) Cost-free Signatures used: -------------------------- 0 :: [] -(0)-> A_cf(0) div :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0) minus :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0) p :: [A_cf(0)] -(0)-> A_cf(0) s :: [A_cf(0)] -(0)-> A_cf(0) Base Constructor Signatures used: --------------------------------- 0_A :: [] -(0)-> A(1) s_A :: [A(1)] -(1)-> A(1) * Step 2: Open MAYBE - Strict TRS: div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) minus(X,0()) -> X minus(s(X),s(Y)) -> p(minus(X,Y)) p(s(X)) -> X - Signature: {div/2,minus/2,p/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {div,minus,p} and constructors {0,s} Following problems could not be solved: - Strict TRS: div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y))) minus(X,0()) -> X minus(s(X),s(Y)) -> p(minus(X,Y)) p(s(X)) -> X - Signature: {div/2,minus/2,p/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {div,minus,p} and constructors {0,s} WORST_CASE(?,O(n^1))