Problem CSR 04 ExIntrod GM04

Tool LMPO

Execution Time
0.034
Answer
MAYBE
InputCSR 04 ExIntrod GM04

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> adx(zeros())
     , zeros() -> cons(0(), zeros())
     , incr(cons(X, Y)) -> cons(s(X), incr(Y))
     , adx(cons(X, Y)) -> incr(cons(X, adx(Y)))
     , hd(cons(X, Y)) -> X
     , tl(cons(X, Y)) -> Y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.058
Answer
MAYBE
InputCSR 04 ExIntrod GM04

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> adx(zeros())
     , zeros() -> cons(0(), zeros())
     , incr(cons(X, Y)) -> cons(s(X), incr(Y))
     , adx(cons(X, Y)) -> incr(cons(X, adx(Y)))
     , hd(cons(X, Y)) -> X
     , tl(cons(X, Y)) -> Y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.048
Answer
MAYBE
InputCSR 04 ExIntrod GM04

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> adx(zeros())
     , zeros() -> cons(0(), zeros())
     , incr(cons(X, Y)) -> cons(s(X), incr(Y))
     , adx(cons(X, Y)) -> incr(cons(X, adx(Y)))
     , hd(cons(X, Y)) -> X
     , tl(cons(X, Y)) -> Y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.064
Answer
MAYBE
InputCSR 04 ExIntrod GM04

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> adx(zeros())
     , zeros() -> cons(0(), zeros())
     , incr(cons(X, Y)) -> cons(s(X), incr(Y))
     , adx(cons(X, Y)) -> incr(cons(X, adx(Y)))
     , hd(cons(X, Y)) -> X
     , tl(cons(X, Y)) -> Y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.043
Answer
MAYBE
InputCSR 04 ExIntrod GM04

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> adx(zeros())
     , zeros() -> cons(0(), zeros())
     , incr(cons(X, Y)) -> cons(s(X), incr(Y))
     , adx(cons(X, Y)) -> incr(cons(X, adx(Y)))
     , hd(cons(X, Y)) -> X
     , tl(cons(X, Y)) -> Y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.048
Answer
MAYBE
InputCSR 04 ExIntrod GM04

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> adx(zeros())
     , zeros() -> cons(0(), zeros())
     , incr(cons(X, Y)) -> cons(s(X), incr(Y))
     , adx(cons(X, Y)) -> incr(cons(X, adx(Y)))
     , hd(cons(X, Y)) -> X
     , tl(cons(X, Y)) -> Y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..