/export/starexec/sandbox2/solver/bin/starexec_run_tct_dci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Bounds. WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) - Signature: {f/2} / {a/0,h/1} - Obligation: innermost derivational complexity wrt. signature {a,f,h} + Applied Processor: Bounds {initialAutomaton = perSymbol, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. a_0() -> 1 a_1() -> 8 a_1() -> 9 a_1() -> 10 a_2() -> 15 a_2() -> 16 a_2() -> 17 f_0(1,1) -> 2 f_0(1,2) -> 2 f_0(1,3) -> 2 f_0(2,1) -> 2 f_0(2,2) -> 2 f_0(2,3) -> 2 f_0(3,1) -> 2 f_0(3,2) -> 2 f_0(3,3) -> 2 f_1(4,1) -> 2 f_1(4,2) -> 2 f_1(4,3) -> 2 f_1(4,4) -> 2 f_1(4,7) -> 5 f_1(5,6) -> 4 f_1(7,1) -> 5 f_1(7,2) -> 5 f_1(7,3) -> 5 f_1(7,4) -> 5 f_1(8,9) -> 7 f_2(11,4) -> 5 f_2(12,13) -> 11 f_2(14,8) -> 12 f_2(15,16) -> 14 h_0(1) -> 3 h_0(2) -> 3 h_0(3) -> 3 h_1(10) -> 6 h_2(17) -> 13 * Step 2: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) - Signature: {f/2} / {a/0,h/1} - Obligation: innermost derivational complexity wrt. signature {a,f,h} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))