interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ a__terms(N) -> cons(recip(a__sqr(mark(N))), terms(s(N)))
, a__terms(X) -> terms(X)
, a__sqr(X) -> sqr(X)
, a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
, a__sqr(0()) -> 0()
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(recip(X)) -> recip(mark(X))
, mark(terms(X)) -> a__terms(mark(X))
, mark(s(X)) -> s(mark(X))
, mark(0()) -> 0()
, mark(nil()) -> nil()
, mark(first(X1, X2)) -> a__first(mark(X1), mark(X2))
, mark(sqr(X)) -> a__sqr(mark(X))
, mark(add(X1, X2)) -> a__add(mark(X1), mark(X2))
, mark(dbl(X)) -> a__dbl(mark(X))
, a__add(X1, X2) -> add(X1, X2)
, a__add(s(X), Y) -> s(a__add(mark(X), mark(Y)))
, a__add(0(), X) -> mark(X)
, a__dbl(X) -> dbl(X)
, a__dbl(s(X)) -> s(s(a__dbl(mark(X))))
, a__dbl(0()) -> 0()
, a__first(X1, X2) -> first(X1, X2)
, a__first(s(X), cons(Y, Z)) -> cons(mark(Y), first(X, Z))
, a__first(0(), X) -> nil() }
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:
{ a__terms(N) -> cons(recip(a__sqr(mark(N))), terms(s(N)))
, a__sqr(0()) -> 0()
, a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
, a__dbl(0()) -> 0()
, a__dbl(s(X)) -> s(s(a__dbl(mark(X))))
, a__add(0(), X) -> mark(X)
, a__add(s(X), Y) -> s(a__add(mark(X), mark(Y)))
, a__first(0(), X) -> nil()
, a__first(s(X), cons(Y, Z)) -> cons(mark(Y), first(X, Z))
, mark(terms(X)) -> a__terms(mark(X))
, mark(sqr(X)) -> a__sqr(mark(X))
, mark(add(X1, X2)) -> a__add(mark(X1), mark(X2))
, mark(dbl(X)) -> a__dbl(mark(X))
, mark(first(X1, X2)) -> a__first(mark(X1), mark(X2))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(recip(X)) -> recip(mark(X))
, mark(s(X)) -> s(mark(X))
, mark(0()) -> 0()
, mark(nil()) -> nil()
, a__terms(X) -> terms(X)
, a__sqr(X) -> sqr(X)
, a__add(X1, X2) -> add(X1, X2)
, a__dbl(X) -> dbl(X)
, a__first(X1, X2) -> first(X1, X2) }
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:
{ a__terms(N) -> cons(recip(a__sqr(mark(N))), terms(s(N)))
, a__sqr(0()) -> 0()
, a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
, a__dbl(0()) -> 0()
, a__dbl(s(X)) -> s(s(a__dbl(mark(X))))
, a__add(0(), X) -> mark(X)
, a__add(s(X), Y) -> s(a__add(mark(X), mark(Y)))
, a__first(0(), X) -> nil()
, a__first(s(X), cons(Y, Z)) -> cons(mark(Y), first(X, Z))
, mark(terms(X)) -> a__terms(mark(X))
, mark(sqr(X)) -> a__sqr(mark(X))
, mark(add(X1, X2)) -> a__add(mark(X1), mark(X2))
, mark(dbl(X)) -> a__dbl(mark(X))
, mark(first(X1, X2)) -> a__first(mark(X1), mark(X2))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(recip(X)) -> recip(mark(X))
, mark(s(X)) -> s(mark(X))
, mark(0()) -> 0()
, mark(nil()) -> nil()
, a__terms(X) -> terms(X)
, a__sqr(X) -> sqr(X)
, a__add(X1, X2) -> add(X1, X2)
, a__dbl(X) -> dbl(X)
, a__first(X1, X2) -> first(X1, X2) }
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:
{ a__terms(N) -> cons(recip(a__sqr(mark(N))), terms(s(N)))
, a__sqr(0()) -> 0()
, a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
, a__dbl(0()) -> 0()
, a__dbl(s(X)) -> s(s(a__dbl(mark(X))))
, a__add(0(), X) -> mark(X)
, a__add(s(X), Y) -> s(a__add(mark(X), mark(Y)))
, a__first(0(), X) -> nil()
, a__first(s(X), cons(Y, Z)) -> cons(mark(Y), first(X, Z))
, mark(terms(X)) -> a__terms(mark(X))
, mark(sqr(X)) -> a__sqr(mark(X))
, mark(add(X1, X2)) -> a__add(mark(X1), mark(X2))
, mark(dbl(X)) -> a__dbl(mark(X))
, mark(first(X1, X2)) -> a__first(mark(X1), mark(X2))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(recip(X)) -> recip(mark(X))
, mark(s(X)) -> s(mark(X))
, mark(0()) -> 0()
, mark(nil()) -> nil()
, a__terms(X) -> terms(X)
, a__sqr(X) -> sqr(X)
, a__add(X1, X2) -> add(X1, X2)
, a__dbl(X) -> dbl(X)
, a__first(X1, X2) -> first(X1, X2) }
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:
{ a__terms(N) -> cons(recip(a__sqr(mark(N))), terms(s(N)))
, a__sqr(0()) -> 0()
, a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
, a__dbl(0()) -> 0()
, a__dbl(s(X)) -> s(s(a__dbl(mark(X))))
, a__add(0(), X) -> mark(X)
, a__add(s(X), Y) -> s(a__add(mark(X), mark(Y)))
, a__first(0(), X) -> nil()
, a__first(s(X), cons(Y, Z)) -> cons(mark(Y), first(X, Z))
, mark(terms(X)) -> a__terms(mark(X))
, mark(sqr(X)) -> a__sqr(mark(X))
, mark(add(X1, X2)) -> a__add(mark(X1), mark(X2))
, mark(dbl(X)) -> a__dbl(mark(X))
, mark(first(X1, X2)) -> a__first(mark(X1), mark(X2))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(recip(X)) -> recip(mark(X))
, mark(s(X)) -> s(mark(X))
, mark(0()) -> 0()
, mark(nil()) -> nil()
, a__terms(X) -> terms(X)
, a__sqr(X) -> sqr(X)
, a__add(X1, X2) -> add(X1, X2)
, a__dbl(X) -> dbl(X)
, a__first(X1, X2) -> first(X1, X2) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..