LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ first(0(), X) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
, from(X) -> cons(X, from(s(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:
{ first(0(), X) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
, from(X) -> cons(X, from(s(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:
{ first(0(), X) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
, from(X) -> cons(X, from(s(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:
{ first(0(), X) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
, from(X) -> cons(X, from(s(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:
{ first(0(), X) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
, from(X) -> cons(X, from(s(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:
{ first(0(), X) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
, from(X) -> cons(X, from(s(X)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..