Problem Transformed CSR 04 Ex7 BLR02 FR

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Transformed CSR 04 Ex7 BLR02 FR

stdout:

MAYBE

Problem:
from(X) -> cons(X,n__from(n__s(X)))
head(cons(X,XS)) -> X
2nd(cons(X,XS)) -> head(activate(XS))
take(0(),XS) -> nil()
take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS)))
sel(0(),cons(X,XS)) -> X
sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
from(X) -> n__from(X)
s(X) -> n__s(X)
take(X1,X2) -> n__take(X1,X2)
activate(n__from(X)) -> from(activate(X))
activate(n__s(X)) -> s(activate(X))
activate(n__take(X1,X2)) -> take(activate(X1),activate(X2))
activate(X) -> X

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Transformed CSR 04 Ex7 BLR02 FR

stdout:

MAYBE

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Transformed CSR 04 Ex7 BLR02 FR

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  from(X) -> cons(X, n__from(n__s(X)))
     , head(cons(X, XS)) -> X
     , 2nd(cons(X, XS)) -> head(activate(XS))
     , take(0(), XS) -> nil()
     , take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
     , sel(0(), cons(X, XS)) -> X
     , sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
     , from(X) -> n__from(X)
     , s(X) -> n__s(X)
     , take(X1, X2) -> n__take(X1, X2)
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X))
     , activate(n__take(X1, X2)) -> take(activate(X1), activate(X2))
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Transformed CSR 04 Ex7 BLR02 FR

stdout:

MAYBE

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Transformed CSR 04 Ex7 BLR02 FR

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  from(X) -> cons(X, n__from(n__s(X)))
     , head(cons(X, XS)) -> X
     , 2nd(cons(X, XS)) -> head(activate(XS))
     , take(0(), XS) -> nil()
     , take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
     , sel(0(), cons(X, XS)) -> X
     , sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
     , from(X) -> n__from(X)
     , s(X) -> n__s(X)
     , take(X1, X2) -> n__take(X1, X2)
     , activate(n__from(X)) -> from(activate(X))
     , activate(n__s(X)) -> s(activate(X))
     , activate(n__take(X1, X2)) -> take(activate(X1), activate(X2))
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds