Problem Strategy outermost added 08 Ex3 12 Luc96a

MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , sel(0(), cons(X, Y)) -> X
     , sel(s(X), cons(Y, Z)) -> sel(X, Z)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..