interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ incr(X) -> n__incr(X)
, incr(nil()) -> nil()
, incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
, activate(X) -> X
, activate(n__incr(X)) -> incr(X)
, activate(n__adx(X)) -> adx(X)
, activate(n__zeros()) -> zeros()
, adx(X) -> n__adx(X)
, adx(nil()) -> nil()
, adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
, nats() -> adx(zeros())
, zeros() -> cons(0(), n__zeros())
, zeros() -> n__zeros()
, head(cons(X, L)) -> X
, tail(cons(X, L)) -> activate(L) }
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:
{ incr(nil()) -> nil()
, incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
, adx(nil()) -> nil()
, adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
, nats() -> adx(zeros())
, zeros() -> cons(0(), n__zeros())
, head(cons(X, L)) -> X
, tail(cons(X, L)) -> activate(L)
, incr(X) -> n__incr(X)
, adx(X) -> n__adx(X)
, zeros() -> n__zeros()
, activate(n__incr(X)) -> incr(X)
, activate(n__adx(X)) -> adx(X)
, activate(n__zeros()) -> zeros()
, 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:
{ incr(nil()) -> nil()
, incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
, adx(nil()) -> nil()
, adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
, nats() -> adx(zeros())
, zeros() -> cons(0(), n__zeros())
, head(cons(X, L)) -> X
, tail(cons(X, L)) -> activate(L)
, incr(X) -> n__incr(X)
, adx(X) -> n__adx(X)
, zeros() -> n__zeros()
, activate(n__incr(X)) -> incr(X)
, activate(n__adx(X)) -> adx(X)
, activate(n__zeros()) -> zeros()
, 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:
{ incr(nil()) -> nil()
, incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
, adx(nil()) -> nil()
, adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
, nats() -> adx(zeros())
, zeros() -> cons(0(), n__zeros())
, head(cons(X, L)) -> X
, tail(cons(X, L)) -> activate(L)
, incr(X) -> n__incr(X)
, adx(X) -> n__adx(X)
, zeros() -> n__zeros()
, activate(n__incr(X)) -> incr(X)
, activate(n__adx(X)) -> adx(X)
, activate(n__zeros()) -> zeros()
, 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:
{ incr(nil()) -> nil()
, incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
, adx(nil()) -> nil()
, adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
, nats() -> adx(zeros())
, zeros() -> cons(0(), n__zeros())
, head(cons(X, L)) -> X
, tail(cons(X, L)) -> activate(L)
, incr(X) -> n__incr(X)
, adx(X) -> n__adx(X)
, zeros() -> n__zeros()
, activate(n__incr(X)) -> incr(X)
, activate(n__adx(X)) -> adx(X)
, activate(n__zeros()) -> zeros()
, activate(X) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..