/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Sum. WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__d(X)) -> d(X) activate(n__f(X)) -> f(X) c(X) -> d(activate(X)) d(X) -> n__d(X) f(X) -> n__f(X) f(f(X)) -> c(n__f(g(n__f(X)))) h(X) -> c(n__d(X)) - Signature: {activate/1,c/1,d/1,f/1,h/1} / {g/1,n__d/1,n__f/1} - Obligation: runtime complexity wrt. defined symbols {activate,c,d,f,h} and constructors {g,n__d,n__f} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Bounds. WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__d(X)) -> d(X) activate(n__f(X)) -> f(X) c(X) -> d(activate(X)) d(X) -> n__d(X) f(X) -> n__f(X) f(f(X)) -> c(n__f(g(n__f(X)))) h(X) -> c(n__d(X)) - Signature: {activate/1,c/1,d/1,f/1,h/1} / {g/1,n__d/1,n__f/1} - Obligation: runtime complexity wrt. defined symbols {activate,c,d,f,h} and constructors {g,n__d,n__f} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 5. The enriched problem is compatible with follwoing automaton. activate_0(2) -> 1 activate_0(2) -> 3 activate_1(2) -> 1 activate_1(2) -> 2 activate_1(2) -> 3 activate_2(1) -> 3 activate_3(4) -> 6 activate_4(7) -> 9 c_0(2) -> 1 c_0(2) -> 3 c_1(1) -> 1 c_1(1) -> 3 c_2(4) -> 1 c_2(4) -> 2 c_2(4) -> 3 c_3(7) -> 1 c_3(7) -> 2 c_3(7) -> 3 d_0(2) -> 1 d_0(2) -> 3 d_1(2) -> 1 d_1(2) -> 2 d_1(2) -> 3 d_1(6) -> 1 d_1(6) -> 3 d_1(9) -> 1 d_1(9) -> 3 d_2(2) -> 1 d_2(2) -> 2 d_2(2) -> 3 d_2(3) -> 1 d_2(3) -> 3 d_2(6) -> 1 d_2(6) -> 2 d_2(6) -> 3 d_2(9) -> 1 d_2(9) -> 2 d_2(9) -> 3 d_3(2) -> 3 d_3(3) -> 3 d_3(6) -> 1 d_3(6) -> 2 d_3(6) -> 3 d_3(9) -> 3 d_4(9) -> 1 d_4(9) -> 2 d_4(9) -> 3 f_0(2) -> 1 f_0(2) -> 3 f_1(2) -> 1 f_1(2) -> 2 f_1(2) -> 3 f_2(2) -> 1 f_2(2) -> 2 f_2(2) -> 3 f_3(2) -> 3 f_3(5) -> 6 f_4(8) -> 9 g_0(2) -> 1 g_0(2) -> 2 g_0(2) -> 3 g_1(1) -> 1 g_1(1) -> 2 g_1(1) -> 3 g_2(2) -> 5 g_3(3) -> 8 h_0(2) -> 1 h_0(2) -> 3 n__d_0(2) -> 1 n__d_0(2) -> 2 n__d_0(2) -> 3 n__d_1(2) -> 1 n__d_1(2) -> 3 n__d_2(2) -> 1 n__d_2(2) -> 2 n__d_2(2) -> 3 n__d_2(6) -> 1 n__d_2(6) -> 3 n__d_2(9) -> 1 n__d_2(9) -> 3 n__d_3(2) -> 1 n__d_3(2) -> 2 n__d_3(2) -> 3 n__d_3(3) -> 1 n__d_3(3) -> 3 n__d_3(6) -> 1 n__d_3(6) -> 2 n__d_3(6) -> 3 n__d_3(9) -> 1 n__d_3(9) -> 2 n__d_3(9) -> 3 n__d_4(2) -> 3 n__d_4(3) -> 3 n__d_4(6) -> 1 n__d_4(6) -> 2 n__d_4(6) -> 3 n__d_4(9) -> 3 n__d_5(9) -> 1 n__d_5(9) -> 2 n__d_5(9) -> 3 n__f_0(2) -> 1 n__f_0(2) -> 2 n__f_0(2) -> 3 n__f_1(2) -> 1 n__f_1(2) -> 3 n__f_2(2) -> 1 n__f_2(2) -> 2 n__f_2(2) -> 3 n__f_2(5) -> 4 n__f_2(5) -> 6 n__f_3(2) -> 1 n__f_3(2) -> 2 n__f_3(2) -> 3 n__f_3(8) -> 7 n__f_3(8) -> 9 n__f_4(2) -> 3 n__f_4(5) -> 6 n__f_5(8) -> 9 1 -> 3 2 -> 1 2 -> 3 4 -> 6 7 -> 9 * Step 3: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: activate(X) -> X activate(n__d(X)) -> d(X) activate(n__f(X)) -> f(X) c(X) -> d(activate(X)) d(X) -> n__d(X) f(X) -> n__f(X) f(f(X)) -> c(n__f(g(n__f(X)))) h(X) -> c(n__d(X)) - Signature: {activate/1,c/1,d/1,f/1,h/1} / {g/1,n__d/1,n__f/1} - Obligation: runtime complexity wrt. defined symbols {activate,c,d,f,h} and constructors {g,n__d,n__f} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))