Problem CSR 04 Ex6 Luc98

Tool LMPO

Execution Time
0.034
Answer
MAYBE
InputCSR 04 Ex6 Luc98

stdout:

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

Tool MPO

Execution Time
0.045
Answer
MAYBE
InputCSR 04 Ex6 Luc98

stdout:

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

Tool POP*

Execution Time
0.027
Answer
MAYBE
InputCSR 04 Ex6 Luc98

stdout:

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

Tool POP* (PS)

Execution Time
0.029
Answer
MAYBE
InputCSR 04 Ex6 Luc98

stdout:

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

Tool Small POP*

Execution Time
0.026
Answer
MAYBE
InputCSR 04 Ex6 Luc98

stdout:

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

Tool Small POP* (PS)

Execution Time
0.041
Answer
MAYBE
InputCSR 04 Ex6 Luc98

stdout:

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