interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(n__a(), X, X) -> f(activate(X), b(), n__b())
, activate(X) -> X
, activate(n__a()) -> a()
, activate(n__b()) -> b()
, b() -> n__b()
, b() -> a()
, a() -> n__a() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
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) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
3) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
4) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(n__a(), X, X) -> f(activate(X), b(), n__b())
, b() -> a()
, a() -> n__a()
, b() -> n__b()
, activate(n__a()) -> a()
, activate(n__b()) -> b()
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(n__a(), X, X) -> f(activate(X), b(), n__b())
, b() -> a()
, a() -> n__a()
, b() -> n__b()
, activate(n__a()) -> a()
, activate(n__b()) -> b()
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(n__a(), X, X) -> f(activate(X), b(), n__b())
, b() -> a()
, a() -> n__a()
, b() -> n__b()
, activate(n__a()) -> a()
, activate(n__b()) -> b()
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(n__a(), X, X) -> f(activate(X), b(), n__b())
, b() -> a()
, a() -> n__a()
, b() -> n__b()
, activate(n__a()) -> a()
, activate(n__b()) -> b()
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..