interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ terms(N) -> cons(recip(sqr(N)))
, sqr(0()) -> 0()
, sqr(s(X)) -> s(add(sqr(X), dbl(X)))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, dbl(0()) -> 0()
, dbl(s(X)) -> s(s(dbl(X)))
, first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix interpretation of dimension 3' failed due to the
following reason:
The input cannot be shown compatible
2) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
3) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
4) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ terms(N) -> cons(recip(sqr(N)))
, sqr(0()) -> 0()
, sqr(s(X)) -> s(add(sqr(X), dbl(X)))
, dbl(0()) -> 0()
, dbl(s(X)) -> s(s(dbl(X)))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ terms(N) -> cons(recip(sqr(N)))
, sqr(0()) -> 0()
, sqr(s(X)) -> s(add(sqr(X), dbl(X)))
, dbl(0()) -> 0()
, dbl(s(X)) -> s(s(dbl(X)))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
terms > cons, terms > recip, terms > sqr, sqr > s, sqr > add,
sqr > dbl, add > s, dbl > s, first > nil .
Hurray, we answered YES(?,PRIMREC)
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ terms(N) -> cons(recip(sqr(N)))
, sqr(0()) -> 0()
, sqr(s(X)) -> s(add(sqr(X), dbl(X)))
, dbl(0()) -> 0()
, dbl(s(X)) -> s(s(dbl(X)))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y) }
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:
{ terms(N) -> cons(recip(sqr(N)))
, sqr(0()) -> 0()
, sqr(s(X)) -> s(add(sqr(X), dbl(X)))
, dbl(0()) -> 0()
, dbl(s(X)) -> s(s(dbl(X)))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..