interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ from(X) -> cons(X, from(s(X)))
, sel(s(N), cons(X, XS)) -> sel(N, XS)
, sel(0(), cons(X, XS)) -> X
, minus(X, 0()) -> 0()
, minus(s(X), s(Y)) -> minus(X, Y)
, quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
, quot(0(), s(Y)) -> 0()
, zWquot(XS, nil()) -> nil()
, zWquot(cons(X, XS), cons(Y, YS)) ->
cons(quot(X, Y), zWquot(XS, YS))
, zWquot(nil(), XS) -> nil() }
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, from(s(X)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, XS)
, minus(X, 0()) -> 0()
, minus(s(X), s(Y)) -> minus(X, Y)
, quot(0(), s(Y)) -> 0()
, quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
, zWquot(XS, nil()) -> nil()
, zWquot(nil(), XS) -> nil()
, zWquot(cons(X, XS), cons(Y, YS)) ->
cons(quot(X, Y), zWquot(XS, YS)) }
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, from(s(X)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, XS)
, minus(X, 0()) -> 0()
, minus(s(X), s(Y)) -> minus(X, Y)
, quot(0(), s(Y)) -> 0()
, quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
, zWquot(XS, nil()) -> nil()
, zWquot(nil(), XS) -> nil()
, zWquot(cons(X, XS), cons(Y, YS)) ->
cons(quot(X, Y), zWquot(XS, YS)) }
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, from(s(X)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, XS)
, minus(X, 0()) -> 0()
, minus(s(X), s(Y)) -> minus(X, Y)
, quot(0(), s(Y)) -> 0()
, quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
, zWquot(XS, nil()) -> nil()
, zWquot(nil(), XS) -> nil()
, zWquot(cons(X, XS), cons(Y, YS)) ->
cons(quot(X, Y), zWquot(XS, YS)) }
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, from(s(X)))
, sel(0(), cons(X, XS)) -> X
, sel(s(N), cons(X, XS)) -> sel(N, XS)
, minus(X, 0()) -> 0()
, minus(s(X), s(Y)) -> minus(X, Y)
, quot(0(), s(Y)) -> 0()
, quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
, zWquot(XS, nil()) -> nil()
, zWquot(nil(), XS) -> nil()
, zWquot(cons(X, XS), cons(Y, YS)) ->
cons(quot(X, Y), zWquot(XS, YS)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..