Problem CSR 04 Ex1 Luc02b

LMPO

Execution Time (secs)
0.034
Answer
MAYBE
InputCSR 04 Ex1 Luc02b
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , first(0(), Z) -> nil()
     , first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
     , sel(0(), cons(X, Z)) -> 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..

MPO

Execution Time (secs)
0.048
Answer
MAYBE
InputCSR 04 Ex1 Luc02b
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , first(0(), Z) -> nil()
     , first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
     , sel(0(), cons(X, Z)) -> 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..

POP*

Execution Time (secs)
0.042
Answer
MAYBE
InputCSR 04 Ex1 Luc02b
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , first(0(), Z) -> nil()
     , first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
     , sel(0(), cons(X, Z)) -> 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..

POP* (PS)

Execution Time (secs)
0.047
Answer
MAYBE
InputCSR 04 Ex1 Luc02b
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , first(0(), Z) -> nil()
     , first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
     , sel(0(), cons(X, Z)) -> 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..

Small POP*

Execution Time (secs)
0.035
Answer
MAYBE
InputCSR 04 Ex1 Luc02b
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , first(0(), Z) -> nil()
     , first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
     , sel(0(), cons(X, Z)) -> 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..

Small POP* (PS)

Execution Time (secs)
0.048
Answer
MAYBE
InputCSR 04 Ex1 Luc02b
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , first(0(), Z) -> nil()
     , first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
     , sel(0(), cons(X, Z)) -> 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..