interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(X) -> cons(X, n__f(n__g(X)))
, f(X) -> n__f(X)
, g(X) -> n__g(X)
, g(0()) -> s(0())
, g(s(X)) -> s(s(g(X)))
, sel(0(), cons(X, Y)) -> X
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, activate(X) -> X
, activate(n__f(X)) -> f(activate(X))
, activate(n__g(X)) -> g(activate(X)) }
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:
{ f(X) -> cons(X, n__f(n__g(X)))
, g(0()) -> s(0())
, g(s(X)) -> s(s(g(X)))
, sel(0(), cons(X, Y)) -> X
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, f(X) -> n__f(X)
, g(X) -> n__g(X)
, activate(n__f(X)) -> f(activate(X))
, activate(n__g(X)) -> g(activate(X))
, 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(X) -> cons(X, n__f(n__g(X)))
, g(0()) -> s(0())
, g(s(X)) -> s(s(g(X)))
, sel(0(), cons(X, Y)) -> X
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, f(X) -> n__f(X)
, g(X) -> n__g(X)
, activate(n__f(X)) -> f(activate(X))
, activate(n__g(X)) -> g(activate(X))
, 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(X) -> cons(X, n__f(n__g(X)))
, g(0()) -> s(0())
, g(s(X)) -> s(s(g(X)))
, sel(0(), cons(X, Y)) -> X
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, f(X) -> n__f(X)
, g(X) -> n__g(X)
, activate(n__f(X)) -> f(activate(X))
, activate(n__g(X)) -> g(activate(X))
, 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(X) -> cons(X, n__f(n__g(X)))
, g(0()) -> s(0())
, g(s(X)) -> s(s(g(X)))
, sel(0(), cons(X, Y)) -> X
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, f(X) -> n__f(X)
, g(X) -> n__g(X)
, activate(n__f(X)) -> f(activate(X))
, activate(n__g(X)) -> g(activate(X))
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..