interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ from(X) -> cons(X, n__from(s(X)))
, from(X) -> n__from(X)
, head(cons(X, XS)) -> X
, 2nd(cons(X, XS)) -> head(activate(XS))
, activate(X) -> X
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, take(X1, X2) -> n__take(X1, X2)
, take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS)))
, take(0(), XS) -> nil()
, sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
, sel(0(), cons(X, XS)) -> X }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ from(X) -> cons(X, n__from(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)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ from(X) -> cons(X, n__from(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)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ from(X) -> cons(X, n__from(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)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ from(X) -> cons(X, n__from(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)
, take(X1, X2) -> n__take(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__take(X1, X2)) -> take(X1, X2)
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..