/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(0(5(2(2(0(x1)))))) -> 3(5(0(3(2(x1))))) 0(1(2(2(x1)))) -> 3(3(2(x1))) 0(4(4(2(5(4(5(0(3(5(3(4(3(1(4(1(2(1(0(x1))))))))))))))))))) -> 3(0(4(0(2(0(5(3(2(5(3(4(4(3(4(4(3(4(x1)))))))))))))))))) 0(5(1(5(4(0(4(1(0(x1))))))))) -> 2(4(2(1(1(2(5(5(x1)))))))) 1(1(1(5(1(0(5(3(1(5(4(4(0(0(x1)))))))))))))) -> 5(5(2(4(4(0(4(0(5(0(4(2(4(5(x1)))))))))))))) 1(1(5(4(0(2(0(3(4(0(2(x1))))))))))) -> 1(5(0(4(2(2(0(0(3(0(1(x1))))))))))) 1(4(1(2(3(5(3(0(0(5(3(4(2(2(2(5(2(1(x1)))))))))))))))))) -> 1(5(4(4(3(4(1(0(3(4(5(0(0(5(5(1(2(5(x1)))))))))))))))))) 1(4(3(0(0(5(1(4(3(x1))))))))) -> 5(4(2(5(2(2(4(3(x1)))))))) 2(0(1(2(0(3(x1)))))) -> 2(5(3(2(3(x1))))) 2(1(5(4(3(5(0(1(2(1(4(5(0(1(2(2(3(4(x1)))))))))))))))))) -> 0(0(0(0(4(5(2(0(2(0(1(2(5(1(5(2(1(4(x1)))))))))))))))))) 2(5(2(3(4(0(0(4(4(3(x1)))))))))) -> 3(0(3(5(2(1(2(2(3(x1))))))))) 3(3(1(4(4(2(2(1(1(3(4(x1))))))))))) -> 3(3(3(5(5(5(4(1(2(3(x1)))))))))) 4(0(0(5(2(4(3(4(3(4(4(0(0(3(x1)))))))))))))) -> 3(0(3(4(0(1(2(4(0(5(2(5(3(x1))))))))))))) 4(0(1(5(3(3(4(0(4(4(4(5(4(0(2(x1))))))))))))))) -> 4(4(0(1(5(5(3(1(3(4(1(4(4(4(1(x1))))))))))))))) 4(1(1(0(2(x1))))) -> 0(3(2(0(x1)))) 4(1(5(0(3(4(0(3(2(5(5(0(4(0(0(3(x1)))))))))))))))) -> 2(1(3(3(4(2(1(4(3(0(0(0(1(2(3(x1))))))))))))))) 4(2(1(3(2(4(4(2(4(2(x1)))))))))) -> 3(0(3(3(4(1(3(4(2(2(x1)))))))))) 4(2(4(5(0(4(0(5(3(1(0(5(3(x1))))))))))))) -> 4(0(4(5(5(0(3(0(5(5(5(4(x1)))))))))))) 4(2(5(0(2(3(3(2(1(4(0(2(4(0(2(5(3(4(x1)))))))))))))))))) -> 4(0(2(4(5(2(2(1(0(2(3(0(5(1(4(5(2(4(x1)))))))))))))))))) 4(4(2(0(3(1(2(0(0(0(1(x1))))))))))) -> 4(0(0(3(3(1(1(5(0(1(x1)))))))))) 4(4(4(3(1(1(3(0(3(0(3(x1))))))))))) -> 1(4(3(4(4(3(5(3(0(3(x1)))))))))) 4(5(2(1(1(3(3(5(4(4(4(4(3(3(4(0(2(1(4(2(2(x1))))))))))))))))))))) -> 2(1(4(3(1(3(1(1(1(2(3(4(3(4(4(2(3(0(2(1(x1)))))))))))))))))))) 4(5(3(4(5(x1))))) -> 2(3(1(5(x1)))) 4(5(4(0(3(0(2(1(5(5(4(2(2(x1))))))))))))) -> 2(1(0(0(1(2(0(0(4(0(1(2(3(3(x1)))))))))))))) 5(2(5(0(1(1(3(0(4(4(2(4(3(2(x1)))))))))))))) -> 5(3(2(0(1(2(5(1(2(2(5(1(3(x1))))))))))))) - Signature: {0/1,1/1,2/1,3/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 2. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_1(1) -> 168 0_1(4) -> 3 0_1(6) -> 2 0_1(9) -> 8 0_1(11) -> 10 0_1(38) -> 168 0_1(50) -> 49 0_1(52) -> 51 0_1(54) -> 53 0_1(59) -> 58 0_1(63) -> 62 0_1(64) -> 63 0_1(66) -> 65 0_1(72) -> 71 0_1(76) -> 75 0_1(77) -> 76 0_1(86) -> 229 0_1(89) -> 1 0_1(89) -> 5 0_1(89) -> 29 0_1(89) -> 166 0_1(89) -> 245 0_1(89) -> 266 0_1(90) -> 89 0_1(91) -> 90 0_1(92) -> 91 0_1(96) -> 95 0_1(98) -> 97 0_1(109) -> 178 0_1(123) -> 178 0_1(131) -> 130 0_1(139) -> 138 0_1(156) -> 155 0_1(177) -> 176 0_1(178) -> 177 0_1(196) -> 154 0_1(200) -> 199 0_1(202) -> 201 0_1(211) -> 210 0_1(214) -> 213 0_1(218) -> 196 0_1(245) -> 244 0_1(247) -> 169 0_1(248) -> 247 0_1(251) -> 250 0_1(252) -> 251 0_1(257) -> 256 1_0(1) -> 1 1_1(1) -> 66 1_1(5) -> 109 1_1(29) -> 104 1_1(38) -> 66 1_1(41) -> 40 1_1(42) -> 41 1_1(44) -> 246 1_1(56) -> 215 1_1(57) -> 1 1_1(57) -> 29 1_1(57) -> 66 1_1(57) -> 104 1_1(71) -> 70 1_1(80) -> 79 1_1(86) -> 264 1_1(88) -> 123 1_1(99) -> 98 1_1(102) -> 101 1_1(110) -> 109 1_1(132) -> 131 1_1(157) -> 156 1_1(161) -> 160 1_1(164) -> 163 1_1(169) -> 38 1_1(174) -> 173 1_1(184) -> 183 1_1(205) -> 66 1_1(210) -> 209 1_1(216) -> 215 1_1(221) -> 220 1_1(222) -> 221 1_1(232) -> 231 1_1(234) -> 233 1_1(235) -> 234 1_1(236) -> 235 1_1(249) -> 248 1_1(258) -> 257 1_1(261) -> 260 2_0(1) -> 1 2_1(1) -> 5 2_1(5) -> 110 2_1(10) -> 9 2_1(18) -> 17 2_1(29) -> 84 2_1(38) -> 1 2_1(38) -> 5 2_1(38) -> 29 2_1(38) -> 56 2_1(38) -> 166 2_1(38) -> 167 2_1(38) -> 168 2_1(38) -> 266 2_1(39) -> 110 2_1(40) -> 39 2_1(43) -> 42 2_1(44) -> 80 2_1(47) -> 46 2_1(56) -> 55 2_1(57) -> 84 2_1(61) -> 60 2_1(62) -> 61 2_1(66) -> 245 2_1(82) -> 81 2_1(84) -> 83 2_1(85) -> 84 2_1(86) -> 88 2_1(88) -> 110 2_1(89) -> 5 2_1(95) -> 94 2_1(97) -> 96 2_1(100) -> 99 2_1(104) -> 103 2_1(109) -> 108 2_1(133) -> 132 2_1(143) -> 142 2_1(168) -> 167 2_1(173) -> 172 2_1(205) -> 196 2_1(208) -> 207 2_1(209) -> 208 2_1(212) -> 211 2_1(218) -> 5 2_1(237) -> 236 2_1(243) -> 242 2_1(250) -> 249 2_1(256) -> 255 2_1(259) -> 258 2_1(262) -> 261 2_1(263) -> 262 2_2(1) -> 266 2_2(38) -> 266 2_2(40) -> 266 2_2(86) -> 266 2_2(89) -> 266 2_2(218) -> 266 3_0(1) -> 1 3_1(1) -> 86 3_1(2) -> 1 3_1(2) -> 5 3_1(2) -> 29 3_1(2) -> 80 3_1(2) -> 168 3_1(2) -> 266 3_1(4) -> 1 3_1(4) -> 65 3_1(4) -> 168 3_1(4) -> 178 3_1(5) -> 4 3_1(17) -> 16 3_1(23) -> 22 3_1(26) -> 25 3_1(29) -> 28 3_1(38) -> 1 3_1(39) -> 86 3_1(65) -> 64 3_1(66) -> 38 3_1(69) -> 68 3_1(73) -> 72 3_1(86) -> 86 3_1(88) -> 87 3_1(106) -> 6 3_1(143) -> 226 3_1(154) -> 86 3_1(160) -> 159 3_1(162) -> 161 3_1(167) -> 89 3_1(168) -> 228 3_1(170) -> 169 3_1(171) -> 170 3_1(176) -> 175 3_1(181) -> 106 3_1(185) -> 184 3_1(201) -> 200 3_1(204) -> 226 3_1(213) -> 212 3_1(219) -> 218 3_1(220) -> 219 3_1(224) -> 223 3_1(227) -> 226 3_1(229) -> 228 3_1(231) -> 230 3_1(233) -> 232 3_1(238) -> 237 3_1(240) -> 239 3_1(244) -> 243 3_1(246) -> 38 3_1(255) -> 45 3_2(265) -> 178 3_2(266) -> 265 4_0(1) -> 1 4_1(1) -> 29 4_1(2) -> 29 4_1(4) -> 29 4_1(8) -> 6 4_1(24) -> 23 4_1(25) -> 24 4_1(27) -> 26 4_1(28) -> 27 4_1(38) -> 29 4_1(39) -> 38 4_1(44) -> 56 4_1(48) -> 47 4_1(49) -> 48 4_1(51) -> 50 4_1(55) -> 54 4_1(60) -> 59 4_1(66) -> 166 4_1(67) -> 58 4_1(68) -> 67 4_1(70) -> 69 4_1(74) -> 73 4_1(81) -> 45 4_1(86) -> 85 4_1(89) -> 29 4_1(93) -> 92 4_1(110) -> 185 4_1(123) -> 122 4_1(130) -> 106 4_1(138) -> 133 4_1(154) -> 1 4_1(154) -> 29 4_1(154) -> 54 4_1(155) -> 154 4_1(163) -> 162 4_1(165) -> 164 4_1(166) -> 165 4_1(172) -> 171 4_1(175) -> 174 4_1(178) -> 252 4_1(183) -> 181 4_1(197) -> 196 4_1(206) -> 205 4_1(217) -> 216 4_1(223) -> 57 4_1(225) -> 224 4_1(226) -> 225 4_1(230) -> 169 4_1(239) -> 238 4_1(241) -> 240 4_1(242) -> 241 4_1(247) -> 29 4_1(255) -> 29 5_0(1) -> 1 5_1(1) -> 44 5_1(3) -> 2 5_1(4) -> 38 5_1(16) -> 11 5_1(22) -> 18 5_1(29) -> 204 5_1(44) -> 43 5_1(45) -> 1 5_1(45) -> 44 5_1(45) -> 66 5_1(45) -> 104 5_1(45) -> 139 5_1(46) -> 45 5_1(53) -> 52 5_1(57) -> 44 5_1(58) -> 57 5_1(65) -> 222 5_1(66) -> 263 5_1(75) -> 74 5_1(78) -> 77 5_1(79) -> 78 5_1(80) -> 139 5_1(83) -> 82 5_1(84) -> 217 5_1(86) -> 143 5_1(87) -> 38 5_1(89) -> 44 5_1(90) -> 44 5_1(94) -> 93 5_1(101) -> 100 5_1(103) -> 102 5_1(108) -> 106 5_1(121) -> 3 5_1(122) -> 121 5_1(142) -> 139 5_1(158) -> 157 5_1(159) -> 158 5_1(169) -> 44 5_1(198) -> 197 5_1(199) -> 198 5_1(203) -> 202 5_1(204) -> 203 5_1(207) -> 206 5_1(215) -> 214 5_1(218) -> 44 5_1(228) -> 227 5_1(245) -> 102 5_1(260) -> 259 5_1(264) -> 263 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 0(0(5(2(2(0(x1)))))) -> 3(5(0(3(2(x1))))) 0(1(2(2(x1)))) -> 3(3(2(x1))) 0(4(4(2(5(4(5(0(3(5(3(4(3(1(4(1(2(1(0(x1))))))))))))))))))) -> 3(0(4(0(2(0(5(3(2(5(3(4(4(3(4(4(3(4(x1)))))))))))))))))) 0(5(1(5(4(0(4(1(0(x1))))))))) -> 2(4(2(1(1(2(5(5(x1)))))))) 1(1(1(5(1(0(5(3(1(5(4(4(0(0(x1)))))))))))))) -> 5(5(2(4(4(0(4(0(5(0(4(2(4(5(x1)))))))))))))) 1(1(5(4(0(2(0(3(4(0(2(x1))))))))))) -> 1(5(0(4(2(2(0(0(3(0(1(x1))))))))))) 1(4(1(2(3(5(3(0(0(5(3(4(2(2(2(5(2(1(x1)))))))))))))))))) -> 1(5(4(4(3(4(1(0(3(4(5(0(0(5(5(1(2(5(x1)))))))))))))))))) 1(4(3(0(0(5(1(4(3(x1))))))))) -> 5(4(2(5(2(2(4(3(x1)))))))) 2(0(1(2(0(3(x1)))))) -> 2(5(3(2(3(x1))))) 2(1(5(4(3(5(0(1(2(1(4(5(0(1(2(2(3(4(x1)))))))))))))))))) -> 0(0(0(0(4(5(2(0(2(0(1(2(5(1(5(2(1(4(x1)))))))))))))))))) 2(5(2(3(4(0(0(4(4(3(x1)))))))))) -> 3(0(3(5(2(1(2(2(3(x1))))))))) 3(3(1(4(4(2(2(1(1(3(4(x1))))))))))) -> 3(3(3(5(5(5(4(1(2(3(x1)))))))))) 4(0(0(5(2(4(3(4(3(4(4(0(0(3(x1)))))))))))))) -> 3(0(3(4(0(1(2(4(0(5(2(5(3(x1))))))))))))) 4(0(1(5(3(3(4(0(4(4(4(5(4(0(2(x1))))))))))))))) -> 4(4(0(1(5(5(3(1(3(4(1(4(4(4(1(x1))))))))))))))) 4(1(1(0(2(x1))))) -> 0(3(2(0(x1)))) 4(1(5(0(3(4(0(3(2(5(5(0(4(0(0(3(x1)))))))))))))))) -> 2(1(3(3(4(2(1(4(3(0(0(0(1(2(3(x1))))))))))))))) 4(2(1(3(2(4(4(2(4(2(x1)))))))))) -> 3(0(3(3(4(1(3(4(2(2(x1)))))))))) 4(2(4(5(0(4(0(5(3(1(0(5(3(x1))))))))))))) -> 4(0(4(5(5(0(3(0(5(5(5(4(x1)))))))))))) 4(2(5(0(2(3(3(2(1(4(0(2(4(0(2(5(3(4(x1)))))))))))))))))) -> 4(0(2(4(5(2(2(1(0(2(3(0(5(1(4(5(2(4(x1)))))))))))))))))) 4(4(2(0(3(1(2(0(0(0(1(x1))))))))))) -> 4(0(0(3(3(1(1(5(0(1(x1)))))))))) 4(4(4(3(1(1(3(0(3(0(3(x1))))))))))) -> 1(4(3(4(4(3(5(3(0(3(x1)))))))))) 4(5(2(1(1(3(3(5(4(4(4(4(3(3(4(0(2(1(4(2(2(x1))))))))))))))))))))) -> 2(1(4(3(1(3(1(1(1(2(3(4(3(4(4(2(3(0(2(1(x1)))))))))))))))))))) 4(5(3(4(5(x1))))) -> 2(3(1(5(x1)))) 4(5(4(0(3(0(2(1(5(5(4(2(2(x1))))))))))))) -> 2(1(0(0(1(2(0(0(4(0(1(2(3(3(x1)))))))))))))) 5(2(5(0(1(1(3(0(4(4(2(4(3(2(x1)))))))))))))) -> 5(3(2(0(1(2(5(1(2(2(5(1(3(x1))))))))))))) - Signature: {0/1,1/1,2/1,3/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))