Tool CaT
stdout:
MAYBE
Problem:
nthtail(n,l) -> cond(ge(n,length(l)),n,l)
cond(true(),n,l) -> l
cond(false(),n,l) -> tail(nthtail(s(n),l))
tail(nil()) -> nil()
tail(cons(x,l)) -> l
length(nil()) -> 0()
length(cons(x,l)) -> s(length(l))
ge(u,0()) -> true()
ge(0(),s(v)) -> false()
ge(s(u),s(v)) -> ge(u,v)
Proof:
OpenTool IRC1
stdout:
MAYBE
Tool IRC2
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: innermost runtime-complexity with respect to
Rules:
{ nthtail(n, l) -> cond(ge(n, length(l)), n, l)
, cond(true(), n, l) -> l
, cond(false(), n, l) -> tail(nthtail(s(n), l))
, tail(nil()) -> nil()
, tail(cons(x, l)) -> l
, length(nil()) -> 0()
, length(cons(x, l)) -> s(length(l))
, ge(u, 0()) -> true()
, ge(0(), s(v)) -> false()
, ge(s(u), s(v)) -> ge(u, v)}
Proof Output:
Computation stopped due to timeout after 60.0 secondsTool RC1
stdout:
MAYBE
Tool RC2
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: runtime-complexity with respect to
Rules:
{ nthtail(n, l) -> cond(ge(n, length(l)), n, l)
, cond(true(), n, l) -> l
, cond(false(), n, l) -> tail(nthtail(s(n), l))
, tail(nil()) -> nil()
, tail(cons(x, l)) -> l
, length(nil()) -> 0()
, length(cons(x, l)) -> s(length(l))
, ge(u, 0()) -> true()
, ge(0(), s(v)) -> false()
, ge(s(u), s(v)) -> ge(u, v)}
Proof Output:
Computation stopped due to timeout after 60.0 seconds