LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ zeros() -> cons(0(), n__zeros())
, and(tt(), X) -> activate(X)
, length(nil()) -> 0()
, length(cons(N, L)) -> s(length(activate(L)))
, take(0(), IL) -> nil()
, take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
, zeros() -> n__zeros()
, take(X1, X2) -> n__take(X1, X2)
, activate(n__zeros()) -> zeros()
, activate(n__take(X1, X2)) -> take(activate(X1), activate(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:
{ zeros() -> cons(0(), n__zeros())
, and(tt(), X) -> activate(X)
, length(nil()) -> 0()
, length(cons(N, L)) -> s(length(activate(L)))
, take(0(), IL) -> nil()
, take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
, zeros() -> n__zeros()
, take(X1, X2) -> n__take(X1, X2)
, activate(n__zeros()) -> zeros()
, activate(n__take(X1, X2)) -> take(activate(X1), activate(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:
{ zeros() -> cons(0(), n__zeros())
, and(tt(), X) -> activate(X)
, length(nil()) -> 0()
, length(cons(N, L)) -> s(length(activate(L)))
, take(0(), IL) -> nil()
, take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
, zeros() -> n__zeros()
, take(X1, X2) -> n__take(X1, X2)
, activate(n__zeros()) -> zeros()
, activate(n__take(X1, X2)) -> take(activate(X1), activate(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:
{ zeros() -> cons(0(), n__zeros())
, and(tt(), X) -> activate(X)
, length(nil()) -> 0()
, length(cons(N, L)) -> s(length(activate(L)))
, take(0(), IL) -> nil()
, take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
, zeros() -> n__zeros()
, take(X1, X2) -> n__take(X1, X2)
, activate(n__zeros()) -> zeros()
, activate(n__take(X1, X2)) -> take(activate(X1), activate(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:
{ zeros() -> cons(0(), n__zeros())
, and(tt(), X) -> activate(X)
, length(nil()) -> 0()
, length(cons(N, L)) -> s(length(activate(L)))
, take(0(), IL) -> nil()
, take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
, zeros() -> n__zeros()
, take(X1, X2) -> n__take(X1, X2)
, activate(n__zeros()) -> zeros()
, activate(n__take(X1, X2)) -> take(activate(X1), activate(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:
{ zeros() -> cons(0(), n__zeros())
, and(tt(), X) -> activate(X)
, length(nil()) -> 0()
, length(cons(N, L)) -> s(length(activate(L)))
, take(0(), IL) -> nil()
, take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
, zeros() -> n__zeros()
, take(X1, X2) -> n__take(X1, X2)
, activate(n__zeros()) -> zeros()
, activate(n__take(X1, X2)) -> take(activate(X1), activate(X2))
, activate(X) -> X}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..