Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{f(f(x, a()), a()) -> f(f(f(a(), a()), f(x, a())), a())}
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:
{ a_0() -> 1
, a_1() -> 4
, a_1() -> 7
, a_1() -> 8
, a_1() -> 9
, a_2() -> 11
, a_2() -> 14
, a_2() -> 15
, a_2() -> 16
, f_0(1, 1) -> 2
, f_0(1, 2) -> 2
, f_0(2, 1) -> 2
, f_0(2, 2) -> 2
, f_1(1, 9) -> 6
, f_1(2, 9) -> 6
, f_1(3, 4) -> 2
, f_1(3, 9) -> 6
, f_1(5, 6) -> 3
, f_1(7, 8) -> 5
, f_2(3, 16) -> 13
, f_2(10, 11) -> 6
, f_2(12, 13) -> 10
, f_2(14, 15) -> 12}
Hurray, we answered YES(?,O(n^1))Tool CDI
stdout:
TIMEOUT
Statistics:
Number of monomials: 1600
Last formula building started for bound 3
Last SAT solving started for bound 3Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{f(f(x, a()), a()) -> f(f(f(a(), a()), f(x, a())), a())}
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:
{f(f(x, a()), a()) -> f(f(f(a(), a()), f(x, a())), a())}
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:
{f(f(x, a()), a()) -> f(f(f(a(), a()), f(x, a())), 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(f(x, a()), a()) -> f(f(f(a(), a()), f(x, a())), a())}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..