Problem Zantema 08 from one

Tool LMPO

Execution Time
0.027
Answer
MAYBE
InputZantema 08 from one

stdout:

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

Tool MPO

Execution Time
0.039
Answer
MAYBE
InputZantema 08 from one

stdout:

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

Tool POP*

Execution Time
0.024
Answer
MAYBE
InputZantema 08 from one

stdout:

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

Tool POP* (PS)

Execution Time
0.026
Answer
MAYBE
InputZantema 08 from one

stdout:

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

Tool Small POP*

Execution Time
0.025
Answer
MAYBE
InputZantema 08 from one

stdout:

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

Tool Small POP* (PS)

Execution Time
0.023
Answer
MAYBE
InputZantema 08 from one

stdout:

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