Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ 3(5(3(4(2(x1))))) -> 0(5(4(2(3(3(x1))))))
, 3(5(0(4(2(x1))))) -> 2(5(4(3(0(0(x1))))))
, 3(5(0(4(2(x1))))) -> 2(0(4(4(5(3(x1))))))
, 3(5(0(0(2(x1))))) -> 0(3(0(2(4(5(x1))))))
, 3(4(2(0(2(x1))))) -> 4(2(2(3(0(3(x1))))))
, 3(4(2(0(2(x1))))) -> 3(2(0(4(2(3(x1))))))
, 3(4(1(5(2(x1))))) -> 2(3(0(1(4(5(x1))))))
, 3(4(1(0(2(x1))))) -> 3(1(2(3(0(4(x1))))))
, 3(4(0(0(2(x1))))) -> 3(0(0(4(4(2(x1))))))
, 3(3(4(0(2(x1))))) -> 3(0(0(4(2(3(x1))))))
, 3(1(3(5(2(x1))))) -> 3(0(3(5(1(2(x1))))))
, 3(1(0(0(2(x1))))) -> 3(0(1(2(2(0(x1))))))
, 1(3(5(0(2(x1))))) -> 1(0(2(5(2(3(x1))))))
, 1(3(4(0(2(x1))))) -> 1(2(3(0(1(4(x1))))))
, 1(1(0(2(2(x1))))) -> 1(1(2(0(1(2(x1))))))
, 1(0(3(5(2(x1))))) -> 4(5(3(1(2(0(x1))))))
, 1(0(0(4(2(x1))))) -> 0(4(5(1(0(2(x1))))))
, 0(3(5(0(2(x1))))) -> 2(1(0(5(3(0(x1))))))
, 0(3(4(0(2(x1))))) -> 0(3(1(0(4(2(x1))))))
, 0(2(3(4(2(x1))))) -> 3(0(2(2(4(5(x1))))))
, 3(5(0(2(x1)))) -> 5(5(2(3(0(3(x1))))))
, 3(5(0(2(x1)))) -> 3(0(0(2(5(4(x1))))))
, 3(5(0(2(x1)))) -> 2(5(3(0(0(0(x1))))))
, 3(5(0(2(x1)))) -> 3(0(3(2(5(x1)))))
, 3(4(0(2(x1)))) -> 4(2(3(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 3(3(0(5(2(4(x1))))))
, 3(4(0(2(x1)))) -> 3(0(2(1(1(4(x1))))))
, 3(4(0(2(x1)))) -> 2(0(4(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 4(1(2(3(0(x1)))))
, 3(4(0(2(x1)))) -> 3(1(0(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(5(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(1(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(0(2(4(x1)))))
, 3(1(0(2(x1)))) -> 3(0(1(2(0(x1)))))
, 1(3(5(2(x1)))) -> 4(5(1(2(3(x1)))))
, 1(3(5(2(x1)))) -> 2(3(1(0(5(x1)))))
, 1(3(4(2(x1)))) -> 1(2(3(5(5(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(5(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(3(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(1(2(3(4(x1)))))
, 1(0(2(2(x1)))) -> 1(1(1(2(2(0(x1))))))
, 1(0(2(2(x1)))) -> 2(1(2(3(0(x1)))))
, 1(0(0(2(x1)))) -> 3(0(0(1(1(2(x1))))))
, 1(0(0(2(x1)))) -> 1(3(3(0(2(0(x1))))))
, 1(0(0(2(x1)))) -> 1(0(1(1(2(0(x1))))))
, 1(0(0(2(x1)))) -> 2(3(0(0(1(x1)))))
, 0(1(0(2(x1)))) -> 3(0(1(2(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) -> 36
, 2_1(5) -> 4
, 2_1(6) -> 26
, 2_1(7) -> 1
, 2_1(7) -> 6
, 2_1(7) -> 11
, 2_1(7) -> 22
, 2_1(7) -> 39
, 2_1(7) -> 57
, 2_1(7) -> 61
, 2_1(7) -> 89
, 2_1(7) -> 117
, 2_1(7) -> 166
, 2_1(11) -> 44
, 2_1(16) -> 24
, 2_1(17) -> 16
, 2_1(18) -> 37
, 2_1(19) -> 1
, 2_1(19) -> 61
, 2_1(19) -> 117
, 2_1(19) -> 166
, 2_1(20) -> 19
, 2_1(21) -> 20
, 2_1(22) -> 44
, 2_1(24) -> 23
, 2_1(25) -> 24
, 2_1(27) -> 89
, 2_1(28) -> 24
, 2_1(30) -> 29
, 2_1(32) -> 77
, 2_1(44) -> 43
, 2_1(52) -> 51
, 2_1(53) -> 50
, 2_1(57) -> 56
, 2_1(65) -> 79
, 2_1(70) -> 25
, 2_1(117) -> 117
, 2_1(166) -> 166
, 2_2(1) -> 160
, 2_2(7) -> 141
, 2_2(19) -> 141
, 2_2(20) -> 141
, 2_2(21) -> 141
, 2_2(88) -> 101
, 2_2(89) -> 88
, 2_2(92) -> 91
, 2_2(94) -> 167
, 2_2(98) -> 97
, 2_2(102) -> 101
, 2_2(103) -> 102
, 2_2(104) -> 61
, 2_2(106) -> 105
, 2_2(137) -> 136
, 2_2(151) -> 150
, 2_2(152) -> 50
, 2_2(167) -> 87
, 0_0(1) -> 1
, 0_1(1) -> 11
, 0_1(2) -> 1
, 0_1(2) -> 6
, 0_1(2) -> 11
, 0_1(2) -> 22
, 0_1(2) -> 61
, 0_1(2) -> 89
, 0_1(2) -> 117
, 0_1(2) -> 166
, 0_1(6) -> 22
, 0_1(7) -> 11
, 0_1(10) -> 72
, 0_1(11) -> 10
, 0_1(12) -> 7
, 0_1(16) -> 15
, 0_1(18) -> 90
, 0_1(19) -> 22
, 0_1(20) -> 11
, 0_1(22) -> 10
, 0_1(24) -> 23
, 0_1(25) -> 24
, 0_1(28) -> 27
, 0_1(29) -> 23
, 0_1(32) -> 31
, 0_1(33) -> 23
, 0_1(34) -> 33
, 0_1(35) -> 66
, 0_1(36) -> 62
, 0_1(37) -> 24
, 0_1(39) -> 57
, 0_1(44) -> 116
, 0_1(51) -> 50
, 0_1(52) -> 11
, 0_1(55) -> 54
, 0_1(59) -> 23
, 0_1(62) -> 11
, 0_1(64) -> 63
, 0_1(76) -> 75
, 0_1(77) -> 29
, 0_1(117) -> 28
, 0_2(1) -> 89
, 0_2(7) -> 103
, 0_2(19) -> 89
, 0_2(20) -> 89
, 0_2(21) -> 103
, 0_2(32) -> 89
, 0_2(52) -> 89
, 0_2(87) -> 86
, 0_2(88) -> 162
, 0_2(100) -> 86
, 0_2(139) -> 138
, 0_2(140) -> 98
, 0_2(155) -> 154
, 0_2(157) -> 156
, 0_2(158) -> 157
, 0_2(163) -> 99
, 0_2(165) -> 164
, 0_2(166) -> 165
, 1_0(1) -> 1
, 1_1(1) -> 117
, 1_1(6) -> 39
, 1_1(7) -> 117
, 1_1(11) -> 61
, 1_1(17) -> 28
, 1_1(19) -> 117
, 1_1(20) -> 19
, 1_1(22) -> 61
, 1_1(24) -> 50
, 1_1(26) -> 1
, 1_1(26) -> 39
, 1_1(26) -> 58
, 1_1(26) -> 117
, 1_1(26) -> 166
, 1_1(29) -> 23
, 1_1(31) -> 15
, 1_1(32) -> 55
, 1_1(36) -> 39
, 1_1(39) -> 25
, 1_1(43) -> 24
, 1_1(44) -> 59
, 1_1(50) -> 1
, 1_1(50) -> 39
, 1_1(50) -> 61
, 1_1(50) -> 117
, 1_1(50) -> 166
, 1_1(55) -> 16
, 1_1(56) -> 50
, 1_1(59) -> 51
, 1_1(61) -> 39
, 1_1(62) -> 61
, 1_1(63) -> 7
, 1_1(66) -> 15
, 1_1(77) -> 24
, 1_1(79) -> 19
, 1_1(90) -> 27
, 1_2(1) -> 166
, 1_2(87) -> 163
, 1_2(88) -> 87
, 1_2(91) -> 39
, 1_2(91) -> 117
, 1_2(91) -> 166
, 1_2(97) -> 91
, 1_2(99) -> 61
, 1_2(100) -> 99
, 1_2(101) -> 100
, 1_2(102) -> 87
, 1_2(105) -> 104
, 1_2(136) -> 86
, 1_2(141) -> 140
, 1_2(150) -> 149
, 1_2(154) -> 153
, 1_2(159) -> 158
, 1_2(160) -> 159
, 3_0(1) -> 1
, 3_1(1) -> 6
, 3_1(6) -> 5
, 3_1(7) -> 6
, 3_1(10) -> 9
, 3_1(11) -> 1
, 3_1(11) -> 6
, 3_1(11) -> 57
, 3_1(11) -> 65
, 3_1(15) -> 2
, 3_1(17) -> 54
, 3_1(19) -> 1
, 3_1(19) -> 6
, 3_1(19) -> 57
, 3_1(20) -> 6
, 3_1(21) -> 74
, 3_1(22) -> 21
, 3_1(23) -> 1
, 3_1(23) -> 5
, 3_1(23) -> 6
, 3_1(23) -> 11
, 3_1(23) -> 28
, 3_1(23) -> 53
, 3_1(23) -> 57
, 3_1(23) -> 61
, 3_1(23) -> 62
, 3_1(23) -> 89
, 3_1(23) -> 117
, 3_1(23) -> 165
, 3_1(23) -> 166
, 3_1(27) -> 7
, 3_1(31) -> 30
, 3_1(32) -> 57
, 3_1(34) -> 6
, 3_1(37) -> 24
, 3_1(54) -> 53
, 3_1(57) -> 1
, 3_1(57) -> 6
, 3_1(57) -> 53
, 3_1(57) -> 57
, 3_1(59) -> 58
, 3_1(61) -> 1
, 3_1(61) -> 6
, 3_1(61) -> 57
, 3_1(65) -> 1
, 3_1(65) -> 6
, 3_1(65) -> 57
, 3_1(65) -> 74
, 3_1(72) -> 8
, 3_1(74) -> 20
, 3_1(75) -> 1
, 3_1(75) -> 6
, 3_1(75) -> 23
, 3_1(75) -> 57
, 3_1(115) -> 50
, 3_1(116) -> 115
, 3_2(7) -> 151
, 3_2(86) -> 1
, 3_2(86) -> 5
, 3_2(86) -> 6
, 3_2(86) -> 11
, 3_2(86) -> 28
, 3_2(86) -> 53
, 3_2(86) -> 57
, 3_2(86) -> 61
, 3_2(86) -> 62
, 3_2(86) -> 89
, 3_2(86) -> 117
, 3_2(86) -> 165
, 3_2(86) -> 166
, 3_2(89) -> 106
, 3_2(93) -> 92
, 3_2(94) -> 93
, 3_2(95) -> 98
, 3_2(103) -> 106
, 3_2(138) -> 137
, 3_2(153) -> 152
, 3_2(156) -> 61
, 3_2(161) -> 99
, 3_2(162) -> 161
, 3_2(164) -> 104
, 4_0(1) -> 1
, 4_1(1) -> 32
, 4_1(4) -> 3
, 4_1(7) -> 32
, 4_1(9) -> 8
, 4_1(13) -> 12
, 4_1(14) -> 13
, 4_1(17) -> 54
, 4_1(18) -> 17
, 4_1(19) -> 1
, 4_1(19) -> 6
, 4_1(19) -> 39
, 4_1(19) -> 57
, 4_1(19) -> 61
, 4_1(19) -> 117
, 4_1(19) -> 166
, 4_1(20) -> 32
, 4_1(26) -> 25
, 4_1(32) -> 34
, 4_1(34) -> 54
, 4_1(35) -> 34
, 4_1(36) -> 35
, 4_1(52) -> 1
, 4_1(60) -> 2
, 4_1(74) -> 12
, 4_2(20) -> 95
, 4_2(52) -> 139
, 4_2(94) -> 93
, 4_2(95) -> 94
, 4_2(96) -> 94
, 4_2(148) -> 50
, 5_0(1) -> 1
, 5_1(1) -> 18
, 5_1(3) -> 2
, 5_1(6) -> 14
, 5_1(7) -> 18
, 5_1(8) -> 7
, 5_1(17) -> 54
, 5_1(18) -> 1
, 5_1(18) -> 6
, 5_1(19) -> 18
, 5_1(20) -> 18
, 5_1(21) -> 64
, 5_1(26) -> 52
, 5_1(32) -> 70
, 5_1(39) -> 37
, 5_1(58) -> 19
, 5_1(61) -> 60
, 5_1(65) -> 64
, 5_1(70) -> 54
, 5_1(77) -> 76
, 5_2(7) -> 155
, 5_2(20) -> 96
, 5_2(94) -> 93
, 5_2(95) -> 94
, 5_2(149) -> 148}
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:
{ 3(5(3(4(2(x1))))) -> 0(5(4(2(3(3(x1))))))
, 3(5(0(4(2(x1))))) -> 2(5(4(3(0(0(x1))))))
, 3(5(0(4(2(x1))))) -> 2(0(4(4(5(3(x1))))))
, 3(5(0(0(2(x1))))) -> 0(3(0(2(4(5(x1))))))
, 3(4(2(0(2(x1))))) -> 4(2(2(3(0(3(x1))))))
, 3(4(2(0(2(x1))))) -> 3(2(0(4(2(3(x1))))))
, 3(4(1(5(2(x1))))) -> 2(3(0(1(4(5(x1))))))
, 3(4(1(0(2(x1))))) -> 3(1(2(3(0(4(x1))))))
, 3(4(0(0(2(x1))))) -> 3(0(0(4(4(2(x1))))))
, 3(3(4(0(2(x1))))) -> 3(0(0(4(2(3(x1))))))
, 3(1(3(5(2(x1))))) -> 3(0(3(5(1(2(x1))))))
, 3(1(0(0(2(x1))))) -> 3(0(1(2(2(0(x1))))))
, 1(3(5(0(2(x1))))) -> 1(0(2(5(2(3(x1))))))
, 1(3(4(0(2(x1))))) -> 1(2(3(0(1(4(x1))))))
, 1(1(0(2(2(x1))))) -> 1(1(2(0(1(2(x1))))))
, 1(0(3(5(2(x1))))) -> 4(5(3(1(2(0(x1))))))
, 1(0(0(4(2(x1))))) -> 0(4(5(1(0(2(x1))))))
, 0(3(5(0(2(x1))))) -> 2(1(0(5(3(0(x1))))))
, 0(3(4(0(2(x1))))) -> 0(3(1(0(4(2(x1))))))
, 0(2(3(4(2(x1))))) -> 3(0(2(2(4(5(x1))))))
, 3(5(0(2(x1)))) -> 5(5(2(3(0(3(x1))))))
, 3(5(0(2(x1)))) -> 3(0(0(2(5(4(x1))))))
, 3(5(0(2(x1)))) -> 2(5(3(0(0(0(x1))))))
, 3(5(0(2(x1)))) -> 3(0(3(2(5(x1)))))
, 3(4(0(2(x1)))) -> 4(2(3(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 3(3(0(5(2(4(x1))))))
, 3(4(0(2(x1)))) -> 3(0(2(1(1(4(x1))))))
, 3(4(0(2(x1)))) -> 2(0(4(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 4(1(2(3(0(x1)))))
, 3(4(0(2(x1)))) -> 3(1(0(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(5(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(1(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(0(2(4(x1)))))
, 3(1(0(2(x1)))) -> 3(0(1(2(0(x1)))))
, 1(3(5(2(x1)))) -> 4(5(1(2(3(x1)))))
, 1(3(5(2(x1)))) -> 2(3(1(0(5(x1)))))
, 1(3(4(2(x1)))) -> 1(2(3(5(5(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(5(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(3(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(1(2(3(4(x1)))))
, 1(0(2(2(x1)))) -> 1(1(1(2(2(0(x1))))))
, 1(0(2(2(x1)))) -> 2(1(2(3(0(x1)))))
, 1(0(0(2(x1)))) -> 3(0(0(1(1(2(x1))))))
, 1(0(0(2(x1)))) -> 1(3(3(0(2(0(x1))))))
, 1(0(0(2(x1)))) -> 1(0(1(1(2(0(x1))))))
, 1(0(0(2(x1)))) -> 2(3(0(0(1(x1)))))
, 0(1(0(2(x1)))) -> 3(0(1(2(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:
{ 3(5(3(4(2(x1))))) -> 0(5(4(2(3(3(x1))))))
, 3(5(0(4(2(x1))))) -> 2(5(4(3(0(0(x1))))))
, 3(5(0(4(2(x1))))) -> 2(0(4(4(5(3(x1))))))
, 3(5(0(0(2(x1))))) -> 0(3(0(2(4(5(x1))))))
, 3(4(2(0(2(x1))))) -> 4(2(2(3(0(3(x1))))))
, 3(4(2(0(2(x1))))) -> 3(2(0(4(2(3(x1))))))
, 3(4(1(5(2(x1))))) -> 2(3(0(1(4(5(x1))))))
, 3(4(1(0(2(x1))))) -> 3(1(2(3(0(4(x1))))))
, 3(4(0(0(2(x1))))) -> 3(0(0(4(4(2(x1))))))
, 3(3(4(0(2(x1))))) -> 3(0(0(4(2(3(x1))))))
, 3(1(3(5(2(x1))))) -> 3(0(3(5(1(2(x1))))))
, 3(1(0(0(2(x1))))) -> 3(0(1(2(2(0(x1))))))
, 1(3(5(0(2(x1))))) -> 1(0(2(5(2(3(x1))))))
, 1(3(4(0(2(x1))))) -> 1(2(3(0(1(4(x1))))))
, 1(1(0(2(2(x1))))) -> 1(1(2(0(1(2(x1))))))
, 1(0(3(5(2(x1))))) -> 4(5(3(1(2(0(x1))))))
, 1(0(0(4(2(x1))))) -> 0(4(5(1(0(2(x1))))))
, 0(3(5(0(2(x1))))) -> 2(1(0(5(3(0(x1))))))
, 0(3(4(0(2(x1))))) -> 0(3(1(0(4(2(x1))))))
, 0(2(3(4(2(x1))))) -> 3(0(2(2(4(5(x1))))))
, 3(5(0(2(x1)))) -> 5(5(2(3(0(3(x1))))))
, 3(5(0(2(x1)))) -> 3(0(0(2(5(4(x1))))))
, 3(5(0(2(x1)))) -> 2(5(3(0(0(0(x1))))))
, 3(5(0(2(x1)))) -> 3(0(3(2(5(x1)))))
, 3(4(0(2(x1)))) -> 4(2(3(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 3(3(0(5(2(4(x1))))))
, 3(4(0(2(x1)))) -> 3(0(2(1(1(4(x1))))))
, 3(4(0(2(x1)))) -> 2(0(4(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 4(1(2(3(0(x1)))))
, 3(4(0(2(x1)))) -> 3(1(0(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(5(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(1(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(0(2(4(x1)))))
, 3(1(0(2(x1)))) -> 3(0(1(2(0(x1)))))
, 1(3(5(2(x1)))) -> 4(5(1(2(3(x1)))))
, 1(3(5(2(x1)))) -> 2(3(1(0(5(x1)))))
, 1(3(4(2(x1)))) -> 1(2(3(5(5(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(5(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(3(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(1(2(3(4(x1)))))
, 1(0(2(2(x1)))) -> 1(1(1(2(2(0(x1))))))
, 1(0(2(2(x1)))) -> 2(1(2(3(0(x1)))))
, 1(0(0(2(x1)))) -> 3(0(0(1(1(2(x1))))))
, 1(0(0(2(x1)))) -> 1(3(3(0(2(0(x1))))))
, 1(0(0(2(x1)))) -> 1(0(1(1(2(0(x1))))))
, 1(0(0(2(x1)))) -> 2(3(0(0(1(x1)))))
, 0(1(0(2(x1)))) -> 3(0(1(2(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:
{ 3(5(3(4(2(x1))))) -> 0(5(4(2(3(3(x1))))))
, 3(5(0(4(2(x1))))) -> 2(5(4(3(0(0(x1))))))
, 3(5(0(4(2(x1))))) -> 2(0(4(4(5(3(x1))))))
, 3(5(0(0(2(x1))))) -> 0(3(0(2(4(5(x1))))))
, 3(4(2(0(2(x1))))) -> 4(2(2(3(0(3(x1))))))
, 3(4(2(0(2(x1))))) -> 3(2(0(4(2(3(x1))))))
, 3(4(1(5(2(x1))))) -> 2(3(0(1(4(5(x1))))))
, 3(4(1(0(2(x1))))) -> 3(1(2(3(0(4(x1))))))
, 3(4(0(0(2(x1))))) -> 3(0(0(4(4(2(x1))))))
, 3(3(4(0(2(x1))))) -> 3(0(0(4(2(3(x1))))))
, 3(1(3(5(2(x1))))) -> 3(0(3(5(1(2(x1))))))
, 3(1(0(0(2(x1))))) -> 3(0(1(2(2(0(x1))))))
, 1(3(5(0(2(x1))))) -> 1(0(2(5(2(3(x1))))))
, 1(3(4(0(2(x1))))) -> 1(2(3(0(1(4(x1))))))
, 1(1(0(2(2(x1))))) -> 1(1(2(0(1(2(x1))))))
, 1(0(3(5(2(x1))))) -> 4(5(3(1(2(0(x1))))))
, 1(0(0(4(2(x1))))) -> 0(4(5(1(0(2(x1))))))
, 0(3(5(0(2(x1))))) -> 2(1(0(5(3(0(x1))))))
, 0(3(4(0(2(x1))))) -> 0(3(1(0(4(2(x1))))))
, 0(2(3(4(2(x1))))) -> 3(0(2(2(4(5(x1))))))
, 3(5(0(2(x1)))) -> 5(5(2(3(0(3(x1))))))
, 3(5(0(2(x1)))) -> 3(0(0(2(5(4(x1))))))
, 3(5(0(2(x1)))) -> 2(5(3(0(0(0(x1))))))
, 3(5(0(2(x1)))) -> 3(0(3(2(5(x1)))))
, 3(4(0(2(x1)))) -> 4(2(3(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 3(3(0(5(2(4(x1))))))
, 3(4(0(2(x1)))) -> 3(0(2(1(1(4(x1))))))
, 3(4(0(2(x1)))) -> 2(0(4(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 4(1(2(3(0(x1)))))
, 3(4(0(2(x1)))) -> 3(1(0(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(5(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(1(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(0(2(4(x1)))))
, 3(1(0(2(x1)))) -> 3(0(1(2(0(x1)))))
, 1(3(5(2(x1)))) -> 4(5(1(2(3(x1)))))
, 1(3(5(2(x1)))) -> 2(3(1(0(5(x1)))))
, 1(3(4(2(x1)))) -> 1(2(3(5(5(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(5(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(3(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(1(2(3(4(x1)))))
, 1(0(2(2(x1)))) -> 1(1(1(2(2(0(x1))))))
, 1(0(2(2(x1)))) -> 2(1(2(3(0(x1)))))
, 1(0(0(2(x1)))) -> 3(0(0(1(1(2(x1))))))
, 1(0(0(2(x1)))) -> 1(3(3(0(2(0(x1))))))
, 1(0(0(2(x1)))) -> 1(0(1(1(2(0(x1))))))
, 1(0(0(2(x1)))) -> 2(3(0(0(1(x1)))))
, 0(1(0(2(x1)))) -> 3(0(1(2(0(x1)))))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI2
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ 3(5(3(4(2(x1))))) -> 0(5(4(2(3(3(x1))))))
, 3(5(0(4(2(x1))))) -> 2(5(4(3(0(0(x1))))))
, 3(5(0(4(2(x1))))) -> 2(0(4(4(5(3(x1))))))
, 3(5(0(0(2(x1))))) -> 0(3(0(2(4(5(x1))))))
, 3(4(2(0(2(x1))))) -> 4(2(2(3(0(3(x1))))))
, 3(4(2(0(2(x1))))) -> 3(2(0(4(2(3(x1))))))
, 3(4(1(5(2(x1))))) -> 2(3(0(1(4(5(x1))))))
, 3(4(1(0(2(x1))))) -> 3(1(2(3(0(4(x1))))))
, 3(4(0(0(2(x1))))) -> 3(0(0(4(4(2(x1))))))
, 3(3(4(0(2(x1))))) -> 3(0(0(4(2(3(x1))))))
, 3(1(3(5(2(x1))))) -> 3(0(3(5(1(2(x1))))))
, 3(1(0(0(2(x1))))) -> 3(0(1(2(2(0(x1))))))
, 1(3(5(0(2(x1))))) -> 1(0(2(5(2(3(x1))))))
, 1(3(4(0(2(x1))))) -> 1(2(3(0(1(4(x1))))))
, 1(1(0(2(2(x1))))) -> 1(1(2(0(1(2(x1))))))
, 1(0(3(5(2(x1))))) -> 4(5(3(1(2(0(x1))))))
, 1(0(0(4(2(x1))))) -> 0(4(5(1(0(2(x1))))))
, 0(3(5(0(2(x1))))) -> 2(1(0(5(3(0(x1))))))
, 0(3(4(0(2(x1))))) -> 0(3(1(0(4(2(x1))))))
, 0(2(3(4(2(x1))))) -> 3(0(2(2(4(5(x1))))))
, 3(5(0(2(x1)))) -> 5(5(2(3(0(3(x1))))))
, 3(5(0(2(x1)))) -> 3(0(0(2(5(4(x1))))))
, 3(5(0(2(x1)))) -> 2(5(3(0(0(0(x1))))))
, 3(5(0(2(x1)))) -> 3(0(3(2(5(x1)))))
, 3(4(0(2(x1)))) -> 4(2(3(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 3(3(0(5(2(4(x1))))))
, 3(4(0(2(x1)))) -> 3(0(2(1(1(4(x1))))))
, 3(4(0(2(x1)))) -> 2(0(4(3(3(0(x1))))))
, 3(4(0(2(x1)))) -> 4(1(2(3(0(x1)))))
, 3(4(0(2(x1)))) -> 3(1(0(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(5(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(1(2(4(x1)))))
, 3(4(0(2(x1)))) -> 3(0(0(2(4(x1)))))
, 3(1(0(2(x1)))) -> 3(0(1(2(0(x1)))))
, 1(3(5(2(x1)))) -> 4(5(1(2(3(x1)))))
, 1(3(5(2(x1)))) -> 2(3(1(0(5(x1)))))
, 1(3(4(2(x1)))) -> 1(2(3(5(5(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(5(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(4(4(4(x1))))))
, 1(3(4(2(x1)))) -> 1(2(3(3(4(5(x1))))))
, 1(3(4(2(x1)))) -> 1(1(2(3(4(x1)))))
, 1(0(2(2(x1)))) -> 1(1(1(2(2(0(x1))))))
, 1(0(2(2(x1)))) -> 2(1(2(3(0(x1)))))
, 1(0(0(2(x1)))) -> 3(0(0(1(1(2(x1))))))
, 1(0(0(2(x1)))) -> 1(3(3(0(2(0(x1))))))
, 1(0(0(2(x1)))) -> 1(0(1(1(2(0(x1))))))
, 1(0(0(2(x1)))) -> 2(3(0(0(1(x1)))))
, 0(1(0(2(x1)))) -> 3(0(1(2(0(x1)))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..