/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /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: a(l(x1)) -> a(t(x1)) n(s(x1)) -> a(l(a(t(x1)))) o(m(a(x1))) -> t(e(n(x1))) s(a(x1)) -> l(a(t(o(m(a(t(e(x1)))))))) t(e(x1)) -> n(s(x1)) t(o(x1)) -> m(a(x1)) - Signature: {a/1,n/1,o/1,s/1,t/1} / {e/1,l/1,m/1} - Obligation: derivational complexity wrt. signature {a,e,l,m,n,o,s,t} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 8. The enriched problem is compatible with follwoing automaton. a_0(1) -> 1 a_1(1) -> 15 a_1(2) -> 1 a_1(2) -> 4 a_1(2) -> 15 a_1(6) -> 5 a_1(10) -> 9 a_2(8) -> 16 a_2(17) -> 1 a_2(17) -> 2 a_2(17) -> 4 a_2(17) -> 15 a_2(17) -> 17 a_2(17) -> 21 a_2(18) -> 15 a_2(28) -> 27 a_2(32) -> 31 a_3(19) -> 10 a_3(21) -> 1 a_3(21) -> 2 a_3(21) -> 4 a_3(21) -> 15 a_3(21) -> 17 a_3(21) -> 20 a_3(21) -> 21 a_3(22) -> 1 a_3(24) -> 23 a_3(30) -> 44 a_3(35) -> 34 a_3(39) -> 38 a_4(37) -> 45 a_4(46) -> 10 a_4(47) -> 1 a_4(48) -> 32 a_4(50) -> 49 a_4(51) -> 7 a_4(53) -> 52 a_4(62) -> 61 a_4(66) -> 65 a_5(54) -> 39 a_5(56) -> 55 a_5(64) -> 71 a_5(72) -> 32 a_5(73) -> 7 a_5(75) -> 29 a_5(77) -> 76 a_6(74) -> 39 a_6(78) -> 66 a_6(80) -> 79 a_6(81) -> 36 a_6(83) -> 82 a_6(87) -> 29 a_7(88) -> 66 a_7(89) -> 36 a_7(90) -> 63 a_7(92) -> 91 a_8(93) -> 63 e_0(1) -> 1 e_1(1) -> 11 e_1(2) -> 11 e_1(4) -> 3 e_1(17) -> 11 e_1(21) -> 11 e_1(22) -> 11 e_1(47) -> 11 e_2(2) -> 33 e_2(17) -> 33 e_2(21) -> 33 e_2(22) -> 33 e_2(26) -> 25 e_2(47) -> 33 e_3(17) -> 40 e_3(21) -> 40 e_3(22) -> 40 e_3(47) -> 40 e_3(58) -> 57 e_4(21) -> 67 e_4(60) -> 59 e_5(85) -> 84 l_0(1) -> 1 l_1(1) -> 2 l_1(5) -> 1 l_1(5) -> 12 l_1(5) -> 13 l_2(1) -> 17 l_2(27) -> 12 l_2(27) -> 13 l_2(27) -> 14 l_3(20) -> 19 l_3(23) -> 22 l_3(34) -> 13 l_3(34) -> 14 l_3(34) -> 41 l_3(34) -> 43 l_3(34) -> 69 l_4(49) -> 48 l_4(52) -> 51 l_4(61) -> 41 l_4(61) -> 43 l_4(61) -> 69 l_5(55) -> 54 l_5(76) -> 75 l_6(79) -> 78 l_6(82) -> 81 l_7(91) -> 90 m_0(1) -> 1 m_1(9) -> 8 m_1(15) -> 1 m_1(15) -> 2 m_1(15) -> 17 m_1(15) -> 21 m_2(16) -> 6 m_2(31) -> 30 m_3(38) -> 37 m_3(44) -> 28 m_4(45) -> 35 m_4(65) -> 64 m_5(71) -> 62 n_0(1) -> 1 n_1(1) -> 4 n_1(2) -> 4 n_1(12) -> 1 n_1(12) -> 2 n_1(12) -> 17 n_1(12) -> 21 n_1(17) -> 4 n_1(18) -> 4 n_1(21) -> 4 n_1(22) -> 4 n_1(47) -> 4 n_2(10) -> 26 n_2(13) -> 10 n_2(14) -> 1 n_3(32) -> 58 n_3(41) -> 32 n_3(42) -> 7 n_4(39) -> 60 n_4(43) -> 39 n_4(68) -> 29 n_5(66) -> 85 n_5(69) -> 66 n_5(70) -> 36 n_6(86) -> 63 o_0(1) -> 1 o_1(8) -> 7 o_2(30) -> 29 o_3(37) -> 36 o_4(64) -> 63 s_0(1) -> 1 s_1(1) -> 12 s_2(1) -> 13 s_2(2) -> 13 s_2(4) -> 14 s_2(17) -> 13 s_2(21) -> 13 s_2(22) -> 13 s_2(47) -> 13 s_3(2) -> 41 s_3(17) -> 41 s_3(21) -> 41 s_3(22) -> 41 s_3(26) -> 42 s_3(47) -> 41 s_4(17) -> 43 s_4(21) -> 43 s_4(22) -> 43 s_4(47) -> 43 s_4(58) -> 68 s_5(21) -> 69 s_5(60) -> 70 s_6(85) -> 86 t_0(1) -> 1 t_1(1) -> 2 t_1(3) -> 1 t_1(5) -> 2 t_1(7) -> 6 t_1(11) -> 10 t_2(1) -> 17 t_2(5) -> 18 t_2(25) -> 7 t_2(29) -> 28 t_2(33) -> 32 t_3(1) -> 21 t_3(2) -> 21 t_3(4) -> 24 t_3(17) -> 21 t_3(21) -> 21 t_3(22) -> 21 t_3(36) -> 35 t_3(40) -> 39 t_3(47) -> 21 t_3(57) -> 29 t_4(2) -> 50 t_4(17) -> 50 t_4(20) -> 46 t_4(21) -> 50 t_4(22) -> 50 t_4(23) -> 47 t_4(26) -> 53 t_4(47) -> 50 t_4(59) -> 36 t_4(63) -> 62 t_4(67) -> 66 t_5(17) -> 56 t_5(21) -> 56 t_5(22) -> 56 t_5(47) -> 56 t_5(49) -> 72 t_5(52) -> 73 t_5(58) -> 77 t_5(84) -> 63 t_6(21) -> 80 t_6(55) -> 74 t_6(60) -> 83 t_6(76) -> 87 t_7(79) -> 88 t_7(82) -> 89 t_7(85) -> 92 t_8(91) -> 93 * Step 2: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: a(l(x1)) -> a(t(x1)) n(s(x1)) -> a(l(a(t(x1)))) o(m(a(x1))) -> t(e(n(x1))) s(a(x1)) -> l(a(t(o(m(a(t(e(x1)))))))) t(e(x1)) -> n(s(x1)) t(o(x1)) -> m(a(x1)) - Signature: {a/1,n/1,o/1,s/1,t/1} / {e/1,l/1,m/1} - Obligation: derivational complexity wrt. signature {a,e,l,m,n,o,s,t} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))