Problem Strategy outermost added 08 Ex6 9 Luc02c

MAYBE

We consider the following Problem:

  Strict Trs:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, X1))
     , 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:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, X1))
     , 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:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, X1))
     , 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:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, X1))
     , 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:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, X1))
     , 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:
    {  2nd(cons1(X, cons(Y, Z))) -> Y
     , 2nd(cons(X, X1)) -> 2nd(cons1(X, X1))
     , from(X) -> cons(X, from(s(X)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..