Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{a(a(b(a(a(b(a(x1))))))) -> a(b(a(a(b(a(a(a(b(x1)))))))))}
StartTerms: all
Strategy: none
Certificate: YES(?,O(n^1))
Proof:
The problem is match-bounded by 3.
The enriched problem is compatible with the following automaton:
{ a_0(1) -> 1
, a_0(2) -> 1
, a_1(3) -> 1
, a_1(3) -> 8
, a_1(3) -> 35
, a_1(5) -> 4
, a_1(6) -> 5
, a_1(8) -> 7
, a_1(9) -> 8
, a_1(10) -> 9
, a_2(14) -> 8
, a_2(14) -> 35
, a_2(14) -> 62
, a_2(16) -> 15
, a_2(17) -> 16
, a_2(19) -> 18
, a_2(20) -> 19
, a_2(21) -> 20
, a_2(22) -> 4
, a_2(22) -> 31
, a_2(24) -> 23
, a_2(25) -> 24
, a_2(27) -> 26
, a_2(28) -> 27
, a_2(29) -> 28
, a_2(30) -> 7
, a_2(30) -> 34
, a_2(32) -> 31
, a_2(33) -> 32
, a_2(35) -> 34
, a_2(36) -> 35
, a_2(37) -> 36
, a_3(49) -> 31
, a_3(49) -> 58
, a_3(51) -> 50
, a_3(52) -> 51
, a_3(54) -> 53
, a_3(55) -> 54
, a_3(56) -> 55
, a_3(57) -> 34
, a_3(57) -> 61
, a_3(59) -> 58
, a_3(60) -> 59
, a_3(62) -> 61
, a_3(63) -> 62
, a_3(64) -> 63
, b_0(1) -> 2
, b_0(2) -> 2
, b_1(1) -> 10
, b_1(2) -> 10
, b_1(3) -> 10
, b_1(4) -> 3
, b_1(5) -> 10
, b_1(7) -> 6
, b_1(8) -> 10
, b_1(22) -> 10
, b_1(30) -> 10
, b_2(3) -> 21
, b_2(5) -> 29
, b_2(6) -> 21
, b_2(8) -> 37
, b_2(9) -> 21
, b_2(10) -> 21
, b_2(14) -> 21
, b_2(15) -> 14
, b_2(16) -> 29
, b_2(18) -> 17
, b_2(19) -> 37
, b_2(22) -> 29
, b_2(23) -> 22
, b_2(26) -> 25
, b_2(30) -> 37
, b_2(31) -> 30
, b_2(34) -> 33
, b_3(16) -> 56
, b_3(19) -> 64
, b_3(50) -> 49
, b_3(53) -> 52
, b_3(58) -> 57
, b_3(61) -> 60}
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:
{a(a(b(a(a(b(a(x1))))))) -> a(b(a(a(b(a(a(a(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:
{a(a(b(a(a(b(a(x1))))))) -> a(b(a(a(b(a(a(a(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:
{a(a(b(a(a(b(a(x1))))))) -> a(b(a(a(b(a(a(a(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:
{a(a(b(a(a(b(a(x1))))))) -> a(b(a(a(b(a(a(a(b(x1)))))))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..