LMPO

Execution Time (secs)	0.033
Answer	MAYBE
Input	CSR 04 Ex1 Luc04b

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> cons(0(), incr(nats()))
     , pairs() -> cons(0(), incr(odds()))
     , odds() -> incr(pairs())
     , incr(cons(X, XS)) -> cons(s(X), incr(XS))
     , head(cons(X, XS)) -> X
     , tail(cons(X, XS)) -> XS}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)	0.058
Answer	MAYBE
Input	CSR 04 Ex1 Luc04b

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> cons(0(), incr(nats()))
     , pairs() -> cons(0(), incr(odds()))
     , odds() -> incr(pairs())
     , incr(cons(X, XS)) -> cons(s(X), incr(XS))
     , head(cons(X, XS)) -> X
     , tail(cons(X, XS)) -> XS}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)	0.039
Answer	MAYBE
Input	CSR 04 Ex1 Luc04b

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> cons(0(), incr(nats()))
     , pairs() -> cons(0(), incr(odds()))
     , odds() -> incr(pairs())
     , incr(cons(X, XS)) -> cons(s(X), incr(XS))
     , head(cons(X, XS)) -> X
     , tail(cons(X, XS)) -> XS}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)	0.035
Answer	MAYBE
Input	CSR 04 Ex1 Luc04b

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> cons(0(), incr(nats()))
     , pairs() -> cons(0(), incr(odds()))
     , odds() -> incr(pairs())
     , incr(cons(X, XS)) -> cons(s(X), incr(XS))
     , head(cons(X, XS)) -> X
     , tail(cons(X, XS)) -> XS}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)	0.042
Answer	MAYBE
Input	CSR 04 Ex1 Luc04b

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> cons(0(), incr(nats()))
     , pairs() -> cons(0(), incr(odds()))
     , odds() -> incr(pairs())
     , incr(cons(X, XS)) -> cons(s(X), incr(XS))
     , head(cons(X, XS)) -> X
     , tail(cons(X, XS)) -> XS}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)	0.034
Answer	MAYBE
Input	CSR 04 Ex1 Luc04b

MAYBE

We consider the following Problem:

  Strict Trs:
    {  nats() -> cons(0(), incr(nats()))
     , pairs() -> cons(0(), incr(odds()))
     , odds() -> incr(pairs())
     , incr(cons(X, XS)) -> cons(s(X), incr(XS))
     , head(cons(X, XS)) -> X
     , tail(cons(X, XS)) -> XS}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Problem CSR 04 Ex1 Luc04b

LMPO

MPO

POP*

POP* (PS)

Small POP*

Small POP* (PS)