Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ 5(4(5(5(3(3(4(x1))))))) -> 1(5(0(2(3(4(1(3(0(0(x1))))))))))
, 5(3(5(5(5(4(1(x1))))))) -> 0(1(2(0(4(3(2(5(4(1(x1))))))))))
, 4(0(5(0(5(4(5(x1))))))) -> 1(2(1(3(2(2(5(3(5(5(x1))))))))))
, 2(3(4(3(4(5(3(x1))))))) -> 0(1(5(2(3(5(0(1(2(2(x1))))))))))
, 1(5(5(2(2(5(5(x1))))))) -> 1(0(4(2(5(3(1(5(1(5(x1))))))))))
, 1(0(0(5(2(3(4(x1))))))) -> 2(4(1(4(5(3(2(1(0(4(x1))))))))))
, 0(5(5(5(2(3(3(x1))))))) -> 1(0(1(3(0(5(4(2(4(2(x1))))))))))
, 0(1(2(5(2(3(5(x1))))))) -> 4(4(3(1(4(0(5(1(5(5(x1))))))))))
, 0(0(5(3(5(3(0(x1))))))) -> 0(2(5(0(2(4(3(1(0(0(x1))))))))))
, 0(0(5(0(4(0(1(x1))))))) -> 5(1(4(4(2(0(3(3(4(1(x1))))))))))
, 5(5(0(1(0(0(x1)))))) -> 5(0(4(2(4(4(2(2(4(0(x1))))))))))
, 4(3(5(0(5(5(x1)))))) -> 4(3(2(5(2(5(2(1(3(5(x1))))))))))
, 4(0(4(5(4(1(x1)))))) -> 4(4(3(1(1(1(4(0(1(1(x1))))))))))
, 3(4(0(5(0(1(x1)))))) -> 3(2(1(3(1(0(0(4(0(1(x1))))))))))
, 3(0(4(5(3(3(x1)))))) -> 4(2(0(5(4(2(1(0(0(3(x1))))))))))
, 1(2(3(5(4(4(x1)))))) -> 4(0(2(0(4(0(3(2(2(4(x1))))))))))
, 0(5(5(1(1(3(x1)))))) -> 0(5(0(3(2(1(4(1(4(2(x1))))))))))
, 0(5(5(1(0(5(x1)))))) -> 1(2(0(2(5(4(3(1(1(5(x1))))))))))
, 0(5(4(5(2(0(x1)))))) -> 0(2(2(5(3(3(2(2(2(0(x1))))))))))
, 0(5(4(3(4(5(x1)))))) -> 1(5(0(2(2(3(4(3(2(5(x1))))))))))
, 0(0(5(0(5(5(x1)))))) -> 1(1(3(4(3(0(2(4(5(2(x1))))))))))
, 5(4(5(4(1(x1))))) -> 1(5(3(4(1(0(4(2(0(1(x1))))))))))
, 5(2(3(5(2(x1))))) -> 5(2(2(1(2(0(5(2(2(2(x1))))))))))
, 3(4(5(0(0(x1))))) -> 4(3(3(1(2(5(0(4(3(0(x1))))))))))
, 2(3(5(1(0(x1))))) -> 2(1(2(5(1(1(5(4(2(0(x1))))))))))
, 0(5(5(1(0(x1))))) -> 0(2(4(5(3(1(5(1(4(0(x1))))))))))
, 5(5(3(4(x1)))) -> 1(1(4(4(1(4(3(4(2(2(x1))))))))))
, 4(0(5(5(x1)))) -> 3(3(2(2(2(0(3(5(3(5(x1))))))))))
, 3(5(0(5(x1)))) -> 3(2(1(4(3(3(2(0(1(5(x1))))))))))
, 3(4(5(3(x1)))) -> 3(2(3(2(1(4(1(0(3(2(x1))))))))))
, 0(5(4(1(x1)))) -> 0(1(4(1(5(1(2(2(0(1(x1))))))))))
, 0(4(5(3(x1)))) -> 4(0(3(2(3(1(1(5(0(5(x1))))))))))
, 3(4(5(x1))) -> 3(2(3(2(1(5(3(5(2(2(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:
{ 5_0(1) -> 1
, 5_1(1) -> 27
, 5_1(3) -> 2
, 5_1(18) -> 17
, 5_1(25) -> 24
, 5_1(27) -> 26
, 5_1(28) -> 12
, 5_1(31) -> 30
, 5_1(33) -> 154
, 5_1(34) -> 144
, 5_1(38) -> 37
, 5_1(41) -> 40
, 5_1(46) -> 45
, 5_1(53) -> 52
, 5_1(62) -> 61
, 5_1(64) -> 63
, 5_1(69) -> 1
, 5_1(69) -> 9
, 5_1(69) -> 10
, 5_1(69) -> 26
, 5_1(69) -> 27
, 5_1(69) -> 144
, 5_1(85) -> 84
, 5_1(87) -> 86
, 5_1(89) -> 183
, 5_1(94) -> 27
, 5_1(104) -> 103
, 5_1(117) -> 11
, 5_1(125) -> 124
, 5_1(129) -> 128
, 5_1(155) -> 154
, 5_1(159) -> 158
, 5_1(164) -> 163
, 5_1(167) -> 166
, 5_1(169) -> 168
, 5_1(172) -> 171
, 5_1(205) -> 204
, 5_1(212) -> 211
, 5_1(213) -> 199
, 5_2(117) -> 196
, 5_2(219) -> 218
, 5_2(221) -> 220
, 4_0(1) -> 1
, 4_1(1) -> 18
, 4_1(2) -> 82
, 4_1(7) -> 6
, 4_1(10) -> 82
, 4_1(11) -> 18
, 4_1(15) -> 14
, 4_1(19) -> 18
, 4_1(33) -> 177
, 4_1(34) -> 55
, 4_1(36) -> 35
, 4_1(43) -> 42
, 4_1(45) -> 44
, 4_1(54) -> 53
, 4_1(56) -> 1
, 4_1(56) -> 10
, 4_1(56) -> 18
, 4_1(56) -> 19
, 4_1(56) -> 49
, 4_1(56) -> 75
, 4_1(56) -> 82
, 4_1(56) -> 101
, 4_1(56) -> 109
, 4_1(56) -> 161
, 4_1(57) -> 56
, 4_1(60) -> 59
, 4_1(67) -> 66
, 4_1(71) -> 70
, 4_1(72) -> 71
, 4_1(77) -> 76
, 4_1(79) -> 78
, 4_1(80) -> 79
, 4_1(92) -> 91
, 4_1(101) -> 100
, 4_1(105) -> 104
, 4_1(113) -> 112
, 4_1(115) -> 177
, 4_1(122) -> 121
, 4_1(126) -> 125
, 4_1(133) -> 167
, 4_1(136) -> 135
, 4_1(140) -> 139
, 4_1(144) -> 143
, 4_1(146) -> 145
, 4_1(149) -> 148
, 4_1(161) -> 160
, 4_1(168) -> 63
, 4_1(173) -> 138
, 4_1(174) -> 173
, 4_1(176) -> 175
, 4_1(184) -> 96
, 4_1(200) -> 199
, 4_1(203) -> 12
, 4_2(191) -> 190
, 3_0(1) -> 1
, 3_1(1) -> 109
, 3_1(6) -> 5
, 3_1(9) -> 8
, 3_1(10) -> 161
, 3_1(16) -> 15
, 3_1(18) -> 75
, 3_1(22) -> 21
, 3_1(26) -> 25
, 3_1(27) -> 89
, 3_1(30) -> 29
, 3_1(34) -> 202
, 3_1(39) -> 38
, 3_1(47) -> 46
, 3_1(51) -> 50
, 3_1(58) -> 57
, 3_1(68) -> 67
, 3_1(75) -> 74
, 3_1(83) -> 56
, 3_1(94) -> 1
, 3_1(94) -> 18
, 3_1(94) -> 75
, 3_1(94) -> 82
, 3_1(94) -> 89
, 3_1(94) -> 109
, 3_1(97) -> 96
, 3_1(115) -> 114
, 3_1(119) -> 118
, 3_1(127) -> 126
, 3_1(130) -> 129
, 3_1(131) -> 130
, 3_1(135) -> 134
, 3_1(137) -> 136
, 3_1(139) -> 138
, 3_1(141) -> 140
, 3_1(145) -> 3
, 3_1(154) -> 213
, 3_1(156) -> 83
, 3_1(170) -> 169
, 3_1(177) -> 176
, 3_1(178) -> 94
, 3_1(183) -> 182
, 3_1(185) -> 184
, 3_1(186) -> 185
, 3_1(197) -> 95
, 3_1(207) -> 110
, 3_1(209) -> 208
, 3_2(188) -> 25
, 3_2(188) -> 89
, 3_2(192) -> 191
, 3_2(193) -> 192
, 3_2(214) -> 75
, 3_2(216) -> 215
, 3_2(220) -> 219
, 2_0(1) -> 1
, 2_1(1) -> 34
, 2_1(2) -> 133
, 2_1(5) -> 4
, 2_1(10) -> 133
, 2_1(13) -> 12
, 2_1(17) -> 16
, 2_1(18) -> 116
, 2_1(20) -> 2
, 2_1(23) -> 22
, 2_1(24) -> 23
, 2_1(27) -> 137
, 2_1(29) -> 28
, 2_1(33) -> 155
, 2_1(34) -> 33
, 2_1(37) -> 36
, 2_1(42) -> 1
, 2_1(42) -> 19
, 2_1(42) -> 34
, 2_1(42) -> 68
, 2_1(48) -> 47
, 2_1(55) -> 54
, 2_1(56) -> 116
, 2_1(63) -> 11
, 2_1(66) -> 65
, 2_1(68) -> 105
, 2_1(69) -> 34
, 2_1(73) -> 72
, 2_1(78) -> 77
, 2_1(81) -> 80
, 2_1(82) -> 81
, 2_1(84) -> 83
, 2_1(86) -> 85
, 2_1(88) -> 87
, 2_1(94) -> 34
, 2_1(95) -> 94
, 2_1(101) -> 149
, 2_1(102) -> 56
, 2_1(106) -> 105
, 2_1(111) -> 110
, 2_1(116) -> 115
, 2_1(120) -> 119
, 2_1(124) -> 123
, 2_1(128) -> 63
, 2_1(132) -> 131
, 2_1(133) -> 132
, 2_1(134) -> 5
, 2_1(139) -> 34
, 2_1(143) -> 142
, 2_1(149) -> 206
, 2_1(150) -> 69
, 2_1(151) -> 150
, 2_1(153) -> 152
, 2_1(158) -> 157
, 2_1(163) -> 162
, 2_1(178) -> 34
, 2_1(179) -> 178
, 2_1(180) -> 179
, 2_1(181) -> 180
, 2_1(187) -> 186
, 2_1(198) -> 197
, 2_1(208) -> 207
, 2_2(69) -> 222
, 2_2(117) -> 222
, 2_2(189) -> 188
, 2_2(194) -> 193
, 2_2(215) -> 214
, 2_2(217) -> 216
, 2_2(222) -> 221
, 1_0(1) -> 1
, 1_1(1) -> 19
, 1_1(2) -> 1
, 1_1(2) -> 9
, 1_1(2) -> 10
, 1_1(2) -> 17
, 1_1(2) -> 18
, 1_1(2) -> 19
, 1_1(2) -> 26
, 1_1(2) -> 27
, 1_1(2) -> 41
, 1_1(2) -> 62
, 1_1(2) -> 82
, 1_1(2) -> 212
, 1_1(8) -> 7
, 1_1(9) -> 68
, 1_1(11) -> 41
, 1_1(12) -> 11
, 1_1(19) -> 93
, 1_1(21) -> 20
, 1_1(26) -> 62
, 1_1(27) -> 41
, 1_1(33) -> 32
, 1_1(40) -> 39
, 1_1(41) -> 127
, 1_1(44) -> 43
, 1_1(49) -> 48
, 1_1(50) -> 35
, 1_1(55) -> 122
, 1_1(59) -> 58
, 1_1(70) -> 69
, 1_1(82) -> 172
, 1_1(89) -> 88
, 1_1(90) -> 59
, 1_1(91) -> 90
, 1_1(96) -> 95
, 1_1(98) -> 97
, 1_1(107) -> 106
, 1_1(121) -> 120
, 1_1(138) -> 2
, 1_1(147) -> 146
, 1_1(152) -> 151
, 1_1(157) -> 156
, 1_1(162) -> 42
, 1_1(165) -> 164
, 1_1(166) -> 165
, 1_1(171) -> 170
, 1_1(175) -> 174
, 1_1(199) -> 198
, 1_1(201) -> 200
, 1_1(204) -> 203
, 1_1(206) -> 205
, 1_1(210) -> 209
, 1_1(211) -> 210
, 1_2(190) -> 189
, 1_2(196) -> 195
, 1_2(218) -> 217
, 0_0(1) -> 1
, 0_1(1) -> 10
, 0_1(4) -> 3
, 0_1(10) -> 9
, 0_1(11) -> 1
, 0_1(11) -> 9
, 0_1(11) -> 10
, 0_1(11) -> 24
, 0_1(11) -> 27
, 0_1(11) -> 34
, 0_1(11) -> 183
, 0_1(11) -> 212
, 0_1(14) -> 13
, 0_1(18) -> 49
, 0_1(19) -> 101
, 0_1(27) -> 212
, 0_1(32) -> 31
, 0_1(35) -> 2
, 0_1(41) -> 187
, 0_1(49) -> 98
, 0_1(52) -> 51
, 0_1(56) -> 10
, 0_1(61) -> 60
, 0_1(65) -> 64
, 0_1(74) -> 73
, 0_1(76) -> 69
, 0_1(93) -> 92
, 0_1(94) -> 10
, 0_1(99) -> 98
, 0_1(100) -> 99
, 0_1(103) -> 102
, 0_1(108) -> 107
, 0_1(109) -> 108
, 0_1(110) -> 56
, 0_1(112) -> 111
, 0_1(114) -> 113
, 0_1(118) -> 117
, 0_1(123) -> 20
, 0_1(142) -> 141
, 0_1(148) -> 147
, 0_1(154) -> 153
, 0_1(160) -> 159
, 0_1(182) -> 181
, 0_1(202) -> 201
, 0_2(195) -> 194}
Hurray, we answered YES(?,O(n^1))Tool CDI
stdout:
TIMEOUT
Statistics:
Number of monomials: 0
Last formula building started for bound 0
Last SAT solving started for bound 0Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ 5(4(5(5(3(3(4(x1))))))) -> 1(5(0(2(3(4(1(3(0(0(x1))))))))))
, 5(3(5(5(5(4(1(x1))))))) -> 0(1(2(0(4(3(2(5(4(1(x1))))))))))
, 4(0(5(0(5(4(5(x1))))))) -> 1(2(1(3(2(2(5(3(5(5(x1))))))))))
, 2(3(4(3(4(5(3(x1))))))) -> 0(1(5(2(3(5(0(1(2(2(x1))))))))))
, 1(5(5(2(2(5(5(x1))))))) -> 1(0(4(2(5(3(1(5(1(5(x1))))))))))
, 1(0(0(5(2(3(4(x1))))))) -> 2(4(1(4(5(3(2(1(0(4(x1))))))))))
, 0(5(5(5(2(3(3(x1))))))) -> 1(0(1(3(0(5(4(2(4(2(x1))))))))))
, 0(1(2(5(2(3(5(x1))))))) -> 4(4(3(1(4(0(5(1(5(5(x1))))))))))
, 0(0(5(3(5(3(0(x1))))))) -> 0(2(5(0(2(4(3(1(0(0(x1))))))))))
, 0(0(5(0(4(0(1(x1))))))) -> 5(1(4(4(2(0(3(3(4(1(x1))))))))))
, 5(5(0(1(0(0(x1)))))) -> 5(0(4(2(4(4(2(2(4(0(x1))))))))))
, 4(3(5(0(5(5(x1)))))) -> 4(3(2(5(2(5(2(1(3(5(x1))))))))))
, 4(0(4(5(4(1(x1)))))) -> 4(4(3(1(1(1(4(0(1(1(x1))))))))))
, 3(4(0(5(0(1(x1)))))) -> 3(2(1(3(1(0(0(4(0(1(x1))))))))))
, 3(0(4(5(3(3(x1)))))) -> 4(2(0(5(4(2(1(0(0(3(x1))))))))))
, 1(2(3(5(4(4(x1)))))) -> 4(0(2(0(4(0(3(2(2(4(x1))))))))))
, 0(5(5(1(1(3(x1)))))) -> 0(5(0(3(2(1(4(1(4(2(x1))))))))))
, 0(5(5(1(0(5(x1)))))) -> 1(2(0(2(5(4(3(1(1(5(x1))))))))))
, 0(5(4(5(2(0(x1)))))) -> 0(2(2(5(3(3(2(2(2(0(x1))))))))))
, 0(5(4(3(4(5(x1)))))) -> 1(5(0(2(2(3(4(3(2(5(x1))))))))))
, 0(0(5(0(5(5(x1)))))) -> 1(1(3(4(3(0(2(4(5(2(x1))))))))))
, 5(4(5(4(1(x1))))) -> 1(5(3(4(1(0(4(2(0(1(x1))))))))))
, 5(2(3(5(2(x1))))) -> 5(2(2(1(2(0(5(2(2(2(x1))))))))))
, 3(4(5(0(0(x1))))) -> 4(3(3(1(2(5(0(4(3(0(x1))))))))))
, 2(3(5(1(0(x1))))) -> 2(1(2(5(1(1(5(4(2(0(x1))))))))))
, 0(5(5(1(0(x1))))) -> 0(2(4(5(3(1(5(1(4(0(x1))))))))))
, 5(5(3(4(x1)))) -> 1(1(4(4(1(4(3(4(2(2(x1))))))))))
, 4(0(5(5(x1)))) -> 3(3(2(2(2(0(3(5(3(5(x1))))))))))
, 3(5(0(5(x1)))) -> 3(2(1(4(3(3(2(0(1(5(x1))))))))))
, 3(4(5(3(x1)))) -> 3(2(3(2(1(4(1(0(3(2(x1))))))))))
, 0(5(4(1(x1)))) -> 0(1(4(1(5(1(2(2(0(1(x1))))))))))
, 0(4(5(3(x1)))) -> 4(0(3(2(3(1(1(5(0(5(x1))))))))))
, 3(4(5(x1))) -> 3(2(3(2(1(5(3(5(2(2(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:
{ 5(4(5(5(3(3(4(x1))))))) -> 1(5(0(2(3(4(1(3(0(0(x1))))))))))
, 5(3(5(5(5(4(1(x1))))))) -> 0(1(2(0(4(3(2(5(4(1(x1))))))))))
, 4(0(5(0(5(4(5(x1))))))) -> 1(2(1(3(2(2(5(3(5(5(x1))))))))))
, 2(3(4(3(4(5(3(x1))))))) -> 0(1(5(2(3(5(0(1(2(2(x1))))))))))
, 1(5(5(2(2(5(5(x1))))))) -> 1(0(4(2(5(3(1(5(1(5(x1))))))))))
, 1(0(0(5(2(3(4(x1))))))) -> 2(4(1(4(5(3(2(1(0(4(x1))))))))))
, 0(5(5(5(2(3(3(x1))))))) -> 1(0(1(3(0(5(4(2(4(2(x1))))))))))
, 0(1(2(5(2(3(5(x1))))))) -> 4(4(3(1(4(0(5(1(5(5(x1))))))))))
, 0(0(5(3(5(3(0(x1))))))) -> 0(2(5(0(2(4(3(1(0(0(x1))))))))))
, 0(0(5(0(4(0(1(x1))))))) -> 5(1(4(4(2(0(3(3(4(1(x1))))))))))
, 5(5(0(1(0(0(x1)))))) -> 5(0(4(2(4(4(2(2(4(0(x1))))))))))
, 4(3(5(0(5(5(x1)))))) -> 4(3(2(5(2(5(2(1(3(5(x1))))))))))
, 4(0(4(5(4(1(x1)))))) -> 4(4(3(1(1(1(4(0(1(1(x1))))))))))
, 3(4(0(5(0(1(x1)))))) -> 3(2(1(3(1(0(0(4(0(1(x1))))))))))
, 3(0(4(5(3(3(x1)))))) -> 4(2(0(5(4(2(1(0(0(3(x1))))))))))
, 1(2(3(5(4(4(x1)))))) -> 4(0(2(0(4(0(3(2(2(4(x1))))))))))
, 0(5(5(1(1(3(x1)))))) -> 0(5(0(3(2(1(4(1(4(2(x1))))))))))
, 0(5(5(1(0(5(x1)))))) -> 1(2(0(2(5(4(3(1(1(5(x1))))))))))
, 0(5(4(5(2(0(x1)))))) -> 0(2(2(5(3(3(2(2(2(0(x1))))))))))
, 0(5(4(3(4(5(x1)))))) -> 1(5(0(2(2(3(4(3(2(5(x1))))))))))
, 0(0(5(0(5(5(x1)))))) -> 1(1(3(4(3(0(2(4(5(2(x1))))))))))
, 5(4(5(4(1(x1))))) -> 1(5(3(4(1(0(4(2(0(1(x1))))))))))
, 5(2(3(5(2(x1))))) -> 5(2(2(1(2(0(5(2(2(2(x1))))))))))
, 3(4(5(0(0(x1))))) -> 4(3(3(1(2(5(0(4(3(0(x1))))))))))
, 2(3(5(1(0(x1))))) -> 2(1(2(5(1(1(5(4(2(0(x1))))))))))
, 0(5(5(1(0(x1))))) -> 0(2(4(5(3(1(5(1(4(0(x1))))))))))
, 5(5(3(4(x1)))) -> 1(1(4(4(1(4(3(4(2(2(x1))))))))))
, 4(0(5(5(x1)))) -> 3(3(2(2(2(0(3(5(3(5(x1))))))))))
, 3(5(0(5(x1)))) -> 3(2(1(4(3(3(2(0(1(5(x1))))))))))
, 3(4(5(3(x1)))) -> 3(2(3(2(1(4(1(0(3(2(x1))))))))))
, 0(5(4(1(x1)))) -> 0(1(4(1(5(1(2(2(0(1(x1))))))))))
, 0(4(5(3(x1)))) -> 4(0(3(2(3(1(1(5(0(5(x1))))))))))
, 3(4(5(x1))) -> 3(2(3(2(1(5(3(5(2(2(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:
{ 5(4(5(5(3(3(4(x1))))))) -> 1(5(0(2(3(4(1(3(0(0(x1))))))))))
, 5(3(5(5(5(4(1(x1))))))) -> 0(1(2(0(4(3(2(5(4(1(x1))))))))))
, 4(0(5(0(5(4(5(x1))))))) -> 1(2(1(3(2(2(5(3(5(5(x1))))))))))
, 2(3(4(3(4(5(3(x1))))))) -> 0(1(5(2(3(5(0(1(2(2(x1))))))))))
, 1(5(5(2(2(5(5(x1))))))) -> 1(0(4(2(5(3(1(5(1(5(x1))))))))))
, 1(0(0(5(2(3(4(x1))))))) -> 2(4(1(4(5(3(2(1(0(4(x1))))))))))
, 0(5(5(5(2(3(3(x1))))))) -> 1(0(1(3(0(5(4(2(4(2(x1))))))))))
, 0(1(2(5(2(3(5(x1))))))) -> 4(4(3(1(4(0(5(1(5(5(x1))))))))))
, 0(0(5(3(5(3(0(x1))))))) -> 0(2(5(0(2(4(3(1(0(0(x1))))))))))
, 0(0(5(0(4(0(1(x1))))))) -> 5(1(4(4(2(0(3(3(4(1(x1))))))))))
, 5(5(0(1(0(0(x1)))))) -> 5(0(4(2(4(4(2(2(4(0(x1))))))))))
, 4(3(5(0(5(5(x1)))))) -> 4(3(2(5(2(5(2(1(3(5(x1))))))))))
, 4(0(4(5(4(1(x1)))))) -> 4(4(3(1(1(1(4(0(1(1(x1))))))))))
, 3(4(0(5(0(1(x1)))))) -> 3(2(1(3(1(0(0(4(0(1(x1))))))))))
, 3(0(4(5(3(3(x1)))))) -> 4(2(0(5(4(2(1(0(0(3(x1))))))))))
, 1(2(3(5(4(4(x1)))))) -> 4(0(2(0(4(0(3(2(2(4(x1))))))))))
, 0(5(5(1(1(3(x1)))))) -> 0(5(0(3(2(1(4(1(4(2(x1))))))))))
, 0(5(5(1(0(5(x1)))))) -> 1(2(0(2(5(4(3(1(1(5(x1))))))))))
, 0(5(4(5(2(0(x1)))))) -> 0(2(2(5(3(3(2(2(2(0(x1))))))))))
, 0(5(4(3(4(5(x1)))))) -> 1(5(0(2(2(3(4(3(2(5(x1))))))))))
, 0(0(5(0(5(5(x1)))))) -> 1(1(3(4(3(0(2(4(5(2(x1))))))))))
, 5(4(5(4(1(x1))))) -> 1(5(3(4(1(0(4(2(0(1(x1))))))))))
, 5(2(3(5(2(x1))))) -> 5(2(2(1(2(0(5(2(2(2(x1))))))))))
, 3(4(5(0(0(x1))))) -> 4(3(3(1(2(5(0(4(3(0(x1))))))))))
, 2(3(5(1(0(x1))))) -> 2(1(2(5(1(1(5(4(2(0(x1))))))))))
, 0(5(5(1(0(x1))))) -> 0(2(4(5(3(1(5(1(4(0(x1))))))))))
, 5(5(3(4(x1)))) -> 1(1(4(4(1(4(3(4(2(2(x1))))))))))
, 4(0(5(5(x1)))) -> 3(3(2(2(2(0(3(5(3(5(x1))))))))))
, 3(5(0(5(x1)))) -> 3(2(1(4(3(3(2(0(1(5(x1))))))))))
, 3(4(5(3(x1)))) -> 3(2(3(2(1(4(1(0(3(2(x1))))))))))
, 0(5(4(1(x1)))) -> 0(1(4(1(5(1(2(2(0(1(x1))))))))))
, 0(4(5(3(x1)))) -> 4(0(3(2(3(1(1(5(0(5(x1))))))))))
, 3(4(5(x1))) -> 3(2(3(2(1(5(3(5(2(2(x1))))))))))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..