LMPO
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..