Problem Zantema 08 from one

LMPO

Execution Time (secs)
0.027
Answer
MAYBE
InputZantema 08 from one
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(x) -> cons(x, from(s(x)))
     , cons(s(x), xs) -> nil()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.039
Answer
MAYBE
InputZantema 08 from one
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(x) -> cons(x, from(s(x)))
     , cons(s(x), xs) -> nil()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.024
Answer
MAYBE
InputZantema 08 from one
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(x) -> cons(x, from(s(x)))
     , cons(s(x), xs) -> nil()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.026
Answer
MAYBE
InputZantema 08 from one
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(x) -> cons(x, from(s(x)))
     , cons(s(x), xs) -> nil()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.025
Answer
MAYBE
InputZantema 08 from one
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(x) -> cons(x, from(s(x)))
     , cons(s(x), xs) -> nil()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.023
Answer
MAYBE
InputZantema 08 from one
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(x) -> cons(x, from(s(x)))
     , cons(s(x), xs) -> nil()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..