Problem Strategy outermost added 08 Ex4 7 56 Bor03

MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , after(0(), XS) -> XS
     , after(s(N), cons(X, XS)) -> after(N, XS)}
  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)))
     , after(0(), XS) -> XS
     , after(s(N), cons(X, XS)) -> after(N, XS)}
  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)))
     , after(0(), XS) -> XS
     , after(s(N), cons(X, XS)) -> after(N, XS)}
  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)))
     , after(0(), XS) -> XS
     , after(s(N), cons(X, XS)) -> after(N, XS)}
  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)))
     , after(0(), XS) -> XS
     , after(s(N), cons(X, XS)) -> after(N, XS)}
  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)))
     , after(0(), XS) -> XS
     , after(s(N), cons(X, XS)) -> after(N, XS)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..