/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(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(x1)))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(x1))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))))))))))))))))))))) - Signature: {0/1} / {1/1,2/1} - Obligation: derivational complexity wrt. signature {0,1,2} + 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(6) -> 5 0_1(9) -> 8 0_2(26) -> 25 0_2(29) -> 28 0_2(32) -> 31 0_2(38) -> 37 0_3(50) -> 49 0_3(53) -> 52 0_3(56) -> 55 0_3(59) -> 58 0_3(62) -> 61 0_3(68) -> 67 0_3(71) -> 70 0_3(74) -> 73 0_3(77) -> 76 0_3(80) -> 79 0_3(83) -> 82 0_3(89) -> 88 0_3(92) -> 91 0_3(95) -> 94 0_3(98) -> 97 0_3(101) -> 100 0_3(104) -> 103 0_3(107) -> 106 0_3(113) -> 112 0_3(116) -> 115 0_3(119) -> 118 0_3(122) -> 121 0_3(125) -> 124 0_3(128) -> 127 0_3(131) -> 130 0_3(134) -> 133 1_0(1) -> 1 1_1(2) -> 1 1_1(2) -> 8 1_1(4) -> 3 1_1(5) -> 4 1_1(7) -> 6 1_1(10) -> 9 1_2(22) -> 5 1_2(22) -> 8 1_2(24) -> 23 1_2(25) -> 24 1_2(27) -> 26 1_2(28) -> 36 1_2(30) -> 29 1_2(33) -> 32 1_2(34) -> 5 1_2(34) -> 8 1_2(36) -> 35 1_2(37) -> 36 1_2(39) -> 38 1_3(46) -> 31 1_3(48) -> 47 1_3(49) -> 48 1_3(51) -> 50 1_3(52) -> 48 1_3(54) -> 53 1_3(55) -> 48 1_3(57) -> 56 1_3(58) -> 48 1_3(60) -> 59 1_3(63) -> 62 1_3(64) -> 28 1_3(66) -> 65 1_3(67) -> 66 1_3(69) -> 68 1_3(70) -> 66 1_3(72) -> 71 1_3(73) -> 66 1_3(75) -> 74 1_3(76) -> 66 1_3(78) -> 77 1_3(79) -> 66 1_3(81) -> 80 1_3(84) -> 83 1_3(85) -> 25 1_3(87) -> 86 1_3(88) -> 87 1_3(90) -> 89 1_3(91) -> 87 1_3(93) -> 92 1_3(94) -> 87 1_3(96) -> 95 1_3(97) -> 87 1_3(99) -> 98 1_3(100) -> 87 1_3(102) -> 101 1_3(103) -> 87 1_3(105) -> 104 1_3(108) -> 107 1_3(109) -> 37 1_3(111) -> 110 1_3(112) -> 111 1_3(114) -> 113 1_3(115) -> 111 1_3(117) -> 116 1_3(118) -> 111 1_3(120) -> 119 1_3(121) -> 111 1_3(123) -> 122 1_3(124) -> 111 1_3(126) -> 125 1_3(127) -> 111 1_3(129) -> 128 1_3(130) -> 111 1_3(132) -> 131 1_3(135) -> 134 2_0(1) -> 1 2_1(1) -> 10 2_1(2) -> 7 2_1(3) -> 2 2_1(4) -> 7 2_1(5) -> 7 2_1(8) -> 7 2_2(2) -> 33 2_2(5) -> 33 2_2(22) -> 33 2_2(23) -> 22 2_2(25) -> 39 2_2(28) -> 27 2_2(31) -> 30 2_2(34) -> 27 2_2(35) -> 34 2_2(37) -> 39 2_3(22) -> 51 2_3(34) -> 63 2_3(46) -> 84 2_3(47) -> 46 2_3(49) -> 51 2_3(52) -> 51 2_3(55) -> 54 2_3(58) -> 57 2_3(61) -> 60 2_3(64) -> 108 2_3(65) -> 64 2_3(67) -> 69 2_3(70) -> 69 2_3(73) -> 72 2_3(76) -> 75 2_3(79) -> 78 2_3(82) -> 81 2_3(85) -> 135 2_3(86) -> 85 2_3(88) -> 90 2_3(91) -> 90 2_3(94) -> 93 2_3(97) -> 96 2_3(100) -> 99 2_3(103) -> 102 2_3(106) -> 105 2_3(109) -> 114 2_3(110) -> 109 2_3(112) -> 114 2_3(115) -> 114 2_3(118) -> 117 2_3(121) -> 120 2_3(124) -> 123 2_3(127) -> 126 2_3(130) -> 129 2_3(133) -> 132 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(x1)))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(x1))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))))))))))))))) 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))))))))))))))))))))) - Signature: {0/1} / {1/1,2/1} - Obligation: derivational complexity wrt. signature {0,1,2} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))