Problem CSR 04 Ex6 Luc98

LMPO

Execution Time (secs)
0.034
Answer
MAYBE
InputCSR 04 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..

MPO

Execution Time (secs)
0.045
Answer
MAYBE
InputCSR 04 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..

POP*

Execution Time (secs)
0.027
Answer
MAYBE
InputCSR 04 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..

POP* (PS)

Execution Time (secs)
0.029
Answer
MAYBE
InputCSR 04 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..

Small POP*

Execution Time (secs)
0.026
Answer
MAYBE
InputCSR 04 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..

Small POP* (PS)

Execution Time (secs)
0.041
Answer
MAYBE
InputCSR 04 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..