Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{b(a(a(b(a(b(a(x1))))))) -> a(a(b(a(b(b(a(a(b(x1)))))))))}
StartTerms: all
Strategy: none
Certificate: YES(?,O(n^1))
Proof:
The problem is match-bounded by 4.
The enriched problem is compatible with the following automaton:
{ a_0(1) -> 1
, a_1(2) -> 1
, a_1(2) -> 6
, a_1(2) -> 9
, a_1(3) -> 2
, a_1(5) -> 4
, a_1(8) -> 7
, a_1(9) -> 8
, a_2(10) -> 5
, a_2(10) -> 9
, a_2(11) -> 10
, a_2(13) -> 12
, a_2(16) -> 15
, a_2(17) -> 16
, a_2(18) -> 6
, a_2(18) -> 14
, a_2(19) -> 18
, a_2(21) -> 20
, a_2(24) -> 23
, a_2(25) -> 24
, a_3(26) -> 25
, a_3(27) -> 26
, a_3(29) -> 28
, a_3(32) -> 31
, a_3(33) -> 32
, a_3(34) -> 14
, a_3(34) -> 30
, a_3(35) -> 34
, a_3(37) -> 36
, a_3(40) -> 39
, a_3(41) -> 40
, a_4(42) -> 30
, a_4(43) -> 42
, a_4(45) -> 44
, a_4(48) -> 47
, a_4(49) -> 48
, b_0(1) -> 1
, b_1(1) -> 9
, b_1(2) -> 9
, b_1(4) -> 3
, b_1(6) -> 5
, b_1(7) -> 6
, b_1(18) -> 9
, b_2(2) -> 17
, b_2(5) -> 25
, b_2(12) -> 11
, b_2(14) -> 13
, b_2(15) -> 14
, b_2(18) -> 17
, b_2(20) -> 19
, b_2(21) -> 25
, b_2(22) -> 21
, b_2(23) -> 22
, b_3(18) -> 33
, b_3(21) -> 41
, b_3(28) -> 27
, b_3(30) -> 29
, b_3(31) -> 30
, b_3(34) -> 33
, b_3(36) -> 35
, b_3(38) -> 37
, b_3(39) -> 38
, b_4(37) -> 49
, b_4(44) -> 43
, b_4(46) -> 45
, b_4(47) -> 46}
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:
{b(a(a(b(a(b(a(x1))))))) -> a(a(b(a(b(b(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:
{b(a(a(b(a(b(a(x1))))))) -> a(a(b(a(b(b(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:
{b(a(a(b(a(b(a(x1))))))) -> a(a(b(a(b(b(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:
{b(a(a(b(a(b(a(x1))))))) -> a(a(b(a(b(b(a(a(b(x1)))))))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..