Problem Strategy outermost added 08 Ex5 DLMMU04 FR

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex5 DLMMU04 FR

stdout:

MAYBE

Problem:
pairNs() -> cons(0(),n__incr(n__oddNs()))
oddNs() -> incr(pairNs())
incr(cons(X,XS)) -> cons(s(X),n__incr(activate(XS)))
take(0(),XS) -> nil()
take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS)))
zip(nil(),XS) -> nil()
zip(X,nil()) -> nil()
zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),n__zip(activate(XS),activate(YS)))
tail(cons(X,XS)) -> activate(XS)
repItems(nil()) -> nil()
repItems(cons(X,XS)) -> cons(X,n__cons(X,n__repItems(activate(XS))))
incr(X) -> n__incr(X)
oddNs() -> n__oddNs()
take(X1,X2) -> n__take(X1,X2)
zip(X1,X2) -> n__zip(X1,X2)
cons(X1,X2) -> n__cons(X1,X2)
repItems(X) -> n__repItems(X)
activate(n__incr(X)) -> incr(activate(X))
activate(n__oddNs()) -> oddNs()
activate(n__take(X1,X2)) -> take(activate(X1),activate(X2))
activate(n__zip(X1,X2)) -> zip(activate(X1),activate(X2))
activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
activate(n__repItems(X)) -> repItems(activate(X))
activate(X) -> X

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex5 DLMMU04 FR

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex5 DLMMU04 FR

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  pairNs() -> cons(0(), n__incr(n__oddNs()))
     , oddNs() -> incr(pairNs())
     , incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS)))
     , take(0(), XS) -> nil()
     , take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
     , zip(nil(), XS) -> nil()
     , zip(X, nil()) -> nil()
     , zip(cons(X, XS), cons(Y, YS)) ->
       cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
     , tail(cons(X, XS)) -> activate(XS)
     , repItems(nil()) -> nil()
     , repItems(cons(X, XS)) ->
       cons(X, n__cons(X, n__repItems(activate(XS))))
     , incr(X) -> n__incr(X)
     , oddNs() -> n__oddNs()
     , take(X1, X2) -> n__take(X1, X2)
     , zip(X1, X2) -> n__zip(X1, X2)
     , cons(X1, X2) -> n__cons(X1, X2)
     , repItems(X) -> n__repItems(X)
     , activate(n__incr(X)) -> incr(activate(X))
     , activate(n__oddNs()) -> oddNs()
     , activate(n__take(X1, X2)) -> take(activate(X1), activate(X2))
     , activate(n__zip(X1, X2)) -> zip(activate(X1), activate(X2))
     , activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
     , activate(n__repItems(X)) -> repItems(activate(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 Ex5 DLMMU04 FR

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex5 DLMMU04 FR

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  pairNs() -> cons(0(), n__incr(n__oddNs()))
     , oddNs() -> incr(pairNs())
     , incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS)))
     , take(0(), XS) -> nil()
     , take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
     , zip(nil(), XS) -> nil()
     , zip(X, nil()) -> nil()
     , zip(cons(X, XS), cons(Y, YS)) ->
       cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
     , tail(cons(X, XS)) -> activate(XS)
     , repItems(nil()) -> nil()
     , repItems(cons(X, XS)) ->
       cons(X, n__cons(X, n__repItems(activate(XS))))
     , incr(X) -> n__incr(X)
     , oddNs() -> n__oddNs()
     , take(X1, X2) -> n__take(X1, X2)
     , zip(X1, X2) -> n__zip(X1, X2)
     , cons(X1, X2) -> n__cons(X1, X2)
     , repItems(X) -> n__repItems(X)
     , activate(n__incr(X)) -> incr(activate(X))
     , activate(n__oddNs()) -> oddNs()
     , activate(n__take(X1, X2)) -> take(activate(X1), activate(X2))
     , activate(n__zip(X1, X2)) -> zip(activate(X1), activate(X2))
     , activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
     , activate(n__repItems(X)) -> repItems(activate(X))
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds