Problem Maude 06 LengthOfFiniteLists nosorts-noand

LMPO

Execution Time (secs)
0.034
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts-noand
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

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

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.033
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts-noand
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.046
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts-noand
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.070
Answer
MAYBE
InputMaude 06 LengthOfFiniteLists nosorts-noand
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

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

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..