Problem Strategy outermost added 08 OvConsOS nosorts Z

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 OvConsOS nosorts Z

stdout:

MAYBE

Problem:
zeros() -> cons(0(),n__zeros())
and(tt(),X) -> activate(X)
length(nil()) -> 0()
length(cons(N,L)) -> s(length(activate(L)))
take(0(),IL) -> nil()
take(s(M),cons(N,IL)) -> cons(N,n__take(M,activate(IL)))
zeros() -> n__zeros()
take(X1,X2) -> n__take(X1,X2)
activate(n__zeros()) -> zeros()
activate(n__take(X1,X2)) -> take(X1,X2)
activate(X) -> X

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 OvConsOS nosorts Z

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 OvConsOS nosorts Z

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  zeros() -> cons(0(), n__zeros())
     , and(tt(), X) -> activate(X)
     , length(nil()) -> 0()
     , length(cons(N, L)) -> s(length(activate(L)))
     , take(0(), IL) -> nil()
     , take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
     , zeros() -> n__zeros()
     , take(X1, X2) -> n__take(X1, X2)
     , activate(n__zeros()) -> zeros()
     , activate(n__take(X1, X2)) -> take(X1, X2)
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 OvConsOS nosorts Z

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 OvConsOS nosorts Z

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  zeros() -> cons(0(), n__zeros())
     , and(tt(), X) -> activate(X)
     , length(nil()) -> 0()
     , length(cons(N, L)) -> s(length(activate(L)))
     , take(0(), IL) -> nil()
     , take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
     , zeros() -> n__zeros()
     , take(X1, X2) -> n__take(X1, X2)
     , activate(n__zeros()) -> zeros()
     , activate(n__take(X1, X2)) -> take(X1, X2)
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds