Problem Maude 06 OvConsOS nosorts

LMPO

Execution Time (secs)
0.034
Answer
MAYBE
InputMaude 06 OvConsOS 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))
     , take(0(), IL) -> nil()
     , take(s(M), cons(N, IL)) -> cons(N, take(M, IL))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.063
Answer
MAYBE
InputMaude 06 OvConsOS 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))
     , take(0(), IL) -> nil()
     , take(s(M), cons(N, IL)) -> cons(N, take(M, IL))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.067
Answer
MAYBE
InputMaude 06 OvConsOS 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))
     , take(0(), IL) -> nil()
     , take(s(M), cons(N, IL)) -> cons(N, take(M, IL))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.038
Answer
MAYBE
InputMaude 06 OvConsOS 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))
     , take(0(), IL) -> nil()
     , take(s(M), cons(N, IL)) -> cons(N, take(M, IL))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.056
Answer
MAYBE
InputMaude 06 OvConsOS 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))
     , take(0(), IL) -> nil()
     , take(s(M), cons(N, IL)) -> cons(N, take(M, IL))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.042
Answer
MAYBE
InputMaude 06 OvConsOS 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))
     , take(0(), IL) -> nil()
     , take(s(M), cons(N, IL)) -> cons(N, take(M, IL))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..