/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: 0(1(2(3(1(x1))))) -> 0(0(1(1(x1)))) 0(2(2(3(3(2(5(0(4(x1))))))))) -> 0(2(2(1(3(4(1(4(x1)))))))) 0(5(1(0(1(1(2(2(1(1(2(2(2(2(x1)))))))))))))) -> 0(3(0(5(3(1(3(0(3(4(2(3(3(1(4(x1))))))))))))))) 0(5(2(1(1(4(2(5(2(0(1(3(3(3(x1)))))))))))))) -> 0(4(0(4(4(4(5(0(2(4(0(3(2(2(x1)))))))))))))) 0(5(2(3(4(0(5(3(2(4(2(2(4(0(3(4(x1)))))))))))))))) -> 0(0(0(5(1(3(2(2(3(0(1(3(2(1(x1)))))))))))))) 1(1(4(0(4(2(1(2(4(5(3(x1))))))))))) -> 1(1(0(1(5(2(2(0(2(4(x1)))))))))) 2(2(0(1(4(3(5(4(2(2(5(1(0(5(0(5(4(5(2(x1))))))))))))))))))) -> 3(3(4(2(0(4(5(2(5(2(0(0(4(4(3(5(1(4(5(2(x1)))))))))))))))))))) 2(2(5(5(2(2(1(x1))))))) -> 3(2(3(3(1(0(x1)))))) 2(3(0(3(2(3(1(1(4(2(5(3(4(2(5(2(5(0(2(3(1(x1))))))))))))))))))))) -> 3(2(4(3(2(1(3(3(1(0(1(1(3(3(0(3(0(5(1(x1))))))))))))))))))) 2(3(0(4(0(0(5(2(4(x1))))))))) -> 3(2(2(2(3(0(4(0(4(x1))))))))) 2(3(5(3(3(4(1(5(1(2(x1)))))))))) -> 2(0(3(5(2(5(1(3(4(2(x1)))))))))) 2(4(3(3(3(5(0(1(3(x1))))))))) -> 0(1(0(0(5(0(5(x1))))))) 2(5(3(4(1(3(2(5(3(1(1(2(2(1(0(2(4(3(3(x1))))))))))))))))))) -> 0(3(5(2(3(1(1(0(3(4(3(4(0(0(5(2(2(3(x1)))))))))))))))))) 3(0(1(2(4(0(0(3(3(4(x1)))))))))) -> 3(1(5(0(4(2(0(2(5(4(x1)))))))))) 3(0(2(3(2(0(3(3(2(1(2(2(0(1(3(x1))))))))))))))) -> 2(1(5(3(2(1(2(2(0(4(0(1(3(1(x1)))))))))))))) 3(1(2(1(3(1(2(2(4(1(1(3(2(4(4(3(2(0(3(4(5(x1))))))))))))))))))))) -> 2(5(5(1(1(2(1(0(1(3(1(0(5(2(4(1(1(5(x1)))))))))))))))))) 3(1(2(4(0(0(3(3(1(4(5(x1))))))))))) -> 2(3(1(1(4(0(4(2(2(2(5(x1))))))))))) 4(3(0(4(1(0(4(1(5(0(3(x1))))))))))) -> 0(4(2(3(0(0(1(5(5(1(x1)))))))))) 4(4(2(5(3(3(1(1(3(1(1(0(5(3(1(4(x1)))))))))))))))) -> 4(2(4(4(4(2(1(5(5(4(3(3(0(5(1(5(4(x1))))))))))))))))) 4(5(2(1(1(3(4(x1))))))) -> 1(1(0(5(0(x1))))) 4(5(2(3(5(x1))))) -> 4(4(0(5(x1)))) 5(3(1(5(0(1(4(4(2(4(3(2(5(0(4(1(0(4(4(x1))))))))))))))))))) -> 5(2(2(4(1(1(5(2(3(4(2(5(2(0(2(0(2(5(4(x1))))))))))))))))))) 5(3(2(4(3(2(x1)))))) -> 5(3(0(5(4(x1))))) 5(3(5(1(1(5(4(2(2(4(1(5(0(5(4(3(x1)))))))))))))))) -> 0(0(4(2(2(1(3(2(1(0(5(1(1(1(x1)))))))))))))) 5(4(3(1(3(4(5(3(0(1(3(4(0(2(2(4(3(3(0(5(3(x1))))))))))))))))))))) -> 5(5(1(1(5(2(4(0(0(1(0(1(2(0(5(1(3(5(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) -> 73 0_1(2) -> 1 0_1(2) -> 2 0_1(2) -> 10 0_1(2) -> 33 0_1(2) -> 51 0_1(2) -> 73 0_1(2) -> 87 0_1(2) -> 105 0_1(2) -> 106 0_1(2) -> 162 0_1(3) -> 2 0_1(4) -> 2 0_1(10) -> 93 0_1(12) -> 11 0_1(17) -> 16 0_1(23) -> 22 0_1(28) -> 27 0_1(31) -> 30 0_1(34) -> 3 0_1(41) -> 40 0_1(44) -> 73 0_1(46) -> 45 0_1(51) -> 50 0_1(56) -> 55 0_1(62) -> 61 0_1(63) -> 62 0_1(81) -> 80 0_1(86) -> 85 0_1(88) -> 87 0_1(92) -> 91 0_1(95) -> 94 0_1(103) -> 102 0_1(104) -> 103 0_1(106) -> 105 0_1(112) -> 111 0_1(117) -> 116 0_1(118) -> 117 0_1(124) -> 123 0_1(125) -> 194 0_1(127) -> 126 0_1(128) -> 195 0_1(129) -> 73 0_1(136) -> 135 0_1(138) -> 137 0_1(146) -> 145 0_1(150) -> 149 0_1(159) -> 158 0_1(165) -> 164 0_1(166) -> 165 0_1(168) -> 73 0_1(180) -> 179 0_1(207) -> 206 0_1(215) -> 214 0_1(216) -> 215 0_1(218) -> 217 0_1(221) -> 220 0_2(198) -> 197 0_2(224) -> 2 0_2(224) -> 137 0_2(225) -> 224 1_0(1) -> 1 1_1(1) -> 4 1_1(2) -> 9 1_1(3) -> 208 1_1(4) -> 3 1_1(7) -> 6 1_1(10) -> 9 1_1(11) -> 4 1_1(15) -> 14 1_1(36) -> 35 1_1(42) -> 41 1_1(44) -> 1 1_1(44) -> 3 1_1(44) -> 4 1_1(44) -> 10 1_1(44) -> 68 1_1(45) -> 44 1_1(47) -> 46 1_1(52) -> 4 1_1(68) -> 67 1_1(73) -> 72 1_1(77) -> 76 1_1(80) -> 79 1_1(82) -> 81 1_1(83) -> 82 1_1(100) -> 99 1_1(102) -> 2 1_1(106) -> 154 1_1(110) -> 109 1_1(111) -> 110 1_1(122) -> 52 1_1(128) -> 181 1_1(129) -> 94 1_1(133) -> 132 1_1(139) -> 138 1_1(142) -> 141 1_1(143) -> 142 1_1(145) -> 144 1_1(147) -> 146 1_1(149) -> 148 1_1(154) -> 153 1_1(155) -> 3 1_1(156) -> 155 1_1(157) -> 156 1_1(167) -> 166 1_1(168) -> 4 1_1(174) -> 173 1_1(186) -> 185 1_1(187) -> 186 1_1(203) -> 202 1_1(206) -> 205 1_1(210) -> 209 1_1(211) -> 210 1_1(217) -> 216 1_1(219) -> 218 1_1(223) -> 222 1_2(156) -> 226 1_2(226) -> 225 2_0(1) -> 1 2_1(1) -> 33 2_1(4) -> 43 2_1(5) -> 2 2_1(6) -> 5 2_1(10) -> 51 2_1(20) -> 19 2_1(29) -> 28 2_1(33) -> 32 2_1(38) -> 37 2_1(39) -> 38 2_1(49) -> 48 2_1(50) -> 49 2_1(52) -> 33 2_1(53) -> 33 2_1(55) -> 54 2_1(59) -> 58 2_1(61) -> 60 2_1(70) -> 52 2_1(76) -> 75 2_1(89) -> 70 2_1(90) -> 89 2_1(94) -> 1 2_1(94) -> 33 2_1(94) -> 120 2_1(94) -> 121 2_1(94) -> 139 2_1(98) -> 97 2_1(106) -> 162 2_1(108) -> 107 2_1(120) -> 119 2_1(121) -> 120 2_1(126) -> 125 2_1(128) -> 127 2_1(132) -> 131 2_1(134) -> 133 2_1(135) -> 134 2_1(144) -> 143 2_1(152) -> 151 2_1(161) -> 160 2_1(162) -> 161 2_1(163) -> 22 2_1(169) -> 168 2_1(173) -> 172 2_1(183) -> 182 2_1(184) -> 183 2_1(189) -> 188 2_1(192) -> 191 2_1(194) -> 193 2_1(201) -> 200 2_1(202) -> 201 2_1(205) -> 204 2_1(213) -> 212 2_1(220) -> 219 3_0(1) -> 1 3_1(1) -> 121 3_1(4) -> 139 3_1(8) -> 7 3_1(9) -> 21 3_1(11) -> 2 3_1(14) -> 13 3_1(16) -> 15 3_1(18) -> 17 3_1(21) -> 20 3_1(32) -> 31 3_1(37) -> 36 3_1(40) -> 39 3_1(43) -> 42 3_1(52) -> 1 3_1(52) -> 32 3_1(52) -> 33 3_1(52) -> 120 3_1(52) -> 121 3_1(52) -> 161 3_1(53) -> 52 3_1(66) -> 65 3_1(71) -> 70 3_1(72) -> 71 3_1(75) -> 74 3_1(78) -> 77 3_1(79) -> 78 3_1(84) -> 83 3_1(85) -> 84 3_1(87) -> 86 3_1(91) -> 90 3_1(96) -> 95 3_1(101) -> 100 3_1(105) -> 86 3_1(106) -> 223 3_1(109) -> 108 3_1(113) -> 112 3_1(115) -> 114 3_1(131) -> 130 3_1(148) -> 147 3_1(155) -> 94 3_1(164) -> 163 3_1(178) -> 177 3_1(179) -> 178 3_1(190) -> 189 3_1(195) -> 182 3_1(204) -> 203 3_2(197) -> 196 4_0(1) -> 1 4_1(1) -> 10 4_1(9) -> 8 4_1(19) -> 18 4_1(22) -> 2 4_1(24) -> 23 4_1(25) -> 24 4_1(26) -> 25 4_1(30) -> 29 4_1(33) -> 101 4_1(52) -> 10 4_1(54) -> 53 4_1(57) -> 56 4_1(64) -> 63 4_1(65) -> 64 4_1(69) -> 68 4_1(70) -> 10 4_1(74) -> 70 4_1(76) -> 10 4_1(93) -> 92 4_1(94) -> 10 4_1(105) -> 168 4_1(114) -> 113 4_1(116) -> 115 4_1(125) -> 124 4_1(137) -> 136 4_1(153) -> 152 4_1(158) -> 157 4_1(160) -> 159 4_1(168) -> 1 4_1(168) -> 10 4_1(168) -> 68 4_1(170) -> 169 4_1(171) -> 170 4_1(172) -> 171 4_1(177) -> 176 4_1(185) -> 184 4_1(191) -> 190 4_1(195) -> 10 4_1(200) -> 3 4_1(214) -> 213 4_2(76) -> 199 5_0(1) -> 1 5_1(1) -> 106 5_1(4) -> 88 5_1(9) -> 66 5_1(10) -> 128 5_1(13) -> 12 5_1(27) -> 26 5_1(32) -> 118 5_1(33) -> 69 5_1(35) -> 34 5_1(48) -> 47 5_1(52) -> 106 5_1(53) -> 128 5_1(58) -> 57 5_1(60) -> 59 5_1(67) -> 66 5_1(73) -> 46 5_1(88) -> 167 5_1(97) -> 96 5_1(99) -> 98 5_1(105) -> 104 5_1(107) -> 11 5_1(119) -> 118 5_1(123) -> 122 5_1(130) -> 129 5_1(140) -> 94 5_1(141) -> 140 5_1(151) -> 150 5_1(155) -> 2 5_1(168) -> 128 5_1(175) -> 174 5_1(176) -> 175 5_1(181) -> 180 5_1(182) -> 1 5_1(182) -> 106 5_1(182) -> 128 5_1(188) -> 187 5_1(193) -> 192 5_1(195) -> 106 5_1(208) -> 207 5_1(209) -> 182 5_1(212) -> 211 5_1(222) -> 221 5_2(196) -> 69 5_2(196) -> 106 5_2(196) -> 118 5_2(199) -> 198 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 0(1(2(3(1(x1))))) -> 0(0(1(1(x1)))) 0(2(2(3(3(2(5(0(4(x1))))))))) -> 0(2(2(1(3(4(1(4(x1)))))))) 0(5(1(0(1(1(2(2(1(1(2(2(2(2(x1)))))))))))))) -> 0(3(0(5(3(1(3(0(3(4(2(3(3(1(4(x1))))))))))))))) 0(5(2(1(1(4(2(5(2(0(1(3(3(3(x1)))))))))))))) -> 0(4(0(4(4(4(5(0(2(4(0(3(2(2(x1)))))))))))))) 0(5(2(3(4(0(5(3(2(4(2(2(4(0(3(4(x1)))))))))))))))) -> 0(0(0(5(1(3(2(2(3(0(1(3(2(1(x1)))))))))))))) 1(1(4(0(4(2(1(2(4(5(3(x1))))))))))) -> 1(1(0(1(5(2(2(0(2(4(x1)))))))))) 2(2(0(1(4(3(5(4(2(2(5(1(0(5(0(5(4(5(2(x1))))))))))))))))))) -> 3(3(4(2(0(4(5(2(5(2(0(0(4(4(3(5(1(4(5(2(x1)))))))))))))))))))) 2(2(5(5(2(2(1(x1))))))) -> 3(2(3(3(1(0(x1)))))) 2(3(0(3(2(3(1(1(4(2(5(3(4(2(5(2(5(0(2(3(1(x1))))))))))))))))))))) -> 3(2(4(3(2(1(3(3(1(0(1(1(3(3(0(3(0(5(1(x1))))))))))))))))))) 2(3(0(4(0(0(5(2(4(x1))))))))) -> 3(2(2(2(3(0(4(0(4(x1))))))))) 2(3(5(3(3(4(1(5(1(2(x1)))))))))) -> 2(0(3(5(2(5(1(3(4(2(x1)))))))))) 2(4(3(3(3(5(0(1(3(x1))))))))) -> 0(1(0(0(5(0(5(x1))))))) 2(5(3(4(1(3(2(5(3(1(1(2(2(1(0(2(4(3(3(x1))))))))))))))))))) -> 0(3(5(2(3(1(1(0(3(4(3(4(0(0(5(2(2(3(x1)))))))))))))))))) 3(0(1(2(4(0(0(3(3(4(x1)))))))))) -> 3(1(5(0(4(2(0(2(5(4(x1)))))))))) 3(0(2(3(2(0(3(3(2(1(2(2(0(1(3(x1))))))))))))))) -> 2(1(5(3(2(1(2(2(0(4(0(1(3(1(x1)))))))))))))) 3(1(2(1(3(1(2(2(4(1(1(3(2(4(4(3(2(0(3(4(5(x1))))))))))))))))))))) -> 2(5(5(1(1(2(1(0(1(3(1(0(5(2(4(1(1(5(x1)))))))))))))))))) 3(1(2(4(0(0(3(3(1(4(5(x1))))))))))) -> 2(3(1(1(4(0(4(2(2(2(5(x1))))))))))) 4(3(0(4(1(0(4(1(5(0(3(x1))))))))))) -> 0(4(2(3(0(0(1(5(5(1(x1)))))))))) 4(4(2(5(3(3(1(1(3(1(1(0(5(3(1(4(x1)))))))))))))))) -> 4(2(4(4(4(2(1(5(5(4(3(3(0(5(1(5(4(x1))))))))))))))))) 4(5(2(1(1(3(4(x1))))))) -> 1(1(0(5(0(x1))))) 4(5(2(3(5(x1))))) -> 4(4(0(5(x1)))) 5(3(1(5(0(1(4(4(2(4(3(2(5(0(4(1(0(4(4(x1))))))))))))))))))) -> 5(2(2(4(1(1(5(2(3(4(2(5(2(0(2(0(2(5(4(x1))))))))))))))))))) 5(3(2(4(3(2(x1)))))) -> 5(3(0(5(4(x1))))) 5(3(5(1(1(5(4(2(2(4(1(5(0(5(4(3(x1)))))))))))))))) -> 0(0(4(2(2(1(3(2(1(0(5(1(1(1(x1)))))))))))))) 5(4(3(1(3(4(5(3(0(1(3(4(0(2(2(4(3(3(0(5(3(x1))))))))))))))))))))) -> 5(5(1(1(5(2(4(0(0(1(0(1(2(0(5(1(3(5(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))