/bin/sh: line 1: 41480 Quit (core dumped) z3 -T:2.8499999999999996 -smt2 /tmp/SMTP41420-16 > /tmp/SMTS41420-17 /bin/sh: line 1: 41532 Quit (core dumped) z3 -T:14.25 -smt2 /tmp/SMTP41420-54 > /tmp/SMTS41420-55 /bin/sh: line 1: 41505 Quit (core dumped) z3 -T:7.6 -smt2 /tmp/SMTP41420-46 > /tmp/SMTS41420-47 /bin/sh: line 1: 41545 Quit (core dumped) z3 -T:14.25 -smt2 /tmp/SMTP41420-66 > /tmp/SMTS41420-67 /bin/sh: line 1: 41556 Quit (core dumped) z3 -T:14.25 -smt2 /tmp/SMTP41420-5 > /tmp/SMTS41420-6 /bin/sh: line 1: 41479 Quit (core dumped) z3 -T:4.75 -smt2 /tmp/SMTP41420-20 > /tmp/SMTS41420-23 WORST_CASE(Omega(n^1),O(n^1)) * Step 1: Sum. WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: h(f(x,y)) -> f(y,f(h(h(x)),a())) - Signature: {h/1} / {a/0,f/2} - Obligation: innermost runtime complexity wrt. defined symbols {h} and constructors {a,f} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: Sum. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: h(f(x,y)) -> f(y,f(h(h(x)),a())) - Signature: {h/1} / {a/0,f/2} - Obligation: innermost runtime complexity wrt. defined symbols {h} and constructors {a,f} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:2: DecreasingLoops. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: h(f(x,y)) -> f(y,f(h(h(x)),a())) - Signature: {h/1} / {a/0,f/2} - Obligation: innermost runtime complexity wrt. defined symbols {h} and constructors {a,f} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: h(x){x -> f(x,y)} = h(f(x,y)) ->^+ f(y,f(h(h(x)),a())) = C[h(x) = h(x){}] ** Step 1.b:1: Bounds. WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: h(f(x,y)) -> f(y,f(h(h(x)),a())) - Signature: {h/1} / {a/0,f/2} - Obligation: innermost runtime complexity wrt. defined symbols {h} and constructors {a,f} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. a_0() -> 2 a_1() -> 5 a_2() -> 9 f_0(2,2) -> 2 f_1(2,3) -> 1 f_1(2,3) -> 6 f_1(2,3) -> 10 f_1(4,5) -> 3 f_2(3,7) -> 4 f_2(3,7) -> 8 f_2(8,9) -> 7 h_0(2) -> 1 h_1(2) -> 6 h_1(6) -> 4 h_2(2) -> 10 h_2(10) -> 8 ** Step 1.b:2: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: h(f(x,y)) -> f(y,f(h(h(x)),a())) - Signature: {h/1} / {a/0,f/2} - Obligation: innermost runtime complexity wrt. defined symbols {h} and constructors {a,f} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(Omega(n^1),O(n^1))