Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ 2(4(2(1(1(4(3(2(1(1(4(4(0(3(3(4(1(5(3(4(x1))))))))))))))))))))
-> 0(2(5(5(3(2(3(3(5(3(0(0(0(0(3(2(1(3(2(x1)))))))))))))))))))
, 0(3(4(1(2(4(5(1(3(2(2(1(3(1(5(5(1(5(0(x1))))))))))))))))))) ->
3(0(4(1(5(1(3(3(4(0(1(0(0(1(0(2(0(x1)))))))))))))))))
, 3(5(0(3(5(4(2(5(3(4(2(3(3(4(2(5(0(0(x1)))))))))))))))))) ->
0(1(2(1(4(0(5(2(0(2(5(3(5(1(3(2(0(x1)))))))))))))))))
, 0(3(4(4(5(4(4(5(0(1(5(5(5(5(0(3(3(1(x1)))))))))))))))))) ->
0(2(1(1(5(3(5(2(4(4(0(2(3(2(3(0(1(1(x1))))))))))))))))))
, 5(5(3(2(5(1(3(4(1(0(1(0(3(3(5(4(4(x1))))))))))))))))) ->
5(3(2(1(4(1(5(0(5(5(5(3(1(2(4(1(2(x1)))))))))))))))))
, 5(3(5(1(3(3(2(5(3(5(4(1(5(2(0(3(x1)))))))))))))))) ->
5(3(5(4(4(5(2(1(4(4(1(3(2(4(3(1(x1))))))))))))))))
, 1(4(2(5(5(0(1(3(1(0(1(0(1(2(2(3(x1)))))))))))))))) ->
2(2(4(1(1(0(1(0(1(4(4(5(2(1(3(1(3(x1)))))))))))))))))
, 3(3(5(3(2(0(4(5(2(4(0(3(2(2(x1)))))))))))))) ->
3(3(5(3(5(3(3(5(1(3(3(5(0(2(x1))))))))))))))
, 0(2(0(4(0(4(2(4(4(3(5(2(5(x1))))))))))))) ->
0(1(5(4(0(1(5(3(4(3(3(5(x1))))))))))))
, 4(1(5(3(4(4(2(4(4(5(2(4(x1)))))))))))) ->
4(3(5(3(1(0(0(4(5(4(4(x1)))))))))))
, 3(2(3(3(2(4(2(4(2(4(0(1(x1)))))))))))) ->
2(0(3(0(3(0(0(0(2(2(0(1(x1))))))))))))
, 2(1(4(3(4(5(4(0(2(0(0(3(x1)))))))))))) ->
3(2(4(1(5(2(5(2(1(1(1(x1)))))))))))
, 1(4(3(3(5(1(0(5(4(4(5(x1))))))))))) ->
4(2(5(5(3(0(3(3(1(5(x1))))))))))
, 4(3(5(2(1(0(4(0(2(5(x1)))))))))) ->
1(0(1(1(1(4(3(4(5(5(x1))))))))))
, 1(2(2(2(4(5(3(0(3(0(x1)))))))))) -> 1(0(1(3(0(2(3(4(0(x1)))))))))
, 0(5(1(0(3(1(3(3(x1)))))))) -> 3(3(4(2(5(3(3(x1)))))))
, 5(5(3(0(0(3(1(x1))))))) -> 5(4(4(1(4(2(3(x1)))))))
, 5(2(2(0(1(3(4(x1))))))) -> 5(2(5(3(4(0(0(x1)))))))
, 2(4(3(5(4(3(1(x1))))))) -> 5(1(2(0(4(1(x1))))))
, 4(1(4(0(0(3(x1)))))) -> 4(4(0(2(2(x1)))))
, 3(3(1(2(2(1(x1)))))) -> 0(0(0(3(5(1(x1))))))
, 3(1(1(1(4(x1))))) -> 3(2(0(4(x1))))
, 3(0(4(3(4(x1))))) -> 5(1(0(3(4(x1)))))
, 0(3(4(4(x1)))) -> 0(3(2(x1)))
, 0(1(1(2(x1)))) -> 0(1(0(x1)))}
StartTerms: all
Strategy: none
Certificate: YES(?,O(n^1))
Proof:
The problem is match-bounded by 2.
The enriched problem is compatible with the following automaton:
{ 2_0(1) -> 1
, 2_1(1) -> 19
, 2_1(2) -> 19
, 2_1(3) -> 2
, 2_1(7) -> 6
, 2_1(17) -> 16
, 2_1(19) -> 185
, 2_1(20) -> 19
, 2_1(34) -> 142
, 2_1(35) -> 34
, 2_1(37) -> 36
, 2_1(42) -> 41
, 2_1(44) -> 43
, 2_1(54) -> 53
, 2_1(58) -> 57
, 2_1(60) -> 59
, 2_1(66) -> 65
, 2_1(77) -> 76
, 2_1(83) -> 82
, 2_1(89) -> 88
, 2_1(91) -> 1
, 2_1(91) -> 18
, 2_1(91) -> 63
, 2_1(91) -> 106
, 2_1(92) -> 91
, 2_1(103) -> 102
, 2_1(106) -> 176
, 2_1(125) -> 171
, 2_1(126) -> 19
, 2_1(136) -> 176
, 2_1(143) -> 142
, 2_1(144) -> 143
, 2_1(145) -> 20
, 2_1(149) -> 148
, 2_1(151) -> 150
, 2_1(152) -> 126
, 2_1(169) -> 168
, 2_1(172) -> 171
, 2_1(174) -> 19
, 2_1(177) -> 64
, 2_1(182) -> 181
, 2_1(184) -> 19
, 2_1(185) -> 185
, 2_2(126) -> 193
, 2_2(184) -> 193
, 1_0(1) -> 1
, 1_1(1) -> 63
, 1_1(18) -> 17
, 1_1(19) -> 78
, 1_1(20) -> 63
, 1_1(23) -> 22
, 1_1(25) -> 24
, 1_1(30) -> 29
, 1_1(33) -> 32
, 1_1(35) -> 2
, 1_1(36) -> 2
, 1_1(38) -> 37
, 1_1(48) -> 47
, 1_1(49) -> 3
, 1_1(50) -> 49
, 1_1(62) -> 151
, 1_1(63) -> 62
, 1_1(67) -> 66
, 1_1(69) -> 68
, 1_1(76) -> 75
, 1_1(78) -> 62
, 1_1(84) -> 83
, 1_1(87) -> 86
, 1_1(90) -> 103
, 1_1(94) -> 93
, 1_1(95) -> 94
, 1_1(97) -> 96
, 1_1(99) -> 98
, 1_1(104) -> 103
, 1_1(106) -> 105
, 1_1(114) -> 113
, 1_1(120) -> 119
, 1_1(125) -> 158
, 1_1(130) -> 129
, 1_1(137) -> 20
, 1_1(147) -> 146
, 1_1(159) -> 1
, 1_1(159) -> 63
, 1_1(159) -> 78
, 1_1(159) -> 135
, 1_1(161) -> 160
, 1_1(162) -> 161
, 1_1(163) -> 162
, 1_1(175) -> 174
, 1_1(181) -> 64
, 1_2(49) -> 265
, 1_2(195) -> 194
, 0_0(1) -> 1
, 0_1(1) -> 35
, 0_1(2) -> 1
, 0_1(2) -> 19
, 0_1(2) -> 33
, 0_1(2) -> 35
, 0_1(2) -> 61
, 0_1(2) -> 106
, 0_1(2) -> 115
, 0_1(2) -> 123
, 0_1(2) -> 124
, 0_1(2) -> 144
, 0_1(2) -> 156
, 0_1(2) -> 181
, 0_1(2) -> 195
, 0_1(12) -> 11
, 0_1(13) -> 12
, 0_1(14) -> 13
, 0_1(15) -> 14
, 0_1(18) -> 1
, 0_1(18) -> 35
, 0_1(18) -> 181
, 0_1(18) -> 195
, 0_1(19) -> 33
, 0_1(20) -> 33
, 0_1(21) -> 20
, 0_1(29) -> 28
, 0_1(31) -> 30
, 0_1(32) -> 1
, 0_1(32) -> 31
, 0_1(32) -> 35
, 0_1(32) -> 144
, 0_1(32) -> 195
, 0_1(34) -> 33
, 0_1(35) -> 180
, 0_1(40) -> 39
, 0_1(43) -> 42
, 0_1(57) -> 56
, 0_1(62) -> 61
, 0_1(63) -> 144
, 0_1(71) -> 70
, 0_1(91) -> 33
, 0_1(96) -> 95
, 0_1(98) -> 97
, 0_1(119) -> 118
, 0_1(126) -> 35
, 0_1(131) -> 130
, 0_1(132) -> 131
, 0_1(135) -> 145
, 0_1(136) -> 91
, 0_1(138) -> 137
, 0_1(140) -> 139
, 0_1(141) -> 140
, 0_1(142) -> 141
, 0_1(156) -> 155
, 0_1(160) -> 159
, 0_1(168) -> 167
, 0_1(170) -> 182
, 0_1(183) -> 182
, 0_1(185) -> 184
, 0_1(186) -> 2
, 0_1(187) -> 186
, 0_1(189) -> 181
, 0_2(1) -> 195
, 0_2(2) -> 195
, 0_2(20) -> 195
, 0_2(91) -> 195
, 0_2(126) -> 195
, 0_2(145) -> 195
, 0_2(174) -> 195
, 0_2(184) -> 195
, 0_2(192) -> 181
, 0_2(194) -> 61
, 0_2(261) -> 156
, 0_2(262) -> 261
, 0_2(263) -> 262
, 4_0(1) -> 1
, 4_1(1) -> 135
, 4_1(20) -> 170
, 4_1(22) -> 21
, 4_1(28) -> 27
, 4_1(35) -> 170
, 4_1(39) -> 38
, 4_1(55) -> 54
, 4_1(56) -> 55
, 4_1(63) -> 183
, 4_1(68) -> 67
, 4_1(78) -> 77
, 4_1(80) -> 79
, 4_1(81) -> 80
, 4_1(85) -> 84
, 4_1(86) -> 85
, 4_1(90) -> 89
, 4_1(93) -> 92
, 4_1(100) -> 99
, 4_1(101) -> 100
, 4_1(118) -> 117
, 4_1(123) -> 122
, 4_1(125) -> 165
, 4_1(126) -> 1
, 4_1(126) -> 63
, 4_1(126) -> 135
, 4_1(126) -> 183
, 4_1(133) -> 132
, 4_1(135) -> 134
, 4_1(146) -> 145
, 4_1(164) -> 163
, 4_1(166) -> 165
, 4_1(171) -> 107
, 4_1(173) -> 64
, 4_1(174) -> 173
, 4_1(176) -> 175
, 4_1(180) -> 179
, 4_1(184) -> 126
, 3_0(1) -> 1
, 3_1(1) -> 106
, 3_1(6) -> 5
, 3_1(8) -> 7
, 3_1(9) -> 8
, 3_1(11) -> 10
, 3_1(16) -> 15
, 3_1(19) -> 18
, 3_1(20) -> 1
, 3_1(20) -> 19
, 3_1(20) -> 35
, 3_1(20) -> 90
, 3_1(20) -> 106
, 3_1(20) -> 114
, 3_1(20) -> 123
, 3_1(20) -> 181
, 3_1(20) -> 195
, 3_1(26) -> 25
, 3_1(27) -> 26
, 3_1(34) -> 48
, 3_1(46) -> 45
, 3_1(52) -> 51
, 3_1(59) -> 58
, 3_1(61) -> 60
, 3_1(63) -> 90
, 3_1(65) -> 64
, 3_1(75) -> 74
, 3_1(78) -> 90
, 3_1(88) -> 87
, 3_1(90) -> 156
, 3_1(105) -> 104
, 3_1(106) -> 123
, 3_1(107) -> 20
, 3_1(109) -> 108
, 3_1(111) -> 110
, 3_1(112) -> 111
, 3_1(115) -> 114
, 3_1(116) -> 115
, 3_1(122) -> 121
, 3_1(124) -> 123
, 3_1(125) -> 124
, 3_1(127) -> 126
, 3_1(129) -> 128
, 3_1(135) -> 189
, 3_1(137) -> 136
, 3_1(139) -> 138
, 3_1(144) -> 60
, 3_1(155) -> 154
, 3_1(157) -> 156
, 3_1(158) -> 157
, 3_1(159) -> 106
, 3_1(165) -> 164
, 3_1(167) -> 161
, 3_1(170) -> 169
, 3_1(177) -> 20
, 3_1(179) -> 178
, 3_1(188) -> 187
, 3_2(193) -> 192
, 3_2(264) -> 263
, 5_0(1) -> 1
, 5_1(1) -> 125
, 5_1(3) -> 166
, 5_1(4) -> 3
, 5_1(5) -> 4
, 5_1(10) -> 9
, 5_1(17) -> 46
, 5_1(24) -> 23
, 5_1(33) -> 116
, 5_1(35) -> 116
, 5_1(41) -> 40
, 5_1(45) -> 44
, 5_1(47) -> 46
, 5_1(51) -> 50
, 5_1(53) -> 52
, 5_1(63) -> 188
, 5_1(64) -> 1
, 5_1(64) -> 19
, 5_1(64) -> 106
, 5_1(64) -> 125
, 5_1(64) -> 166
, 5_1(70) -> 69
, 5_1(72) -> 71
, 5_1(73) -> 72
, 5_1(74) -> 73
, 5_1(79) -> 65
, 5_1(82) -> 81
, 5_1(102) -> 101
, 5_1(108) -> 107
, 5_1(110) -> 109
, 5_1(113) -> 112
, 5_1(117) -> 36
, 5_1(121) -> 120
, 5_1(123) -> 172
, 5_1(125) -> 166
, 5_1(128) -> 127
, 5_1(134) -> 133
, 5_1(148) -> 147
, 5_1(150) -> 149
, 5_1(153) -> 152
, 5_1(154) -> 153
, 5_1(178) -> 177
, 5_2(265) -> 264}
Hurray, we answered YES(?,O(n^1))Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ 2(4(2(1(1(4(3(2(1(1(4(4(0(3(3(4(1(5(3(4(x1))))))))))))))))))))
-> 0(2(5(5(3(2(3(3(5(3(0(0(0(0(3(2(1(3(2(x1)))))))))))))))))))
, 0(3(4(1(2(4(5(1(3(2(2(1(3(1(5(5(1(5(0(x1))))))))))))))))))) ->
3(0(4(1(5(1(3(3(4(0(1(0(0(1(0(2(0(x1)))))))))))))))))
, 3(5(0(3(5(4(2(5(3(4(2(3(3(4(2(5(0(0(x1)))))))))))))))))) ->
0(1(2(1(4(0(5(2(0(2(5(3(5(1(3(2(0(x1)))))))))))))))))
, 0(3(4(4(5(4(4(5(0(1(5(5(5(5(0(3(3(1(x1)))))))))))))))))) ->
0(2(1(1(5(3(5(2(4(4(0(2(3(2(3(0(1(1(x1))))))))))))))))))
, 5(5(3(2(5(1(3(4(1(0(1(0(3(3(5(4(4(x1))))))))))))))))) ->
5(3(2(1(4(1(5(0(5(5(5(3(1(2(4(1(2(x1)))))))))))))))))
, 5(3(5(1(3(3(2(5(3(5(4(1(5(2(0(3(x1)))))))))))))))) ->
5(3(5(4(4(5(2(1(4(4(1(3(2(4(3(1(x1))))))))))))))))
, 1(4(2(5(5(0(1(3(1(0(1(0(1(2(2(3(x1)))))))))))))))) ->
2(2(4(1(1(0(1(0(1(4(4(5(2(1(3(1(3(x1)))))))))))))))))
, 3(3(5(3(2(0(4(5(2(4(0(3(2(2(x1)))))))))))))) ->
3(3(5(3(5(3(3(5(1(3(3(5(0(2(x1))))))))))))))
, 0(2(0(4(0(4(2(4(4(3(5(2(5(x1))))))))))))) ->
0(1(5(4(0(1(5(3(4(3(3(5(x1))))))))))))
, 4(1(5(3(4(4(2(4(4(5(2(4(x1)))))))))))) ->
4(3(5(3(1(0(0(4(5(4(4(x1)))))))))))
, 3(2(3(3(2(4(2(4(2(4(0(1(x1)))))))))))) ->
2(0(3(0(3(0(0(0(2(2(0(1(x1))))))))))))
, 2(1(4(3(4(5(4(0(2(0(0(3(x1)))))))))))) ->
3(2(4(1(5(2(5(2(1(1(1(x1)))))))))))
, 1(4(3(3(5(1(0(5(4(4(5(x1))))))))))) ->
4(2(5(5(3(0(3(3(1(5(x1))))))))))
, 4(3(5(2(1(0(4(0(2(5(x1)))))))))) ->
1(0(1(1(1(4(3(4(5(5(x1))))))))))
, 1(2(2(2(4(5(3(0(3(0(x1)))))))))) -> 1(0(1(3(0(2(3(4(0(x1)))))))))
, 0(5(1(0(3(1(3(3(x1)))))))) -> 3(3(4(2(5(3(3(x1)))))))
, 5(5(3(0(0(3(1(x1))))))) -> 5(4(4(1(4(2(3(x1)))))))
, 5(2(2(0(1(3(4(x1))))))) -> 5(2(5(3(4(0(0(x1)))))))
, 2(4(3(5(4(3(1(x1))))))) -> 5(1(2(0(4(1(x1))))))
, 4(1(4(0(0(3(x1)))))) -> 4(4(0(2(2(x1)))))
, 3(3(1(2(2(1(x1)))))) -> 0(0(0(3(5(1(x1))))))
, 3(1(1(1(4(x1))))) -> 3(2(0(4(x1))))
, 3(0(4(3(4(x1))))) -> 5(1(0(3(4(x1)))))
, 0(3(4(4(x1)))) -> 0(3(2(x1)))
, 0(1(1(2(x1)))) -> 0(1(0(x1)))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool IDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ 2(4(2(1(1(4(3(2(1(1(4(4(0(3(3(4(1(5(3(4(x1))))))))))))))))))))
-> 0(2(5(5(3(2(3(3(5(3(0(0(0(0(3(2(1(3(2(x1)))))))))))))))))))
, 0(3(4(1(2(4(5(1(3(2(2(1(3(1(5(5(1(5(0(x1))))))))))))))))))) ->
3(0(4(1(5(1(3(3(4(0(1(0(0(1(0(2(0(x1)))))))))))))))))
, 3(5(0(3(5(4(2(5(3(4(2(3(3(4(2(5(0(0(x1)))))))))))))))))) ->
0(1(2(1(4(0(5(2(0(2(5(3(5(1(3(2(0(x1)))))))))))))))))
, 0(3(4(4(5(4(4(5(0(1(5(5(5(5(0(3(3(1(x1)))))))))))))))))) ->
0(2(1(1(5(3(5(2(4(4(0(2(3(2(3(0(1(1(x1))))))))))))))))))
, 5(5(3(2(5(1(3(4(1(0(1(0(3(3(5(4(4(x1))))))))))))))))) ->
5(3(2(1(4(1(5(0(5(5(5(3(1(2(4(1(2(x1)))))))))))))))))
, 5(3(5(1(3(3(2(5(3(5(4(1(5(2(0(3(x1)))))))))))))))) ->
5(3(5(4(4(5(2(1(4(4(1(3(2(4(3(1(x1))))))))))))))))
, 1(4(2(5(5(0(1(3(1(0(1(0(1(2(2(3(x1)))))))))))))))) ->
2(2(4(1(1(0(1(0(1(4(4(5(2(1(3(1(3(x1)))))))))))))))))
, 3(3(5(3(2(0(4(5(2(4(0(3(2(2(x1)))))))))))))) ->
3(3(5(3(5(3(3(5(1(3(3(5(0(2(x1))))))))))))))
, 0(2(0(4(0(4(2(4(4(3(5(2(5(x1))))))))))))) ->
0(1(5(4(0(1(5(3(4(3(3(5(x1))))))))))))
, 4(1(5(3(4(4(2(4(4(5(2(4(x1)))))))))))) ->
4(3(5(3(1(0(0(4(5(4(4(x1)))))))))))
, 3(2(3(3(2(4(2(4(2(4(0(1(x1)))))))))))) ->
2(0(3(0(3(0(0(0(2(2(0(1(x1))))))))))))
, 2(1(4(3(4(5(4(0(2(0(0(3(x1)))))))))))) ->
3(2(4(1(5(2(5(2(1(1(1(x1)))))))))))
, 1(4(3(3(5(1(0(5(4(4(5(x1))))))))))) ->
4(2(5(5(3(0(3(3(1(5(x1))))))))))
, 4(3(5(2(1(0(4(0(2(5(x1)))))))))) ->
1(0(1(1(1(4(3(4(5(5(x1))))))))))
, 1(2(2(2(4(5(3(0(3(0(x1)))))))))) -> 1(0(1(3(0(2(3(4(0(x1)))))))))
, 0(5(1(0(3(1(3(3(x1)))))))) -> 3(3(4(2(5(3(3(x1)))))))
, 5(5(3(0(0(3(1(x1))))))) -> 5(4(4(1(4(2(3(x1)))))))
, 5(2(2(0(1(3(4(x1))))))) -> 5(2(5(3(4(0(0(x1)))))))
, 2(4(3(5(4(3(1(x1))))))) -> 5(1(2(0(4(1(x1))))))
, 4(1(4(0(0(3(x1)))))) -> 4(4(0(2(2(x1)))))
, 3(3(1(2(2(1(x1)))))) -> 0(0(0(3(5(1(x1))))))
, 3(1(1(1(4(x1))))) -> 3(2(0(4(x1))))
, 3(0(4(3(4(x1))))) -> 5(1(0(3(4(x1)))))
, 0(3(4(4(x1)))) -> 0(3(2(x1)))
, 0(1(1(2(x1)))) -> 0(1(0(x1)))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ 2(4(2(1(1(4(3(2(1(1(4(4(0(3(3(4(1(5(3(4(x1))))))))))))))))))))
-> 0(2(5(5(3(2(3(3(5(3(0(0(0(0(3(2(1(3(2(x1)))))))))))))))))))
, 0(3(4(1(2(4(5(1(3(2(2(1(3(1(5(5(1(5(0(x1))))))))))))))))))) ->
3(0(4(1(5(1(3(3(4(0(1(0(0(1(0(2(0(x1)))))))))))))))))
, 3(5(0(3(5(4(2(5(3(4(2(3(3(4(2(5(0(0(x1)))))))))))))))))) ->
0(1(2(1(4(0(5(2(0(2(5(3(5(1(3(2(0(x1)))))))))))))))))
, 0(3(4(4(5(4(4(5(0(1(5(5(5(5(0(3(3(1(x1)))))))))))))))))) ->
0(2(1(1(5(3(5(2(4(4(0(2(3(2(3(0(1(1(x1))))))))))))))))))
, 5(5(3(2(5(1(3(4(1(0(1(0(3(3(5(4(4(x1))))))))))))))))) ->
5(3(2(1(4(1(5(0(5(5(5(3(1(2(4(1(2(x1)))))))))))))))))
, 5(3(5(1(3(3(2(5(3(5(4(1(5(2(0(3(x1)))))))))))))))) ->
5(3(5(4(4(5(2(1(4(4(1(3(2(4(3(1(x1))))))))))))))))
, 1(4(2(5(5(0(1(3(1(0(1(0(1(2(2(3(x1)))))))))))))))) ->
2(2(4(1(1(0(1(0(1(4(4(5(2(1(3(1(3(x1)))))))))))))))))
, 3(3(5(3(2(0(4(5(2(4(0(3(2(2(x1)))))))))))))) ->
3(3(5(3(5(3(3(5(1(3(3(5(0(2(x1))))))))))))))
, 0(2(0(4(0(4(2(4(4(3(5(2(5(x1))))))))))))) ->
0(1(5(4(0(1(5(3(4(3(3(5(x1))))))))))))
, 4(1(5(3(4(4(2(4(4(5(2(4(x1)))))))))))) ->
4(3(5(3(1(0(0(4(5(4(4(x1)))))))))))
, 3(2(3(3(2(4(2(4(2(4(0(1(x1)))))))))))) ->
2(0(3(0(3(0(0(0(2(2(0(1(x1))))))))))))
, 2(1(4(3(4(5(4(0(2(0(0(3(x1)))))))))))) ->
3(2(4(1(5(2(5(2(1(1(1(x1)))))))))))
, 1(4(3(3(5(1(0(5(4(4(5(x1))))))))))) ->
4(2(5(5(3(0(3(3(1(5(x1))))))))))
, 4(3(5(2(1(0(4(0(2(5(x1)))))))))) ->
1(0(1(1(1(4(3(4(5(5(x1))))))))))
, 1(2(2(2(4(5(3(0(3(0(x1)))))))))) -> 1(0(1(3(0(2(3(4(0(x1)))))))))
, 0(5(1(0(3(1(3(3(x1)))))))) -> 3(3(4(2(5(3(3(x1)))))))
, 5(5(3(0(0(3(1(x1))))))) -> 5(4(4(1(4(2(3(x1)))))))
, 5(2(2(0(1(3(4(x1))))))) -> 5(2(5(3(4(0(0(x1)))))))
, 2(4(3(5(4(3(1(x1))))))) -> 5(1(2(0(4(1(x1))))))
, 4(1(4(0(0(3(x1)))))) -> 4(4(0(2(2(x1)))))
, 3(3(1(2(2(1(x1)))))) -> 0(0(0(3(5(1(x1))))))
, 3(1(1(1(4(x1))))) -> 3(2(0(4(x1))))
, 3(0(4(3(4(x1))))) -> 5(1(0(3(4(x1)))))
, 0(3(4(4(x1)))) -> 0(3(2(x1)))
, 0(1(1(2(x1)))) -> 0(1(0(x1)))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI2
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ 2(4(2(1(1(4(3(2(1(1(4(4(0(3(3(4(1(5(3(4(x1))))))))))))))))))))
-> 0(2(5(5(3(2(3(3(5(3(0(0(0(0(3(2(1(3(2(x1)))))))))))))))))))
, 0(3(4(1(2(4(5(1(3(2(2(1(3(1(5(5(1(5(0(x1))))))))))))))))))) ->
3(0(4(1(5(1(3(3(4(0(1(0(0(1(0(2(0(x1)))))))))))))))))
, 3(5(0(3(5(4(2(5(3(4(2(3(3(4(2(5(0(0(x1)))))))))))))))))) ->
0(1(2(1(4(0(5(2(0(2(5(3(5(1(3(2(0(x1)))))))))))))))))
, 0(3(4(4(5(4(4(5(0(1(5(5(5(5(0(3(3(1(x1)))))))))))))))))) ->
0(2(1(1(5(3(5(2(4(4(0(2(3(2(3(0(1(1(x1))))))))))))))))))
, 5(5(3(2(5(1(3(4(1(0(1(0(3(3(5(4(4(x1))))))))))))))))) ->
5(3(2(1(4(1(5(0(5(5(5(3(1(2(4(1(2(x1)))))))))))))))))
, 5(3(5(1(3(3(2(5(3(5(4(1(5(2(0(3(x1)))))))))))))))) ->
5(3(5(4(4(5(2(1(4(4(1(3(2(4(3(1(x1))))))))))))))))
, 1(4(2(5(5(0(1(3(1(0(1(0(1(2(2(3(x1)))))))))))))))) ->
2(2(4(1(1(0(1(0(1(4(4(5(2(1(3(1(3(x1)))))))))))))))))
, 3(3(5(3(2(0(4(5(2(4(0(3(2(2(x1)))))))))))))) ->
3(3(5(3(5(3(3(5(1(3(3(5(0(2(x1))))))))))))))
, 0(2(0(4(0(4(2(4(4(3(5(2(5(x1))))))))))))) ->
0(1(5(4(0(1(5(3(4(3(3(5(x1))))))))))))
, 4(1(5(3(4(4(2(4(4(5(2(4(x1)))))))))))) ->
4(3(5(3(1(0(0(4(5(4(4(x1)))))))))))
, 3(2(3(3(2(4(2(4(2(4(0(1(x1)))))))))))) ->
2(0(3(0(3(0(0(0(2(2(0(1(x1))))))))))))
, 2(1(4(3(4(5(4(0(2(0(0(3(x1)))))))))))) ->
3(2(4(1(5(2(5(2(1(1(1(x1)))))))))))
, 1(4(3(3(5(1(0(5(4(4(5(x1))))))))))) ->
4(2(5(5(3(0(3(3(1(5(x1))))))))))
, 4(3(5(2(1(0(4(0(2(5(x1)))))))))) ->
1(0(1(1(1(4(3(4(5(5(x1))))))))))
, 1(2(2(2(4(5(3(0(3(0(x1)))))))))) -> 1(0(1(3(0(2(3(4(0(x1)))))))))
, 0(5(1(0(3(1(3(3(x1)))))))) -> 3(3(4(2(5(3(3(x1)))))))
, 5(5(3(0(0(3(1(x1))))))) -> 5(4(4(1(4(2(3(x1)))))))
, 5(2(2(0(1(3(4(x1))))))) -> 5(2(5(3(4(0(0(x1)))))))
, 2(4(3(5(4(3(1(x1))))))) -> 5(1(2(0(4(1(x1))))))
, 4(1(4(0(0(3(x1)))))) -> 4(4(0(2(2(x1)))))
, 3(3(1(2(2(1(x1)))))) -> 0(0(0(3(5(1(x1))))))
, 3(1(1(1(4(x1))))) -> 3(2(0(4(x1))))
, 3(0(4(3(4(x1))))) -> 5(1(0(3(4(x1)))))
, 0(3(4(4(x1)))) -> 0(3(2(x1)))
, 0(1(1(2(x1)))) -> 0(1(0(x1)))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..