interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ pairNs() -> cons(0(), incr(oddNs()))
, incr(cons(X, XS)) -> cons(s(X), incr(XS))
, oddNs() -> incr(pairNs())
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, take(N, XS))
, zip(X, nil()) -> nil()
, zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS))
, zip(nil(), XS) -> nil()
, tail(cons(X, XS)) -> XS
, repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS)))
, repItems(nil()) -> nil() }
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:
{ pairNs() -> cons(0(), incr(oddNs()))
, oddNs() -> incr(pairNs())
, incr(cons(X, XS)) -> cons(s(X), incr(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, take(N, XS))
, zip(nil(), XS) -> nil()
, zip(X, nil()) -> nil()
, zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS))
, tail(cons(X, XS)) -> XS
, repItems(nil()) -> nil()
, repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) }
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:
{ pairNs() -> cons(0(), incr(oddNs()))
, oddNs() -> incr(pairNs())
, incr(cons(X, XS)) -> cons(s(X), incr(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, take(N, XS))
, zip(nil(), XS) -> nil()
, zip(X, nil()) -> nil()
, zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS))
, tail(cons(X, XS)) -> XS
, repItems(nil()) -> nil()
, repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) }
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:
{ pairNs() -> cons(0(), incr(oddNs()))
, oddNs() -> incr(pairNs())
, incr(cons(X, XS)) -> cons(s(X), incr(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, take(N, XS))
, zip(nil(), XS) -> nil()
, zip(X, nil()) -> nil()
, zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS))
, tail(cons(X, XS)) -> XS
, repItems(nil()) -> nil()
, repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) }
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:
{ pairNs() -> cons(0(), incr(oddNs()))
, oddNs() -> incr(pairNs())
, incr(cons(X, XS)) -> cons(s(X), incr(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, take(N, XS))
, zip(nil(), XS) -> nil()
, zip(X, nil()) -> nil()
, zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS))
, tail(cons(X, XS)) -> XS
, repItems(nil()) -> nil()
, repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..