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