Problem Zantema 08 from three

LMPO

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

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.035
Answer
MAYBE
InputZantema 08 from three
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.031
Answer
MAYBE
InputZantema 08 from three
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(x) -> cons(x, from(s(x)))
     , cons(s(s(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.032
Answer
MAYBE
InputZantema 08 from three
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(x) -> cons(x, from(s(x)))
     , cons(s(s(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.041
Answer
MAYBE
InputZantema 08 from three
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(x) -> cons(x, from(s(x)))
     , cons(s(s(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.032
Answer
MAYBE
InputZantema 08 from three
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..