Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{f(a(), f(x, a())) -> f(f(a(), f(f(a(), a()), x)), a())}
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:
{ a_0() -> 1
, a_1() -> 4
, a_1() -> 5
, a_1() -> 8
, a_1() -> 9
, f_0(1, 1) -> 2
, f_0(1, 2) -> 2
, f_0(2, 1) -> 2
, f_0(2, 2) -> 2
, f_1(3, 4) -> 2
, f_1(5, 6) -> 3
, f_1(7, 1) -> 6
, f_1(7, 2) -> 6
, f_1(7, 3) -> 6
, f_1(7, 7) -> 11
, f_1(8, 9) -> 7
, f_1(9, 11) -> 10
, f_1(10, 9) -> 3}
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:
{f(a(), f(x, a())) -> f(f(a(), f(f(a(), a()), x)), a())}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool IDA
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{f(a(), f(x, a())) -> f(f(a(), f(f(a(), a()), x)), a())}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
2) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
3) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
4) 'matrix-interpretation of dimension 2' failed due to the following reason:
The input cannot be shown compatible
5) 'matrix-interpretation of dimension 2' failed due to the following reason:
The input cannot be shown compatible
6) 'matrix-interpretation of dimension 1' failed due to the following reason:
The input cannot be shown compatible
Arrrr..Tool TRI
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{f(a(), f(x, a())) -> f(f(a(), f(f(a(), a()), x)), a())}
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:
{f(a(), f(x, a())) -> f(f(a(), f(f(a(), a()), x)), a())}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..