/export/starexec/sandbox/solver/bin/starexec_run_tct_dci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Bounds. WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: c(a(a(b(c(a(x1)))))) -> a(a(b(c(c(a(a(b(c(x1))))))))) - Signature: {c/1} / {a/1,b/1} - Obligation: innermost derivational complexity wrt. signature {a,b,c} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 4. The enriched problem is compatible with follwoing automaton. a_0(1) -> 1 a_1(2) -> 1 a_1(2) -> 5 a_1(2) -> 9 a_1(3) -> 2 a_1(7) -> 6 a_1(8) -> 7 a_2(10) -> 4 a_2(10) -> 5 a_2(10) -> 9 a_2(10) -> 13 a_2(11) -> 10 a_2(15) -> 14 a_2(16) -> 15 a_3(18) -> 12 a_3(19) -> 18 a_3(23) -> 22 a_3(24) -> 23 a_3(26) -> 13 a_3(26) -> 21 a_3(27) -> 26 a_3(31) -> 30 a_3(32) -> 31 a_4(34) -> 21 a_4(35) -> 34 a_4(39) -> 38 a_4(40) -> 39 b_0(1) -> 1 b_1(4) -> 3 b_1(9) -> 8 b_2(12) -> 11 b_2(17) -> 16 b_3(20) -> 19 b_3(25) -> 24 b_3(28) -> 27 b_3(33) -> 32 b_4(36) -> 35 b_4(41) -> 40 c_0(1) -> 1 c_1(1) -> 9 c_1(2) -> 9 c_1(5) -> 4 c_1(6) -> 5 c_1(10) -> 9 c_2(2) -> 17 c_2(3) -> 17 c_2(10) -> 17 c_2(11) -> 17 c_2(13) -> 12 c_2(14) -> 13 c_2(26) -> 17 c_3(10) -> 25 c_3(11) -> 33 c_3(21) -> 20 c_3(22) -> 21 c_3(26) -> 25 c_3(27) -> 33 c_3(29) -> 28 c_3(30) -> 29 c_4(27) -> 41 c_4(37) -> 36 c_4(38) -> 37 * Step 2: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: c(a(a(b(c(a(x1)))))) -> a(a(b(c(c(a(a(b(c(x1))))))))) - Signature: {c/1} / {a/1,b/1} - Obligation: innermost derivational complexity wrt. signature {a,b,c} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))