/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /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: 0(1(0(2(x1)))) -> 3(0(1(2(0(x1))))) 0(2(3(4(2(x1))))) -> 3(0(2(2(4(5(x1)))))) 0(3(4(0(2(x1))))) -> 0(3(1(0(4(2(x1)))))) 0(3(5(0(2(x1))))) -> 2(1(0(5(3(0(x1)))))) 1(0(0(2(x1)))) -> 1(0(1(1(2(0(x1)))))) 1(0(0(2(x1)))) -> 1(3(3(0(2(0(x1)))))) 1(0(0(2(x1)))) -> 2(3(0(0(1(x1))))) 1(0(0(2(x1)))) -> 3(0(0(1(1(2(x1)))))) 1(0(0(4(2(x1))))) -> 0(4(5(1(0(2(x1)))))) 1(0(2(2(x1)))) -> 1(1(1(2(2(0(x1)))))) 1(0(2(2(x1)))) -> 2(1(2(3(0(x1))))) 1(0(3(5(2(x1))))) -> 4(5(3(1(2(0(x1)))))) 1(1(0(2(2(x1))))) -> 1(1(2(0(1(2(x1)))))) 1(3(4(0(2(x1))))) -> 1(2(3(0(1(4(x1)))))) 1(3(4(2(x1)))) -> 1(1(2(3(4(x1))))) 1(3(4(2(x1)))) -> 1(2(3(3(4(5(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(4(4(4(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(4(4(5(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(5(4(5(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(5(5(4(x1)))))) 1(3(5(0(2(x1))))) -> 1(0(2(5(2(3(x1)))))) 1(3(5(2(x1)))) -> 2(3(1(0(5(x1))))) 1(3(5(2(x1)))) -> 4(5(1(2(3(x1))))) 3(1(0(0(2(x1))))) -> 3(0(1(2(2(0(x1)))))) 3(1(0(2(x1)))) -> 3(0(1(2(0(x1))))) 3(1(3(5(2(x1))))) -> 3(0(3(5(1(2(x1)))))) 3(3(4(0(2(x1))))) -> 3(0(0(4(2(3(x1)))))) 3(4(0(0(2(x1))))) -> 3(0(0(4(4(2(x1)))))) 3(4(0(2(x1)))) -> 2(0(4(3(3(0(x1)))))) 3(4(0(2(x1)))) -> 3(0(0(2(4(x1))))) 3(4(0(2(x1)))) -> 3(0(1(2(4(x1))))) 3(4(0(2(x1)))) -> 3(0(2(1(1(4(x1)))))) 3(4(0(2(x1)))) -> 3(0(5(2(4(x1))))) 3(4(0(2(x1)))) -> 3(1(0(2(4(x1))))) 3(4(0(2(x1)))) -> 3(3(0(5(2(4(x1)))))) 3(4(0(2(x1)))) -> 4(1(2(3(0(x1))))) 3(4(0(2(x1)))) -> 4(2(3(3(3(0(x1)))))) 3(4(1(0(2(x1))))) -> 3(1(2(3(0(4(x1)))))) 3(4(1(5(2(x1))))) -> 2(3(0(1(4(5(x1)))))) 3(4(2(0(2(x1))))) -> 3(2(0(4(2(3(x1)))))) 3(4(2(0(2(x1))))) -> 4(2(2(3(0(3(x1)))))) 3(5(0(0(2(x1))))) -> 0(3(0(2(4(5(x1)))))) 3(5(0(2(x1)))) -> 2(5(3(0(0(0(x1)))))) 3(5(0(2(x1)))) -> 3(0(0(2(5(4(x1)))))) 3(5(0(2(x1)))) -> 3(0(3(2(5(x1))))) 3(5(0(2(x1)))) -> 5(5(2(3(0(3(x1)))))) 3(5(0(4(2(x1))))) -> 2(0(4(4(5(3(x1)))))) 3(5(0(4(2(x1))))) -> 2(5(4(3(0(0(x1)))))) 3(5(3(4(2(x1))))) -> 0(5(4(2(3(3(x1)))))) - Signature: {0/1,1/1,3/1} / {2/1,4/1,5/1} - Obligation: derivational complexity wrt. signature {0,1,2,3,4,5} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_1(1) -> 5 0_1(3) -> 2 0_1(4) -> 21 0_1(5) -> 92 0_1(6) -> 10 0_1(8) -> 51 0_1(9) -> 1 0_1(9) -> 5 0_1(9) -> 22 0_1(9) -> 24 0_1(9) -> 28 0_1(9) -> 50 0_1(9) -> 88 0_1(9) -> 145 0_1(9) -> 155 0_1(9) -> 184 0_1(10) -> 2 0_1(12) -> 11 0_1(13) -> 29 0_1(14) -> 5 0_1(16) -> 15 0_1(19) -> 18 0_1(23) -> 22 0_1(24) -> 23 0_1(25) -> 3 0_1(26) -> 42 0_1(30) -> 2 0_1(45) -> 44 0_1(46) -> 69 0_1(47) -> 3 0_1(48) -> 4 0_1(50) -> 88 0_1(60) -> 14 0_1(63) -> 5 0_1(92) -> 91 0_1(124) -> 4 0_2(6) -> 155 0_2(8) -> 155 0_2(14) -> 36 0_2(23) -> 155 0_2(42) -> 155 0_2(46) -> 103 0_2(48) -> 55 0_2(53) -> 52 0_2(63) -> 36 0_2(84) -> 83 0_2(86) -> 36 0_2(101) -> 100 0_2(112) -> 111 0_2(115) -> 126 0_2(124) -> 55 0_2(139) -> 121 0_2(142) -> 141 0_2(143) -> 142 0_2(145) -> 207 0_2(147) -> 146 0_2(148) -> 147 0_2(152) -> 151 0_2(155) -> 192 0_2(180) -> 184 0_2(185) -> 44 0_2(187) -> 186 0_2(192) -> 191 0_2(208) -> 145 0_2(213) -> 3 0_2(213) -> 44 0_2(213) -> 145 0_3(156) -> 238 0_3(236) -> 235 1_0(1) -> 1 1_1(1) -> 24 1_1(3) -> 19 1_1(4) -> 3 1_1(5) -> 28 1_1(7) -> 23 1_1(11) -> 10 1_1(13) -> 26 1_1(14) -> 24 1_1(15) -> 14 1_1(18) -> 1 1_1(18) -> 24 1_1(18) -> 25 1_1(18) -> 28 1_1(18) -> 139 1_1(24) -> 25 1_1(25) -> 3 1_1(26) -> 25 1_1(29) -> 28 1_1(30) -> 18 1_1(31) -> 30 1_1(45) -> 6 1_1(46) -> 45 1_1(49) -> 41 1_1(51) -> 22 1_1(69) -> 10 1_2(28) -> 139 1_2(32) -> 28 1_2(33) -> 32 1_2(34) -> 33 1_2(38) -> 37 1_2(54) -> 53 1_2(81) -> 80 1_2(102) -> 101 1_2(117) -> 24 1_2(117) -> 25 1_2(117) -> 28 1_2(117) -> 139 1_2(118) -> 117 1_2(126) -> 125 1_2(129) -> 128 1_2(140) -> 139 1_2(147) -> 146 1_2(148) -> 147 1_2(156) -> 158 1_2(158) -> 157 1_2(160) -> 159 1_3(237) -> 236 2_0(1) -> 1 2_1(1) -> 13 2_1(3) -> 2 2_1(4) -> 31 2_1(5) -> 4 2_1(6) -> 3 2_1(7) -> 6 2_1(8) -> 10 2_1(14) -> 1 2_1(14) -> 5 2_1(14) -> 23 2_1(14) -> 24 2_1(14) -> 28 2_1(14) -> 50 2_1(14) -> 88 2_1(14) -> 145 2_1(14) -> 180 2_1(14) -> 207 2_1(17) -> 15 2_1(23) -> 30 2_1(42) -> 30 2_1(43) -> 18 2_1(46) -> 25 2_1(48) -> 19 2_1(50) -> 49 2_1(63) -> 14 2_1(86) -> 63 2_2(7) -> 150 2_2(14) -> 140 2_2(35) -> 34 2_2(36) -> 35 2_2(37) -> 28 2_2(39) -> 38 2_2(46) -> 150 2_2(55) -> 54 2_2(63) -> 28 2_2(82) -> 81 2_2(86) -> 28 2_2(103) -> 102 2_2(113) -> 112 2_2(114) -> 113 2_2(119) -> 118 2_2(121) -> 117 2_2(124) -> 19 2_2(130) -> 129 2_2(145) -> 144 2_2(151) -> 44 2_2(154) -> 160 2_2(156) -> 148 2_2(157) -> 147 2_2(161) -> 159 2_2(180) -> 153 2_2(183) -> 161 2_2(188) -> 187 2_2(197) -> 186 2_2(206) -> 205 2_2(211) -> 210 2_2(212) -> 129 2_2(216) -> 215 2_2(217) -> 129 2_3(238) -> 237 3_0(1) -> 1 3_1(1) -> 50 3_1(2) -> 1 3_1(2) -> 2 3_1(2) -> 5 3_1(2) -> 23 3_1(2) -> 24 3_1(2) -> 28 3_1(2) -> 29 3_1(2) -> 50 3_1(2) -> 145 3_1(2) -> 180 3_1(3) -> 41 3_1(5) -> 17 3_1(7) -> 44 3_1(10) -> 9 3_1(14) -> 50 3_1(17) -> 61 3_1(19) -> 1 3_1(19) -> 23 3_1(19) -> 50 3_1(19) -> 180 3_1(20) -> 18 3_1(21) -> 20 3_1(22) -> 14 3_1(27) -> 3 3_1(44) -> 43 3_1(46) -> 23 3_1(50) -> 1 3_1(50) -> 23 3_1(56) -> 3 3_1(61) -> 63 3_1(63) -> 50 3_1(69) -> 6 3_1(86) -> 2 3_1(88) -> 86 3_1(91) -> 90 3_1(92) -> 99 3_1(145) -> 145 3_2(6) -> 145 3_2(8) -> 145 3_2(14) -> 130 3_2(23) -> 145 3_2(36) -> 39 3_2(37) -> 130 3_2(42) -> 145 3_2(44) -> 44 3_2(46) -> 180 3_2(52) -> 3 3_2(52) -> 5 3_2(52) -> 23 3_2(52) -> 50 3_2(52) -> 121 3_2(63) -> 212 3_2(80) -> 23 3_2(80) -> 180 3_2(83) -> 82 3_2(86) -> 217 3_2(100) -> 1 3_2(100) -> 18 3_2(100) -> 23 3_2(100) -> 50 3_2(100) -> 180 3_2(111) -> 2 3_2(111) -> 21 3_2(111) -> 29 3_2(114) -> 122 3_2(120) -> 119 3_2(122) -> 121 3_2(125) -> 124 3_2(138) -> 101 3_2(141) -> 43 3_2(141) -> 44 3_2(146) -> 44 3_2(153) -> 161 3_2(154) -> 153 3_2(155) -> 154 3_2(184) -> 183 3_2(186) -> 185 3_2(191) -> 190 3_2(207) -> 206 3_2(212) -> 211 3_2(217) -> 216 3_3(235) -> 44 4_0(1) -> 1 4_1(1) -> 46 4_1(2) -> 7 4_1(7) -> 44 4_1(8) -> 7 4_1(12) -> 25 4_1(13) -> 12 4_1(14) -> 1 4_1(14) -> 23 4_1(14) -> 46 4_1(14) -> 50 4_1(14) -> 180 4_1(27) -> 9 4_1(40) -> 1 4_1(40) -> 24 4_1(40) -> 28 4_1(46) -> 47 4_1(47) -> 44 4_1(48) -> 46 4_1(49) -> 25 4_1(61) -> 60 4_1(63) -> 2 4_1(86) -> 2 4_1(97) -> 7 4_1(98) -> 61 4_1(99) -> 90 4_1(124) -> 46 4_2(6) -> 156 4_2(8) -> 156 4_2(23) -> 156 4_2(42) -> 156 4_2(48) -> 84 4_2(63) -> 120 4_2(86) -> 120 4_2(114) -> 122 4_2(115) -> 114 4_2(120) -> 123 4_2(123) -> 122 4_2(124) -> 84 4_2(127) -> 19 4_2(144) -> 143 4_2(149) -> 148 4_2(150) -> 149 4_2(153) -> 152 4_2(159) -> 44 4_2(189) -> 188 4_2(210) -> 209 4_2(215) -> 214 5_0(1) -> 1 5_1(1) -> 8 5_1(2) -> 7 5_1(7) -> 44 5_1(12) -> 9 5_1(14) -> 8 5_1(17) -> 16 5_1(25) -> 3 5_1(26) -> 56 5_1(28) -> 27 5_1(41) -> 40 5_1(46) -> 7 5_1(49) -> 48 5_1(50) -> 98 5_1(63) -> 97 5_1(86) -> 8 5_1(90) -> 14 5_1(97) -> 1 5_1(97) -> 50 5_1(97) -> 145 5_2(6) -> 197 5_2(7) -> 189 5_2(8) -> 197 5_2(14) -> 115 5_2(23) -> 197 5_2(37) -> 115 5_2(42) -> 197 5_2(46) -> 189 5_2(63) -> 115 5_2(86) -> 115 5_2(114) -> 122 5_2(120) -> 114 5_2(128) -> 127 5_2(139) -> 138 5_2(148) -> 147 5_2(156) -> 156 5_2(190) -> 151 5_2(204) -> 44 5_2(205) -> 204 5_2(209) -> 208 5_2(214) -> 213 * Step 2: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 0(1(0(2(x1)))) -> 3(0(1(2(0(x1))))) 0(2(3(4(2(x1))))) -> 3(0(2(2(4(5(x1)))))) 0(3(4(0(2(x1))))) -> 0(3(1(0(4(2(x1)))))) 0(3(5(0(2(x1))))) -> 2(1(0(5(3(0(x1)))))) 1(0(0(2(x1)))) -> 1(0(1(1(2(0(x1)))))) 1(0(0(2(x1)))) -> 1(3(3(0(2(0(x1)))))) 1(0(0(2(x1)))) -> 2(3(0(0(1(x1))))) 1(0(0(2(x1)))) -> 3(0(0(1(1(2(x1)))))) 1(0(0(4(2(x1))))) -> 0(4(5(1(0(2(x1)))))) 1(0(2(2(x1)))) -> 1(1(1(2(2(0(x1)))))) 1(0(2(2(x1)))) -> 2(1(2(3(0(x1))))) 1(0(3(5(2(x1))))) -> 4(5(3(1(2(0(x1)))))) 1(1(0(2(2(x1))))) -> 1(1(2(0(1(2(x1)))))) 1(3(4(0(2(x1))))) -> 1(2(3(0(1(4(x1)))))) 1(3(4(2(x1)))) -> 1(1(2(3(4(x1))))) 1(3(4(2(x1)))) -> 1(2(3(3(4(5(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(4(4(4(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(4(4(5(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(5(4(5(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(5(5(4(x1)))))) 1(3(5(0(2(x1))))) -> 1(0(2(5(2(3(x1)))))) 1(3(5(2(x1)))) -> 2(3(1(0(5(x1))))) 1(3(5(2(x1)))) -> 4(5(1(2(3(x1))))) 3(1(0(0(2(x1))))) -> 3(0(1(2(2(0(x1)))))) 3(1(0(2(x1)))) -> 3(0(1(2(0(x1))))) 3(1(3(5(2(x1))))) -> 3(0(3(5(1(2(x1)))))) 3(3(4(0(2(x1))))) -> 3(0(0(4(2(3(x1)))))) 3(4(0(0(2(x1))))) -> 3(0(0(4(4(2(x1)))))) 3(4(0(2(x1)))) -> 2(0(4(3(3(0(x1)))))) 3(4(0(2(x1)))) -> 3(0(0(2(4(x1))))) 3(4(0(2(x1)))) -> 3(0(1(2(4(x1))))) 3(4(0(2(x1)))) -> 3(0(2(1(1(4(x1)))))) 3(4(0(2(x1)))) -> 3(0(5(2(4(x1))))) 3(4(0(2(x1)))) -> 3(1(0(2(4(x1))))) 3(4(0(2(x1)))) -> 3(3(0(5(2(4(x1)))))) 3(4(0(2(x1)))) -> 4(1(2(3(0(x1))))) 3(4(0(2(x1)))) -> 4(2(3(3(3(0(x1)))))) 3(4(1(0(2(x1))))) -> 3(1(2(3(0(4(x1)))))) 3(4(1(5(2(x1))))) -> 2(3(0(1(4(5(x1)))))) 3(4(2(0(2(x1))))) -> 3(2(0(4(2(3(x1)))))) 3(4(2(0(2(x1))))) -> 4(2(2(3(0(3(x1)))))) 3(5(0(0(2(x1))))) -> 0(3(0(2(4(5(x1)))))) 3(5(0(2(x1)))) -> 2(5(3(0(0(0(x1)))))) 3(5(0(2(x1)))) -> 3(0(0(2(5(4(x1)))))) 3(5(0(2(x1)))) -> 3(0(3(2(5(x1))))) 3(5(0(2(x1)))) -> 5(5(2(3(0(3(x1)))))) 3(5(0(4(2(x1))))) -> 2(0(4(4(5(3(x1)))))) 3(5(0(4(2(x1))))) -> 2(5(4(3(0(0(x1)))))) 3(5(3(4(2(x1))))) -> 0(5(4(2(3(3(x1)))))) - Signature: {0/1,1/1,3/1} / {2/1,4/1,5/1} - Obligation: derivational complexity wrt. signature {0,1,2,3,4,5} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))