/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(0(4(x1))) -> 1(1(5(2(3(4(x1)))))) 0(1(1(x1))) -> 0(2(2(1(1(1(x1)))))) 0(1(3(x1))) -> 0(2(4(3(4(4(x1)))))) 0(2(4(x1))) -> 1(5(4(3(4(4(x1)))))) 0(4(x1)) -> 0(1(4(2(3(3(x1)))))) 0(4(x1)) -> 0(2(1(4(3(4(x1)))))) 0(4(0(x1))) -> 0(1(2(1(0(3(x1)))))) 1(2(3(x1))) -> 5(1(4(1(4(4(x1)))))) 1(3(3(x1))) -> 0(2(1(1(0(5(x1)))))) 1(3(3(x1))) -> 5(4(0(3(2(3(x1)))))) 1(3(5(x1))) -> 1(1(4(3(3(2(x1)))))) 2(0(0(x1))) -> 2(4(3(4(4(4(x1)))))) 2(0(1(x1))) -> 2(1(5(1(0(1(x1)))))) 2(0(1(x1))) -> 2(4(3(5(2(3(x1)))))) 2(0(4(x1))) -> 2(0(2(1(4(3(x1)))))) 2(0(4(x1))) -> 2(4(1(4(3(1(x1)))))) 3(0(1(x1))) -> 3(1(4(3(4(1(x1)))))) 3(0(5(x1))) -> 3(1(0(2(3(2(x1)))))) 4(0(0(x1))) -> 2(5(2(1(1(1(x1)))))) 4(0(5(x1))) -> 4(1(4(5(1(4(x1)))))) 4(0(5(x1))) -> 4(2(1(4(3(5(x1)))))) 5(0(2(x1))) -> 1(5(2(1(0(2(x1)))))) 5(0(4(x1))) -> 1(0(3(2(4(4(x1)))))) 5(0(4(x1))) -> 1(5(1(0(3(4(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 = perSymbol, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_0(2) -> 1 0_0(3) -> 1 0_0(4) -> 1 0_0(5) -> 1 0_0(6) -> 1 0_1(1) -> 52 0_1(7) -> 37 0_1(10) -> 28 0_1(11) -> 95 0_1(12) -> 1 0_1(12) -> 52 0_1(12) -> 95 0_1(16) -> 52 0_1(27) -> 30 0_1(34) -> 2 0_1(34) -> 16 0_1(38) -> 37 0_1(40) -> 39 0_1(42) -> 1 0_1(46) -> 95 0_1(62) -> 47 0_1(75) -> 28 0_1(85) -> 1 0_1(101) -> 7 0_2(1) -> 56 0_2(57) -> 56 0_2(100) -> 99 0_2(106) -> 52 0_2(106) -> 56 0_2(111) -> 37 0_2(111) -> 52 0_2(111) -> 56 0_2(144) -> 95 0_2(148) -> 154 1_0(1) -> 2 1_0(2) -> 2 1_0(3) -> 2 1_0(4) -> 2 1_0(5) -> 2 1_0(6) -> 2 1_1(1) -> 16 1_1(2) -> 16 1_1(3) -> 16 1_1(4) -> 16 1_1(5) -> 16 1_1(6) -> 16 1_1(7) -> 1 1_1(7) -> 6 1_1(7) -> 38 1_1(7) -> 52 1_1(7) -> 56 1_1(7) -> 95 1_1(8) -> 7 1_1(11) -> 88 1_1(12) -> 1 1_1(15) -> 14 1_1(16) -> 15 1_1(18) -> 33 1_1(19) -> 1 1_1(24) -> 12 1_1(28) -> 13 1_1(30) -> 29 1_1(32) -> 31 1_1(34) -> 1 1_1(36) -> 35 1_1(37) -> 36 1_1(42) -> 2 1_1(42) -> 16 1_1(43) -> 42 1_1(50) -> 47 1_1(52) -> 51 1_1(62) -> 16 1_1(64) -> 63 1_1(65) -> 48 1_1(68) -> 67 1_1(85) -> 16 1_1(86) -> 85 1_1(90) -> 89 1_1(92) -> 6 1_1(92) -> 38 1_1(95) -> 94 1_2(1) -> 109 1_2(7) -> 110 1_2(8) -> 115 1_2(12) -> 110 1_2(19) -> 1 1_2(19) -> 52 1_2(19) -> 95 1_2(19) -> 99 1_2(24) -> 57 1_2(34) -> 1 1_2(42) -> 1 1_2(43) -> 1 1_2(54) -> 53 1_2(56) -> 55 1_2(57) -> 109 1_2(72) -> 71 1_2(86) -> 1 1_2(92) -> 1 1_2(96) -> 38 1_2(96) -> 50 1_2(99) -> 98 1_2(109) -> 108 1_2(110) -> 109 1_2(114) -> 113 1_2(115) -> 114 1_2(134) -> 95 1_2(145) -> 144 1_2(150) -> 149 1_2(154) -> 153 1_3(139) -> 52 1_3(139) -> 56 2_0(1) -> 3 2_0(2) -> 3 2_0(3) -> 3 2_0(4) -> 3 2_0(5) -> 3 2_0(6) -> 3 2_1(1) -> 46 2_1(2) -> 46 2_1(3) -> 46 2_1(4) -> 46 2_1(5) -> 46 2_1(6) -> 46 2_1(7) -> 5 2_1(7) -> 11 2_1(7) -> 152 2_1(10) -> 9 2_1(13) -> 12 2_1(14) -> 13 2_1(15) -> 13 2_1(16) -> 13 2_1(18) -> 103 2_1(26) -> 25 2_1(27) -> 41 2_1(29) -> 24 2_1(31) -> 46 2_1(35) -> 34 2_1(45) -> 75 2_1(47) -> 3 2_1(47) -> 46 2_1(63) -> 62 2_1(89) -> 85 2_1(94) -> 93 2_2(13) -> 100 2_2(35) -> 100 2_2(53) -> 46 2_2(61) -> 60 2_2(89) -> 100 2_2(98) -> 97 2_2(107) -> 106 2_2(108) -> 107 2_2(112) -> 111 2_2(113) -> 112 2_2(147) -> 146 2_2(149) -> 144 2_2(153) -> 145 3_0(1) -> 4 3_0(2) -> 4 3_0(3) -> 4 3_0(4) -> 4 3_0(5) -> 4 3_0(6) -> 4 3_1(1) -> 27 3_1(2) -> 27 3_1(3) -> 27 3_1(4) -> 27 3_1(5) -> 27 3_1(6) -> 27 3_1(7) -> 27 3_1(11) -> 10 3_1(12) -> 27 3_1(13) -> 4 3_1(13) -> 27 3_1(13) -> 148 3_1(16) -> 66 3_1(18) -> 17 3_1(19) -> 27 3_1(24) -> 27 3_1(27) -> 26 3_1(34) -> 27 3_1(38) -> 91 3_1(41) -> 40 3_1(42) -> 27 3_1(43) -> 27 3_1(45) -> 44 3_1(46) -> 45 3_1(49) -> 48 3_1(62) -> 27 3_1(67) -> 4 3_1(67) -> 27 3_1(67) -> 148 3_1(70) -> 69 3_1(85) -> 27 3_1(86) -> 27 3_1(92) -> 27 3_1(103) -> 101 3_2(1) -> 148 3_2(2) -> 148 3_2(3) -> 148 3_2(4) -> 148 3_2(5) -> 148 3_2(6) -> 148 3_2(12) -> 148 3_2(13) -> 148 3_2(22) -> 21 3_2(24) -> 61 3_2(31) -> 148 3_2(34) -> 148 3_2(42) -> 148 3_2(43) -> 61 3_2(53) -> 151 3_2(59) -> 58 3_2(62) -> 148 3_2(67) -> 148 3_2(71) -> 27 3_2(71) -> 148 3_2(74) -> 73 3_2(85) -> 148 3_2(86) -> 61 3_2(117) -> 116 3_2(120) -> 151 3_2(137) -> 136 3_2(148) -> 147 3_2(149) -> 27 3_2(149) -> 148 3_2(152) -> 151 3_3(142) -> 141 4_0(1) -> 5 4_0(2) -> 5 4_0(3) -> 5 4_0(4) -> 5 4_0(5) -> 5 4_0(6) -> 5 4_1(1) -> 11 4_1(2) -> 11 4_1(3) -> 11 4_1(4) -> 11 4_1(5) -> 11 4_1(6) -> 11 4_1(10) -> 28 4_1(11) -> 18 4_1(12) -> 11 4_1(13) -> 11 4_1(16) -> 70 4_1(17) -> 13 4_1(18) -> 49 4_1(25) -> 24 4_1(27) -> 64 4_1(31) -> 11 4_1(33) -> 32 4_1(34) -> 11 4_1(39) -> 31 4_1(42) -> 11 4_1(44) -> 43 4_1(47) -> 18 4_1(48) -> 47 4_1(62) -> 5 4_1(62) -> 11 4_1(62) -> 152 4_1(66) -> 65 4_1(67) -> 11 4_1(69) -> 68 4_1(85) -> 5 4_1(85) -> 11 4_1(85) -> 152 4_1(87) -> 86 4_1(91) -> 90 4_2(1) -> 152 4_2(2) -> 152 4_2(3) -> 152 4_2(4) -> 152 4_2(5) -> 152 4_2(6) -> 152 4_2(12) -> 152 4_2(13) -> 120 4_2(17) -> 23 4_2(21) -> 20 4_2(23) -> 22 4_2(31) -> 120 4_2(34) -> 120 4_2(39) -> 138 4_2(42) -> 53 4_2(48) -> 138 4_2(53) -> 137 4_2(57) -> 74 4_2(58) -> 53 4_2(62) -> 53 4_2(67) -> 120 4_2(73) -> 72 4_2(85) -> 53 4_2(116) -> 107 4_2(120) -> 117 4_2(136) -> 135 4_2(138) -> 137 4_2(146) -> 145 4_2(151) -> 150 4_3(116) -> 143 4_3(141) -> 140 4_3(143) -> 142 5_0(1) -> 6 5_0(2) -> 6 5_0(3) -> 6 5_0(4) -> 6 5_0(5) -> 6 5_0(6) -> 6 5_1(1) -> 38 5_1(2) -> 38 5_1(3) -> 38 5_1(4) -> 38 5_1(5) -> 38 5_1(6) -> 38 5_1(9) -> 8 5_1(13) -> 7 5_1(16) -> 50 5_1(31) -> 2 5_1(31) -> 16 5_1(36) -> 50 5_1(41) -> 49 5_1(51) -> 50 5_1(67) -> 7 5_1(88) -> 87 5_1(93) -> 92 5_2(20) -> 19 5_2(55) -> 54 5_2(60) -> 59 5_2(97) -> 96 5_2(135) -> 134 5_3(140) -> 139 * Step 2: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 0(0(4(x1))) -> 1(1(5(2(3(4(x1)))))) 0(1(1(x1))) -> 0(2(2(1(1(1(x1)))))) 0(1(3(x1))) -> 0(2(4(3(4(4(x1)))))) 0(2(4(x1))) -> 1(5(4(3(4(4(x1)))))) 0(4(x1)) -> 0(1(4(2(3(3(x1)))))) 0(4(x1)) -> 0(2(1(4(3(4(x1)))))) 0(4(0(x1))) -> 0(1(2(1(0(3(x1)))))) 1(2(3(x1))) -> 5(1(4(1(4(4(x1)))))) 1(3(3(x1))) -> 0(2(1(1(0(5(x1)))))) 1(3(3(x1))) -> 5(4(0(3(2(3(x1)))))) 1(3(5(x1))) -> 1(1(4(3(3(2(x1)))))) 2(0(0(x1))) -> 2(4(3(4(4(4(x1)))))) 2(0(1(x1))) -> 2(1(5(1(0(1(x1)))))) 2(0(1(x1))) -> 2(4(3(5(2(3(x1)))))) 2(0(4(x1))) -> 2(0(2(1(4(3(x1)))))) 2(0(4(x1))) -> 2(4(1(4(3(1(x1)))))) 3(0(1(x1))) -> 3(1(4(3(4(1(x1)))))) 3(0(5(x1))) -> 3(1(0(2(3(2(x1)))))) 4(0(0(x1))) -> 2(5(2(1(1(1(x1)))))) 4(0(5(x1))) -> 4(1(4(5(1(4(x1)))))) 4(0(5(x1))) -> 4(2(1(4(3(5(x1)))))) 5(0(2(x1))) -> 1(5(2(1(0(2(x1)))))) 5(0(4(x1))) -> 1(0(3(2(4(4(x1)))))) 5(0(4(x1))) -> 1(5(1(0(3(4(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))