LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ from(X) -> cons(X, n__from(s(X)))
, head(cons(X, XS)) -> X
, 2nd(cons(X, XS)) -> head(activate(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, from(X) -> n__from(X)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ from(X) -> cons(X, n__from(s(X)))
, head(cons(X, XS)) -> X
, 2nd(cons(X, XS)) -> head(activate(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, from(X) -> n__from(X)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ from(X) -> cons(X, n__from(s(X)))
, head(cons(X, XS)) -> X
, 2nd(cons(X, XS)) -> head(activate(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, from(X) -> n__from(X)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X}
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:
{ from(X) -> cons(X, n__from(s(X)))
, head(cons(X, XS)) -> X
, 2nd(cons(X, XS)) -> head(activate(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, from(X) -> n__from(X)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X}
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:
{ from(X) -> cons(X, n__from(s(X)))
, head(cons(X, XS)) -> X
, 2nd(cons(X, XS)) -> head(activate(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, from(X) -> n__from(X)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X}
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:
{ from(X) -> cons(X, n__from(s(X)))
, head(cons(X, XS)) -> X
, 2nd(cons(X, XS)) -> head(activate(XS))
, take(0(), XS) -> nil()
, take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, from(X) -> n__from(X)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..