Problem Maude 06 LengthOfFiniteLists nosorts

LMPO

Execution Time (secs)
0.039
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts
MAYBE

We consider the following Problem:

  Strict Trs:
    {  zeros() -> cons(0(), zeros())
     , and(tt(), X) -> X
     , length(nil()) -> 0()
     , length(cons(N, L)) -> s(length(L))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.042
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts
MAYBE

We consider the following Problem:

  Strict Trs:
    {  zeros() -> cons(0(), zeros())
     , and(tt(), X) -> X
     , length(nil()) -> 0()
     , length(cons(N, L)) -> s(length(L))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.035
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts
MAYBE

We consider the following Problem:

  Strict Trs:
    {  zeros() -> cons(0(), zeros())
     , and(tt(), X) -> X
     , length(nil()) -> 0()
     , length(cons(N, L)) -> s(length(L))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.020
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts
MAYBE

We consider the following Problem:

  Strict Trs:
    {  zeros() -> cons(0(), zeros())
     , and(tt(), X) -> X
     , length(nil()) -> 0()
     , length(cons(N, L)) -> s(length(L))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.021
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts
MAYBE

We consider the following Problem:

  Strict Trs:
    {  zeros() -> cons(0(), zeros())
     , and(tt(), X) -> X
     , length(nil()) -> 0()
     , length(cons(N, L)) -> s(length(L))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.024
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts
MAYBE

We consider the following Problem:

  Strict Trs:
    {  zeros() -> cons(0(), zeros())
     , and(tt(), X) -> X
     , length(nil()) -> 0()
     , length(cons(N, L)) -> s(length(L))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..