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