WORST_CASE(?,O(n^2)) * Step 1: Ara WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: f(0()) -> s(0()) f(s(0())) -> s(0()) f(s(s(x))) -> f(f(s(x))) - Signature: {f/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} 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(0, 4) 0 :: [] -(0)-> A(4, 0) 0 :: [] -(0)-> A(0, 0) f :: [A(0, 4)] -(2)-> A(0, 0) s :: [A(4, 0)] -(0)-> A(0, 4) s :: [A(4, 0)] -(4)-> A(4, 0) s :: [A(0, 0)] -(0)-> A(0, 0) Cost-free Signatures used: -------------------------- 0 :: [] -(0)-> A_cf(0, 0) 0 :: [] -(0)-> A_cf(7, 0) 0 :: [] -(0)-> A_cf(5, 0) f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0) f :: [A_cf(0, 0)] -(0)-> A_cf(0, 4) s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0) s :: [A_cf(7, 0)] -(0)-> A_cf(0, 7) s :: [A_cf(5, 0)] -(0)-> A_cf(0, 5) Base Constructor Signatures used: --------------------------------- 0_A :: [] -(0)-> A(1, 0) 0_A :: [] -(0)-> A(0, 1) s_A :: [A(1, 0)] -(1)-> A(1, 0) s_A :: [A(1, 0)] -(0)-> A(0, 1) * Step 2: Open MAYBE - Strict TRS: f(0()) -> s(0()) f(s(0())) -> s(0()) f(s(s(x))) -> f(f(s(x))) - Signature: {f/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {0,s} Following problems could not be solved: - Strict TRS: f(0()) -> s(0()) f(s(0())) -> s(0()) f(s(s(x))) -> f(f(s(x))) - Signature: {f/1} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {0,s} WORST_CASE(?,O(n^2))