Problem Strategy outermost added 08 Ex1 GL02a Z

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex1 GL02a Z

stdout:

MAYBE

Problem:
eq(n__0(),n__0()) -> true()
eq(n__s(X),n__s(Y)) -> eq(activate(X),activate(Y))
eq(X,Y) -> false()
inf(X) -> cons(X,n__inf(s(X)))
take(0(),X) -> nil()
take(s(X),cons(Y,L)) -> cons(activate(Y),n__take(activate(X),activate(L)))
length(nil()) -> 0()
length(cons(X,L)) -> s(n__length(activate(L)))
0() -> n__0()
s(X) -> n__s(X)
inf(X) -> n__inf(X)
take(X1,X2) -> n__take(X1,X2)
length(X) -> n__length(X)
activate(n__0()) -> 0()
activate(n__s(X)) -> s(X)
activate(n__inf(X)) -> inf(X)
activate(n__take(X1,X2)) -> take(X1,X2)
activate(n__length(X)) -> length(X)
activate(X) -> X

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex1 GL02a Z

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex1 GL02a Z

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  eq(n__0(), n__0()) -> true()
     , eq(n__s(X), n__s(Y)) -> eq(activate(X), activate(Y))
     , eq(X, Y) -> false()
     , inf(X) -> cons(X, n__inf(s(X)))
     , take(0(), X) -> nil()
     , take(s(X), cons(Y, L)) ->
       cons(activate(Y), n__take(activate(X), activate(L)))
     , length(nil()) -> 0()
     , length(cons(X, L)) -> s(n__length(activate(L)))
     , 0() -> n__0()
     , s(X) -> n__s(X)
     , inf(X) -> n__inf(X)
     , take(X1, X2) -> n__take(X1, X2)
     , length(X) -> n__length(X)
     , activate(n__0()) -> 0()
     , activate(n__s(X)) -> s(X)
     , activate(n__inf(X)) -> inf(X)
     , activate(n__take(X1, X2)) -> take(X1, X2)
     , activate(n__length(X)) -> length(X)
     , 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 Ex1 GL02a Z

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex1 GL02a Z

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  eq(n__0(), n__0()) -> true()
     , eq(n__s(X), n__s(Y)) -> eq(activate(X), activate(Y))
     , eq(X, Y) -> false()
     , inf(X) -> cons(X, n__inf(s(X)))
     , take(0(), X) -> nil()
     , take(s(X), cons(Y, L)) ->
       cons(activate(Y), n__take(activate(X), activate(L)))
     , length(nil()) -> 0()
     , length(cons(X, L)) -> s(n__length(activate(L)))
     , 0() -> n__0()
     , s(X) -> n__s(X)
     , inf(X) -> n__inf(X)
     , take(X1, X2) -> n__take(X1, X2)
     , length(X) -> n__length(X)
     , activate(n__0()) -> 0()
     , activate(n__s(X)) -> s(X)
     , activate(n__inf(X)) -> inf(X)
     , activate(n__take(X1, X2)) -> take(X1, X2)
     , activate(n__length(X)) -> length(X)
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds