Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs: {b(a(b(b(b(b(x1)))))) -> a(b(b(b(b(b(a(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:
{ b_0(1) -> 1
, b_1(3) -> 2
, b_1(4) -> 3
, b_1(5) -> 4
, b_1(6) -> 5
, b_1(7) -> 6
, b_2(9) -> 8
, b_2(10) -> 9
, b_2(11) -> 10
, b_2(12) -> 11
, b_2(13) -> 12
, b_2(15) -> 14
, b_2(16) -> 15
, b_2(17) -> 16
, b_2(18) -> 17
, b_2(19) -> 18
, b_2(21) -> 20
, b_2(22) -> 21
, b_2(23) -> 22
, b_2(24) -> 23
, b_2(25) -> 24
, b_2(27) -> 26
, b_2(28) -> 27
, b_2(29) -> 28
, b_2(30) -> 29
, b_2(31) -> 30
, a_0(1) -> 1
, a_1(1) -> 7
, a_1(2) -> 1
, a_1(2) -> 6
, a_1(6) -> 7
, a_2(6) -> 13
, a_2(8) -> 5
, a_2(12) -> 19
, a_2(14) -> 4
, a_2(18) -> 25
, a_2(20) -> 3
, a_2(24) -> 31
, a_2(26) -> 2}
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(b(b(b(b(x1)))))) -> a(b(b(b(b(b(a(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(b(b(b(b(x1)))))) -> a(b(b(b(b(b(a(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(b(b(b(b(x1)))))) -> a(b(b(b(b(b(a(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(b(b(b(b(x1)))))) -> a(b(b(b(b(b(a(x1)))))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..