/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(3(5(2(2(3(x1))))))) -> 0(3(0(0(5(0(0(4(4(3(x1)))))))))) 0(2(3(1(3(2(5(x1))))))) -> 0(4(3(1(2(3(2(3(2(0(x1)))))))))) 0(3(3(1(4(3(x1)))))) -> 4(4(3(0(2(3(0(3(0(0(x1)))))))))) 0(3(3(3(x1)))) -> 5(4(3(5(3(0(5(4(4(0(x1)))))))))) 0(3(3(3(1(x1))))) -> 5(4(4(0(3(1(0(5(1(0(x1)))))))))) 1(1(3(3(5(3(1(x1))))))) -> 3(5(0(5(3(2(5(0(0(1(x1)))))))))) 1(2(3(3(3(x1))))) -> 4(1(1(2(3(5(0(4(0(5(x1)))))))))) 1(3(3(x1))) -> 3(5(3(2(5(0(2(4(5(4(x1)))))))))) 1(4(4(2(2(x1))))) -> 1(1(2(0(1(1(1(0(2(2(x1)))))))))) 3(3(3(3(4(0(x1)))))) -> 3(0(0(2(1(0(5(3(5(4(x1)))))))))) 3(5(2(0(1(3(3(x1))))))) -> 3(4(3(2(3(2(4(4(5(5(x1)))))))))) 4(0(1(3(4(0(x1)))))) -> 2(2(3(0(0(0(5(0(0(0(x1)))))))))) 4(1(4(2(4(0(1(x1))))))) -> 5(2(2(1(0(5(5(4(5(1(x1)))))))))) 4(1(4(4(4(1(x1)))))) -> 4(1(0(3(3(5(5(5(4(1(x1)))))))))) 4(5(1(2(4(4(4(x1))))))) -> 4(1(1(4(5(3(0(1(0(4(x1)))))))))) 5(1(4(5(3(3(3(x1))))))) -> 5(1(4(5(3(4(4(2(3(2(x1)))))))))) - Signature: {0/1,1/1,3/1,4/1,5/1} / {2/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 1. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_1(1) -> 18 0_1(2) -> 1 0_1(2) -> 18 0_1(2) -> 48 0_1(2) -> 71 0_1(4) -> 3 0_1(5) -> 4 0_1(7) -> 6 0_1(8) -> 7 0_1(18) -> 26 0_1(19) -> 111 0_1(22) -> 21 0_1(25) -> 24 0_1(26) -> 93 0_1(27) -> 18 0_1(32) -> 31 0_1(36) -> 35 0_1(39) -> 38 0_1(41) -> 18 0_1(43) -> 42 0_1(48) -> 47 0_1(49) -> 48 0_1(55) -> 54 0_1(57) -> 56 0_1(61) -> 60 0_1(64) -> 111 0_1(65) -> 18 0_1(68) -> 67 0_1(72) -> 71 0_1(73) -> 71 0_1(74) -> 41 0_1(75) -> 74 0_1(78) -> 77 0_1(90) -> 89 0_1(91) -> 90 0_1(92) -> 91 0_1(97) -> 96 0_1(101) -> 50 0_1(110) -> 109 1_0(1) -> 1 1_1(1) -> 49 1_1(13) -> 12 1_1(18) -> 40 1_1(38) -> 37 1_1(50) -> 19 1_1(51) -> 50 1_1(65) -> 1 1_1(65) -> 49 1_1(66) -> 65 1_1(69) -> 68 1_1(70) -> 69 1_1(71) -> 70 1_1(77) -> 76 1_1(96) -> 95 1_1(110) -> 69 1_1(111) -> 110 1_1(112) -> 27 2_0(1) -> 1 2_1(1) -> 73 2_1(14) -> 13 2_1(16) -> 15 2_1(18) -> 17 2_1(23) -> 22 2_1(41) -> 73 2_1(46) -> 45 2_1(52) -> 51 2_1(59) -> 58 2_1(62) -> 61 2_1(67) -> 66 2_1(73) -> 72 2_1(76) -> 75 2_1(82) -> 81 2_1(84) -> 83 2_1(87) -> 1 2_1(87) -> 34 2_1(87) -> 64 2_1(88) -> 87 2_1(94) -> 27 2_1(95) -> 94 2_1(118) -> 117 3_0(1) -> 1 3_1(1) -> 10 3_1(3) -> 2 3_1(12) -> 11 3_1(15) -> 14 3_1(17) -> 16 3_1(21) -> 20 3_1(24) -> 23 3_1(26) -> 25 3_1(29) -> 28 3_1(31) -> 30 3_1(37) -> 36 3_1(41) -> 1 3_1(41) -> 10 3_1(41) -> 49 3_1(45) -> 44 3_1(53) -> 52 3_1(58) -> 42 3_1(63) -> 79 3_1(73) -> 118 3_1(81) -> 80 3_1(83) -> 82 3_1(89) -> 88 3_1(102) -> 101 3_1(103) -> 102 3_1(109) -> 108 3_1(115) -> 114 4_0(1) -> 1 4_1(1) -> 64 4_1(2) -> 64 4_1(9) -> 8 4_1(10) -> 9 4_1(11) -> 2 4_1(18) -> 34 4_1(19) -> 1 4_1(19) -> 18 4_1(19) -> 49 4_1(19) -> 64 4_1(19) -> 99 4_1(19) -> 106 4_1(20) -> 19 4_1(28) -> 27 4_1(34) -> 33 4_1(35) -> 28 4_1(41) -> 64 4_1(49) -> 106 4_1(56) -> 55 4_1(63) -> 62 4_1(80) -> 41 4_1(85) -> 84 4_1(86) -> 85 4_1(88) -> 9 4_1(100) -> 99 4_1(107) -> 51 4_1(113) -> 112 4_1(116) -> 115 4_1(117) -> 116 5_0(1) -> 1 5_1(1) -> 57 5_1(6) -> 5 5_1(26) -> 92 5_1(27) -> 1 5_1(27) -> 18 5_1(27) -> 57 5_1(27) -> 64 5_1(27) -> 100 5_1(27) -> 106 5_1(30) -> 29 5_1(33) -> 32 5_1(40) -> 39 5_1(41) -> 57 5_1(42) -> 41 5_1(44) -> 43 5_1(47) -> 46 5_1(49) -> 100 5_1(54) -> 53 5_1(57) -> 86 5_1(60) -> 59 5_1(64) -> 63 5_1(79) -> 78 5_1(86) -> 103 5_1(93) -> 92 5_1(98) -> 97 5_1(99) -> 98 5_1(104) -> 103 5_1(105) -> 104 5_1(106) -> 105 5_1(108) -> 107 5_1(114) -> 113 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 0(1(3(5(2(2(3(x1))))))) -> 0(3(0(0(5(0(0(4(4(3(x1)))))))))) 0(2(3(1(3(2(5(x1))))))) -> 0(4(3(1(2(3(2(3(2(0(x1)))))))))) 0(3(3(1(4(3(x1)))))) -> 4(4(3(0(2(3(0(3(0(0(x1)))))))))) 0(3(3(3(x1)))) -> 5(4(3(5(3(0(5(4(4(0(x1)))))))))) 0(3(3(3(1(x1))))) -> 5(4(4(0(3(1(0(5(1(0(x1)))))))))) 1(1(3(3(5(3(1(x1))))))) -> 3(5(0(5(3(2(5(0(0(1(x1)))))))))) 1(2(3(3(3(x1))))) -> 4(1(1(2(3(5(0(4(0(5(x1)))))))))) 1(3(3(x1))) -> 3(5(3(2(5(0(2(4(5(4(x1)))))))))) 1(4(4(2(2(x1))))) -> 1(1(2(0(1(1(1(0(2(2(x1)))))))))) 3(3(3(3(4(0(x1)))))) -> 3(0(0(2(1(0(5(3(5(4(x1)))))))))) 3(5(2(0(1(3(3(x1))))))) -> 3(4(3(2(3(2(4(4(5(5(x1)))))))))) 4(0(1(3(4(0(x1)))))) -> 2(2(3(0(0(0(5(0(0(0(x1)))))))))) 4(1(4(2(4(0(1(x1))))))) -> 5(2(2(1(0(5(5(4(5(1(x1)))))))))) 4(1(4(4(4(1(x1)))))) -> 4(1(0(3(3(5(5(5(4(1(x1)))))))))) 4(5(1(2(4(4(4(x1))))))) -> 4(1(1(4(5(3(0(1(0(4(x1)))))))))) 5(1(4(5(3(3(3(x1))))))) -> 5(1(4(5(3(4(4(2(3(2(x1)))))))))) - Signature: {0/1,1/1,3/1,4/1,5/1} / {2/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))