interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ natsFrom(N) -> cons(N, natsFrom(s(N)))
, fst(pair(XS, YS)) -> XS
, snd(pair(XS, YS)) -> YS
, splitAt(s(N), cons(X, XS)) -> u(splitAt(N, XS), N, X, XS)
, splitAt(0(), XS) -> pair(nil(), XS)
, u(pair(YS, ZS), N, X, XS) -> pair(cons(X, YS), ZS)
, head(cons(N, XS)) -> N
, tail(cons(N, XS)) -> XS
, sel(N, XS) -> head(afterNth(N, XS))
, afterNth(N, XS) -> snd(splitAt(N, XS))
, take(N, XS) -> fst(splitAt(N, XS)) }
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:
{ natsFrom(N) -> cons(N, natsFrom(s(N)))
, fst(pair(XS, YS)) -> XS
, snd(pair(XS, YS)) -> YS
, splitAt(0(), XS) -> pair(nil(), XS)
, splitAt(s(N), cons(X, XS)) -> u(splitAt(N, XS), N, X, XS)
, u(pair(YS, ZS), N, X, XS) -> pair(cons(X, YS), ZS)
, head(cons(N, XS)) -> N
, tail(cons(N, XS)) -> XS
, sel(N, XS) -> head(afterNth(N, XS))
, take(N, XS) -> fst(splitAt(N, XS))
, afterNth(N, XS) -> snd(splitAt(N, 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:
{ natsFrom(N) -> cons(N, natsFrom(s(N)))
, fst(pair(XS, YS)) -> XS
, snd(pair(XS, YS)) -> YS
, splitAt(0(), XS) -> pair(nil(), XS)
, splitAt(s(N), cons(X, XS)) -> u(splitAt(N, XS), N, X, XS)
, u(pair(YS, ZS), N, X, XS) -> pair(cons(X, YS), ZS)
, head(cons(N, XS)) -> N
, tail(cons(N, XS)) -> XS
, sel(N, XS) -> head(afterNth(N, XS))
, take(N, XS) -> fst(splitAt(N, XS))
, afterNth(N, XS) -> snd(splitAt(N, 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:
{ natsFrom(N) -> cons(N, natsFrom(s(N)))
, fst(pair(XS, YS)) -> XS
, snd(pair(XS, YS)) -> YS
, splitAt(0(), XS) -> pair(nil(), XS)
, splitAt(s(N), cons(X, XS)) -> u(splitAt(N, XS), N, X, XS)
, u(pair(YS, ZS), N, X, XS) -> pair(cons(X, YS), ZS)
, head(cons(N, XS)) -> N
, tail(cons(N, XS)) -> XS
, sel(N, XS) -> head(afterNth(N, XS))
, take(N, XS) -> fst(splitAt(N, XS))
, afterNth(N, XS) -> snd(splitAt(N, 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:
{ natsFrom(N) -> cons(N, natsFrom(s(N)))
, fst(pair(XS, YS)) -> XS
, snd(pair(XS, YS)) -> YS
, splitAt(0(), XS) -> pair(nil(), XS)
, splitAt(s(N), cons(X, XS)) -> u(splitAt(N, XS), N, X, XS)
, u(pair(YS, ZS), N, X, XS) -> pair(cons(X, YS), ZS)
, head(cons(N, XS)) -> N
, tail(cons(N, XS)) -> XS
, sel(N, XS) -> head(afterNth(N, XS))
, take(N, XS) -> fst(splitAt(N, XS))
, afterNth(N, XS) -> snd(splitAt(N, XS)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..