interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ from(X) -> cons(X, n__from(s(X)))
, from(X) -> n__from(X)
, 2ndspos(s(N), cons(X, Z)) -> 2ndspos(s(N), cons2(X, activate(Z)))
, 2ndspos(s(N), cons2(X, cons(Y, Z))) ->
rcons(posrecip(Y), 2ndsneg(N, activate(Z)))
, 2ndspos(0(), Z) -> rnil()
, activate(X) -> X
, activate(n__from(X)) -> from(X)
, 2ndsneg(s(N), cons(X, Z)) -> 2ndsneg(s(N), cons2(X, activate(Z)))
, 2ndsneg(s(N), cons2(X, cons(Y, Z))) ->
rcons(negrecip(Y), 2ndspos(N, activate(Z)))
, 2ndsneg(0(), Z) -> rnil()
, pi(X) -> 2ndspos(X, from(0()))
, plus(s(X), Y) -> s(plus(X, Y))
, plus(0(), Y) -> Y
, times(s(X), Y) -> plus(Y, times(X, Y))
, times(0(), Y) -> 0()
, square(X) -> times(X, X) }
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:
{ from(X) -> cons(X, n__from(s(X)))
, 2ndspos(0(), Z) -> rnil()
, 2ndspos(s(N), cons(X, Z)) -> 2ndspos(s(N), cons2(X, activate(Z)))
, 2ndspos(s(N), cons2(X, cons(Y, Z))) ->
rcons(posrecip(Y), 2ndsneg(N, activate(Z)))
, 2ndsneg(0(), Z) -> rnil()
, 2ndsneg(s(N), cons(X, Z)) -> 2ndsneg(s(N), cons2(X, activate(Z)))
, 2ndsneg(s(N), cons2(X, cons(Y, Z))) ->
rcons(negrecip(Y), 2ndspos(N, activate(Z)))
, pi(X) -> 2ndspos(X, from(0()))
, plus(0(), Y) -> Y
, plus(s(X), Y) -> s(plus(X, Y))
, times(0(), Y) -> 0()
, times(s(X), Y) -> plus(Y, times(X, Y))
, square(X) -> times(X, X)
, from(X) -> n__from(X)
, activate(n__from(X)) -> from(X)
, 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)))
, 2ndspos(0(), Z) -> rnil()
, 2ndspos(s(N), cons(X, Z)) -> 2ndspos(s(N), cons2(X, activate(Z)))
, 2ndspos(s(N), cons2(X, cons(Y, Z))) ->
rcons(posrecip(Y), 2ndsneg(N, activate(Z)))
, 2ndsneg(0(), Z) -> rnil()
, 2ndsneg(s(N), cons(X, Z)) -> 2ndsneg(s(N), cons2(X, activate(Z)))
, 2ndsneg(s(N), cons2(X, cons(Y, Z))) ->
rcons(negrecip(Y), 2ndspos(N, activate(Z)))
, pi(X) -> 2ndspos(X, from(0()))
, plus(0(), Y) -> Y
, plus(s(X), Y) -> s(plus(X, Y))
, times(0(), Y) -> 0()
, times(s(X), Y) -> plus(Y, times(X, Y))
, square(X) -> times(X, X)
, from(X) -> n__from(X)
, activate(n__from(X)) -> from(X)
, 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)))
, 2ndspos(0(), Z) -> rnil()
, 2ndspos(s(N), cons(X, Z)) -> 2ndspos(s(N), cons2(X, activate(Z)))
, 2ndspos(s(N), cons2(X, cons(Y, Z))) ->
rcons(posrecip(Y), 2ndsneg(N, activate(Z)))
, 2ndsneg(0(), Z) -> rnil()
, 2ndsneg(s(N), cons(X, Z)) -> 2ndsneg(s(N), cons2(X, activate(Z)))
, 2ndsneg(s(N), cons2(X, cons(Y, Z))) ->
rcons(negrecip(Y), 2ndspos(N, activate(Z)))
, pi(X) -> 2ndspos(X, from(0()))
, plus(0(), Y) -> Y
, plus(s(X), Y) -> s(plus(X, Y))
, times(0(), Y) -> 0()
, times(s(X), Y) -> plus(Y, times(X, Y))
, square(X) -> times(X, X)
, from(X) -> n__from(X)
, activate(n__from(X)) -> from(X)
, 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)))
, 2ndspos(0(), Z) -> rnil()
, 2ndspos(s(N), cons(X, Z)) -> 2ndspos(s(N), cons2(X, activate(Z)))
, 2ndspos(s(N), cons2(X, cons(Y, Z))) ->
rcons(posrecip(Y), 2ndsneg(N, activate(Z)))
, 2ndsneg(0(), Z) -> rnil()
, 2ndsneg(s(N), cons(X, Z)) -> 2ndsneg(s(N), cons2(X, activate(Z)))
, 2ndsneg(s(N), cons2(X, cons(Y, Z))) ->
rcons(negrecip(Y), 2ndspos(N, activate(Z)))
, pi(X) -> 2ndspos(X, from(0()))
, plus(0(), Y) -> Y
, plus(s(X), Y) -> s(plus(X, Y))
, times(0(), Y) -> 0()
, times(s(X), Y) -> plus(Y, times(X, Y))
, square(X) -> times(X, X)
, from(X) -> n__from(X)
, activate(n__from(X)) -> from(X)
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..