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