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