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