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