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