Problem Strategy outermost added 08 Ex6 Luc98

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..

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..

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..

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..

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..

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..