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)
, first(X1, X2) -> n__first(X1, X2)
, first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z)))
, first(0(), Z) -> nil()
, activate(X) -> X
, activate(n__from(X)) -> from(X)
, activate(n__first(X1, X2)) -> first(X1, X2)
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, sel(0(), cons(X, Z)) -> 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)))
, first(0(), Z) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z)))
, sel(0(), cons(X, Z)) -> X
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, from(X) -> n__from(X)
, first(X1, X2) -> n__first(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__first(X1, X2)) -> first(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)))
, first(0(), Z) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z)))
, sel(0(), cons(X, Z)) -> X
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, from(X) -> n__from(X)
, first(X1, X2) -> n__first(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__first(X1, X2)) -> first(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)))
, first(0(), Z) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z)))
, sel(0(), cons(X, Z)) -> X
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, from(X) -> n__from(X)
, first(X1, X2) -> n__first(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__first(X1, X2)) -> first(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)))
, first(0(), Z) -> nil()
, first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z)))
, sel(0(), cons(X, Z)) -> X
, sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
, from(X) -> n__from(X)
, first(X1, X2) -> n__first(X1, X2)
, activate(n__from(X)) -> from(X)
, activate(n__first(X1, X2)) -> first(X1, X2)
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..