Problem Strategy outermost added 08 Ex14 AEGL02

LMPO

Execution Time (secs)
0.027
Answer
MAYBE
InputStrategy outermost added 08 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.078
Answer
MAYBE
InputStrategy outermost added 08 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.038
Answer
MAYBE
InputStrategy outermost added 08 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.028
Answer
MAYBE
InputStrategy outermost added 08 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.023
Answer
MAYBE
InputStrategy outermost added 08 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.022
Answer
MAYBE
InputStrategy outermost added 08 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..