interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ eq(X, Y) -> false()
, eq(0(), 0()) -> true()
, eq(s(X), s(Y)) -> eq(X, Y)
, inf(X) -> cons(X, inf(s(X)))
, take(0(), X) -> nil()
, take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
, length(cons(X, L)) -> s(length(L))
, length(nil()) -> 0() }
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:
{ eq(0(), 0()) -> true()
, eq(s(X), s(Y)) -> eq(X, Y)
, eq(X, Y) -> false()
, inf(X) -> cons(X, inf(s(X)))
, take(0(), X) -> nil()
, take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
, length(nil()) -> 0()
, length(cons(X, L)) -> s(length(L)) }
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:
{ eq(0(), 0()) -> true()
, eq(s(X), s(Y)) -> eq(X, Y)
, eq(X, Y) -> false()
, inf(X) -> cons(X, inf(s(X)))
, take(0(), X) -> nil()
, take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
, length(nil()) -> 0()
, length(cons(X, L)) -> s(length(L)) }
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:
{ eq(0(), 0()) -> true()
, eq(s(X), s(Y)) -> eq(X, Y)
, eq(X, Y) -> false()
, inf(X) -> cons(X, inf(s(X)))
, take(0(), X) -> nil()
, take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
, length(nil()) -> 0()
, length(cons(X, L)) -> s(length(L)) }
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:
{ eq(0(), 0()) -> true()
, eq(s(X), s(Y)) -> eq(X, Y)
, eq(X, Y) -> false()
, inf(X) -> cons(X, inf(s(X)))
, take(0(), X) -> nil()
, take(s(X), cons(Y, L)) -> cons(Y, take(X, L))
, length(nil()) -> 0()
, length(cons(X, L)) -> s(length(L)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..