Problem CSR 04 Ex14 AEGL02

LMPO

Execution Time (secs)
0.029
Answer
MAYBE
InputCSR 04 Ex14 AEGL02
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , length(nil()) -> 0()
     , length(cons(X, Y)) -> s(length1(Y))
     , length1(X) -> length(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.028
Answer
MAYBE
InputCSR 04 Ex14 AEGL02
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , length(nil()) -> 0()
     , length(cons(X, Y)) -> s(length1(Y))
     , length1(X) -> length(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.027
Answer
MAYBE
InputCSR 04 Ex14 AEGL02
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , length(nil()) -> 0()
     , length(cons(X, Y)) -> s(length1(Y))
     , length1(X) -> length(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.026
Answer
MAYBE
InputCSR 04 Ex14 AEGL02
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , length(nil()) -> 0()
     , length(cons(X, Y)) -> s(length1(Y))
     , length1(X) -> length(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.029
Answer
MAYBE
InputCSR 04 Ex14 AEGL02
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , length(nil()) -> 0()
     , length(cons(X, Y)) -> s(length1(Y))
     , length1(X) -> length(X)}
  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
InputCSR 04 Ex14 AEGL02
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X, from(s(X)))
     , length(nil()) -> 0()
     , length(cons(X, Y)) -> s(length1(Y))
     , length1(X) -> length(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..