interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ g(X) -> h(activate(X))
, h(n__d()) -> g(n__c())
, activate(X) -> X
, activate(n__d()) -> d()
, activate(n__c()) -> c()
, c() -> d()
, c() -> n__c()
, d() -> n__d() }
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) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
4) 'matrix interpretation of dimension 1' 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:
{ g(X) -> h(activate(X))
, c() -> d()
, h(n__d()) -> g(n__c())
, d() -> n__d()
, c() -> n__c()
, activate(n__d()) -> d()
, activate(n__c()) -> c()
, 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:
{ g(X) -> h(activate(X))
, c() -> d()
, h(n__d()) -> g(n__c())
, d() -> n__d()
, c() -> n__c()
, activate(n__d()) -> d()
, activate(n__c()) -> c()
, 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:
{ g(X) -> h(activate(X))
, c() -> d()
, h(n__d()) -> g(n__c())
, d() -> n__d()
, c() -> n__c()
, activate(n__d()) -> d()
, activate(n__c()) -> c()
, 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:
{ g(X) -> h(activate(X))
, c() -> d()
, h(n__d()) -> g(n__c())
, d() -> n__d()
, c() -> n__c()
, activate(n__d()) -> d()
, activate(n__c()) -> c()
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..