Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ 2(2(2(1(0(2(0(0(1(0(1(0(2(x1))))))))))))) ->
0(2(2(0(0(2(2(2(1(2(0(0(2(2(0(2(2(x1)))))))))))))))))
, 2(2(1(1(0(2(0(0(0(2(2(0(0(x1))))))))))))) ->
0(0(1(2(0(0(0(2(2(0(1(2(2(2(2(0(0(x1)))))))))))))))))
, 2(2(1(0(1(0(1(1(0(0(0(2(0(x1))))))))))))) ->
0(2(2(1(0(0(1(0(0(1(1(1(1(0(0(2(0(x1)))))))))))))))))
, 2(2(0(0(1(0(2(1(1(1(0(0(1(x1))))))))))))) ->
2(2(1(1(2(0(0(1(2(2(0(2(0(0(2(2(2(x1)))))))))))))))))
, 2(1(0(0(2(1(1(1(0(1(2(2(0(x1))))))))))))) ->
0(0(2(1(0(0(1(1(2(2(2(2(2(1(2(1(0(x1)))))))))))))))))
, 2(0(1(2(1(2(1(2(1(0(0(1(0(x1))))))))))))) ->
2(2(0(0(2(1(1(1(0(0(0(1(1(1(2(2(0(x1)))))))))))))))))
, 1(2(1(1(0(0(1(0(2(1(1(0(2(x1))))))))))))) ->
1(2(2(1(0(0(2(0(1(2(2(0(1(0(0(2(2(x1)))))))))))))))))}
StartTerms: all
Strategy: none
Certificate: YES(?,O(n^1))
Proof:
The problem is match-bounded by 1.
The enriched problem is compatible with the following automaton:
{ 2_0(1) -> 1
, 2_1(1) -> 17
, 2_1(2) -> 28
, 2_1(3) -> 2
, 2_1(4) -> 3
, 2_1(7) -> 6
, 2_1(8) -> 7
, 2_1(9) -> 8
, 2_1(11) -> 10
, 2_1(13) -> 28
, 2_1(14) -> 13
, 2_1(15) -> 14
, 2_1(16) -> 58
, 2_1(17) -> 16
, 2_1(19) -> 17
, 2_1(20) -> 19
, 2_1(24) -> 23
, 2_1(25) -> 24
, 2_1(28) -> 27
, 2_1(29) -> 28
, 2_1(30) -> 29
, 2_1(31) -> 30
, 2_1(32) -> 44
, 2_1(44) -> 83
, 2_1(45) -> 1
, 2_1(45) -> 16
, 2_1(45) -> 17
, 2_1(45) -> 29
, 2_1(45) -> 44
, 2_1(45) -> 83
, 2_1(46) -> 45
, 2_1(49) -> 48
, 2_1(53) -> 52
, 2_1(54) -> 53
, 2_1(56) -> 55
, 2_1(58) -> 27
, 2_1(59) -> 18
, 2_1(65) -> 64
, 2_1(66) -> 65
, 2_1(67) -> 66
, 2_1(68) -> 67
, 2_1(69) -> 68
, 2_1(71) -> 70
, 2_1(74) -> 73
, 2_1(84) -> 17
, 2_1(85) -> 84
, 2_1(86) -> 85
, 2_1(90) -> 89
, 2_1(93) -> 92
, 2_1(94) -> 93
, 0_0(1) -> 1
, 0_1(1) -> 32
, 0_1(2) -> 1
, 0_1(2) -> 16
, 0_1(2) -> 17
, 0_1(2) -> 58
, 0_1(2) -> 70
, 0_1(5) -> 4
, 0_1(6) -> 5
, 0_1(12) -> 11
, 0_1(13) -> 12
, 0_1(15) -> 42
, 0_1(16) -> 15
, 0_1(18) -> 2
, 0_1(21) -> 20
, 0_1(22) -> 21
, 0_1(23) -> 22
, 0_1(26) -> 25
, 0_1(28) -> 15
, 0_1(32) -> 31
, 0_1(34) -> 33
, 0_1(35) -> 34
, 0_1(37) -> 36
, 0_1(38) -> 37
, 0_1(41) -> 94
, 0_1(43) -> 42
, 0_1(44) -> 43
, 0_1(50) -> 49
, 0_1(51) -> 50
, 0_1(55) -> 54
, 0_1(57) -> 56
, 0_1(58) -> 57
, 0_1(61) -> 60
, 0_1(62) -> 61
, 0_1(72) -> 46
, 0_1(73) -> 72
, 0_1(78) -> 77
, 0_1(79) -> 78
, 0_1(80) -> 79
, 0_1(88) -> 87
, 0_1(89) -> 88
, 0_1(91) -> 90
, 1_0(1) -> 1
, 1_1(10) -> 9
, 1_1(17) -> 71
, 1_1(19) -> 18
, 1_1(27) -> 26
, 1_1(32) -> 71
, 1_1(33) -> 4
, 1_1(36) -> 35
, 1_1(39) -> 38
, 1_1(40) -> 39
, 1_1(41) -> 40
, 1_1(42) -> 41
, 1_1(46) -> 71
, 1_1(47) -> 46
, 1_1(48) -> 47
, 1_1(52) -> 51
, 1_1(58) -> 82
, 1_1(60) -> 59
, 1_1(63) -> 62
, 1_1(64) -> 63
, 1_1(70) -> 69
, 1_1(75) -> 74
, 1_1(76) -> 75
, 1_1(77) -> 76
, 1_1(81) -> 80
, 1_1(82) -> 81
, 1_1(83) -> 82
, 1_1(84) -> 1
, 1_1(84) -> 71
, 1_1(87) -> 86
, 1_1(92) -> 91}
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:
{ 2(2(2(1(0(2(0(0(1(0(1(0(2(x1))))))))))))) ->
0(2(2(0(0(2(2(2(1(2(0(0(2(2(0(2(2(x1)))))))))))))))))
, 2(2(1(1(0(2(0(0(0(2(2(0(0(x1))))))))))))) ->
0(0(1(2(0(0(0(2(2(0(1(2(2(2(2(0(0(x1)))))))))))))))))
, 2(2(1(0(1(0(1(1(0(0(0(2(0(x1))))))))))))) ->
0(2(2(1(0(0(1(0(0(1(1(1(1(0(0(2(0(x1)))))))))))))))))
, 2(2(0(0(1(0(2(1(1(1(0(0(1(x1))))))))))))) ->
2(2(1(1(2(0(0(1(2(2(0(2(0(0(2(2(2(x1)))))))))))))))))
, 2(1(0(0(2(1(1(1(0(1(2(2(0(x1))))))))))))) ->
0(0(2(1(0(0(1(1(2(2(2(2(2(1(2(1(0(x1)))))))))))))))))
, 2(0(1(2(1(2(1(2(1(0(0(1(0(x1))))))))))))) ->
2(2(0(0(2(1(1(1(0(0(0(1(1(1(2(2(0(x1)))))))))))))))))
, 1(2(1(1(0(0(1(0(2(1(1(0(2(x1))))))))))))) ->
1(2(2(1(0(0(2(0(1(2(2(0(1(0(0(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:
{ 2(2(2(1(0(2(0(0(1(0(1(0(2(x1))))))))))))) ->
0(2(2(0(0(2(2(2(1(2(0(0(2(2(0(2(2(x1)))))))))))))))))
, 2(2(1(1(0(2(0(0(0(2(2(0(0(x1))))))))))))) ->
0(0(1(2(0(0(0(2(2(0(1(2(2(2(2(0(0(x1)))))))))))))))))
, 2(2(1(0(1(0(1(1(0(0(0(2(0(x1))))))))))))) ->
0(2(2(1(0(0(1(0(0(1(1(1(1(0(0(2(0(x1)))))))))))))))))
, 2(2(0(0(1(0(2(1(1(1(0(0(1(x1))))))))))))) ->
2(2(1(1(2(0(0(1(2(2(0(2(0(0(2(2(2(x1)))))))))))))))))
, 2(1(0(0(2(1(1(1(0(1(2(2(0(x1))))))))))))) ->
0(0(2(1(0(0(1(1(2(2(2(2(2(1(2(1(0(x1)))))))))))))))))
, 2(0(1(2(1(2(1(2(1(0(0(1(0(x1))))))))))))) ->
2(2(0(0(2(1(1(1(0(0(0(1(1(1(2(2(0(x1)))))))))))))))))
, 1(2(1(1(0(0(1(0(2(1(1(0(2(x1))))))))))))) ->
1(2(2(1(0(0(2(0(1(2(2(0(1(0(0(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:
{ 2(2(2(1(0(2(0(0(1(0(1(0(2(x1))))))))))))) ->
0(2(2(0(0(2(2(2(1(2(0(0(2(2(0(2(2(x1)))))))))))))))))
, 2(2(1(1(0(2(0(0(0(2(2(0(0(x1))))))))))))) ->
0(0(1(2(0(0(0(2(2(0(1(2(2(2(2(0(0(x1)))))))))))))))))
, 2(2(1(0(1(0(1(1(0(0(0(2(0(x1))))))))))))) ->
0(2(2(1(0(0(1(0(0(1(1(1(1(0(0(2(0(x1)))))))))))))))))
, 2(2(0(0(1(0(2(1(1(1(0(0(1(x1))))))))))))) ->
2(2(1(1(2(0(0(1(2(2(0(2(0(0(2(2(2(x1)))))))))))))))))
, 2(1(0(0(2(1(1(1(0(1(2(2(0(x1))))))))))))) ->
0(0(2(1(0(0(1(1(2(2(2(2(2(1(2(1(0(x1)))))))))))))))))
, 2(0(1(2(1(2(1(2(1(0(0(1(0(x1))))))))))))) ->
2(2(0(0(2(1(1(1(0(0(0(1(1(1(2(2(0(x1)))))))))))))))))
, 1(2(1(1(0(0(1(0(2(1(1(0(2(x1))))))))))))) ->
1(2(2(1(0(0(2(0(1(2(2(0(1(0(0(2(2(x1)))))))))))))))))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..