Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{b(b(a(b(b(a(b(b(b(b(b(b(a(b(x1)))))))))))))) ->
b(b(b(b(b(a(b(b(a(b(b(a(b(b(b(b(b(b(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:
{ b_0(1) -> 1
, b_1(1) -> 18
, b_1(2) -> 1
, b_1(2) -> 7
, b_1(2) -> 17
, b_1(2) -> 18
, b_1(3) -> 2
, b_1(4) -> 3
, b_1(5) -> 4
, b_1(6) -> 5
, b_1(7) -> 17
, b_1(8) -> 7
, b_1(9) -> 8
, b_1(11) -> 10
, b_1(12) -> 11
, b_1(14) -> 13
, b_1(15) -> 14
, b_1(16) -> 15
, b_1(17) -> 16
, b_1(18) -> 17
, a_0(1) -> 1
, a_1(7) -> 6
, a_1(10) -> 9
, a_1(13) -> 12}
Hurray, we answered YES(?,O(n^1))Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{b(b(a(b(b(a(b(b(b(b(b(b(a(b(x1)))))))))))))) ->
b(b(b(b(b(a(b(b(a(b(b(a(b(b(b(b(b(b(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:
{b(b(a(b(b(a(b(b(b(b(b(b(a(b(x1)))))))))))))) ->
b(b(b(b(b(a(b(b(a(b(b(a(b(b(b(b(b(b(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:
{b(b(a(b(b(a(b(b(b(b(b(b(a(b(x1)))))))))))))) ->
b(b(b(b(b(a(b(b(a(b(b(a(b(b(b(b(b(b(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:
{b(b(a(b(b(a(b(b(b(b(b(b(a(b(x1)))))))))))))) ->
b(b(b(b(b(a(b(b(a(b(b(a(b(b(b(b(b(b(x1))))))))))))))))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..