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