interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ gt(0(), Y) -> false()
, gt(s(X), 0()) -> true()
, gt(s(X), s(Y)) -> gt(X, Y)
, p(0()) -> 0()
, p(s(X)) -> X
, if(false(), X, Y) -> Y
, if(true(), X, Y) -> X
, minus(X, Y) -> if(gt(Y, 0()), minus(p(X), p(Y)), X)
, div(0(), s(Y)) -> 0()
, div(s(X), s(Y)) -> s(div(minus(X, Y), s(Y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'custom shape polynomial interpretation' failed due to the
following reason:
Following exception was raised:
stack overflow
2) 'matrix interpretation of dimension 3' 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:
{ gt(0(), Y) -> false()
, gt(s(X), 0()) -> true()
, gt(s(X), s(Y)) -> gt(X, Y)
, p(0()) -> 0()
, p(s(X)) -> X
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, minus(X, Y) -> if(gt(Y, 0()), minus(p(X), p(Y)), X)
, div(0(), s(Y)) -> 0()
, div(s(X), s(Y)) -> s(div(minus(X, Y), s(Y))) }
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:
{ gt(0(), Y) -> false()
, gt(s(X), 0()) -> true()
, gt(s(X), s(Y)) -> gt(X, Y)
, p(0()) -> 0()
, p(s(X)) -> X
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, minus(X, Y) -> if(gt(Y, 0()), minus(p(X), p(Y)), X)
, div(0(), s(Y)) -> 0()
, div(s(X), s(Y)) -> s(div(minus(X, Y), s(Y))) }
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:
{ gt(0(), Y) -> false()
, gt(s(X), 0()) -> true()
, gt(s(X), s(Y)) -> gt(X, Y)
, p(0()) -> 0()
, p(s(X)) -> X
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, minus(X, Y) -> if(gt(Y, 0()), minus(p(X), p(Y)), X)
, div(0(), s(Y)) -> 0()
, div(s(X), s(Y)) -> s(div(minus(X, Y), s(Y))) }
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:
{ gt(0(), Y) -> false()
, gt(s(X), 0()) -> true()
, gt(s(X), s(Y)) -> gt(X, Y)
, p(0()) -> 0()
, p(s(X)) -> X
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, minus(X, Y) -> if(gt(Y, 0()), minus(p(X), p(Y)), X)
, div(0(), s(Y)) -> 0()
, div(s(X), s(Y)) -> s(div(minus(X, Y), s(Y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..