interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ div(x, y) -> div2(x, y, 0())
, div2(x, y, i) ->
if1(le(y, 0()), le(y, x), x, y, plus(i, 0()), inc(i))
, if1(true(), b, x, y, i, j) -> divZeroError()
, if1(false(), b, x, y, i, j) -> if2(b, x, y, i, j)
, le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, plus(x, y) -> plusIter(x, y, 0())
, inc(0()) -> 0()
, inc(s(i)) -> s(inc(i))
, if2(true(), x, y, i, j) -> div2(minus(x, y), y, j)
, if2(false(), x, y, i, j) -> i
, minus(x, 0()) -> x
, minus(0(), y) -> 0()
, minus(s(x), s(y)) -> minus(x, y)
, plusIter(x, y, z) -> ifPlus(le(x, z), x, y, z)
, ifPlus(true(), x, y, z) -> y
, ifPlus(false(), x, y, z) -> plusIter(x, s(y), s(z))
, a() -> c()
, a() -> d() }
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:
{ div(x, y) -> div2(x, y, 0())
, div2(x, y, i) ->
if1(le(y, 0()), le(y, x), x, y, plus(i, 0()), inc(i))
, if1(true(), b, x, y, i, j) -> divZeroError()
, if1(false(), b, x, y, i, j) -> if2(b, x, y, i, j)
, if2(true(), x, y, i, j) -> div2(minus(x, y), y, j)
, if2(false(), x, y, i, j) -> i
, inc(0()) -> 0()
, inc(s(i)) -> s(inc(i))
, le(s(x), 0()) -> false()
, le(0(), y) -> true()
, le(s(x), s(y)) -> le(x, y)
, minus(x, 0()) -> x
, minus(0(), y) -> 0()
, minus(s(x), s(y)) -> minus(x, y)
, plus(x, y) -> plusIter(x, y, 0())
, plusIter(x, y, z) -> ifPlus(le(x, z), x, y, z)
, ifPlus(true(), x, y, z) -> y
, ifPlus(false(), x, y, z) -> plusIter(x, s(y), s(z))
, a() -> c()
, a() -> d() }
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:
{ div(x, y) -> div2(x, y, 0())
, div2(x, y, i) ->
if1(le(y, 0()), le(y, x), x, y, plus(i, 0()), inc(i))
, if1(true(), b, x, y, i, j) -> divZeroError()
, if1(false(), b, x, y, i, j) -> if2(b, x, y, i, j)
, if2(true(), x, y, i, j) -> div2(minus(x, y), y, j)
, if2(false(), x, y, i, j) -> i
, inc(0()) -> 0()
, inc(s(i)) -> s(inc(i))
, le(s(x), 0()) -> false()
, le(0(), y) -> true()
, le(s(x), s(y)) -> le(x, y)
, minus(x, 0()) -> x
, minus(0(), y) -> 0()
, minus(s(x), s(y)) -> minus(x, y)
, plus(x, y) -> plusIter(x, y, 0())
, plusIter(x, y, z) -> ifPlus(le(x, z), x, y, z)
, ifPlus(true(), x, y, z) -> y
, ifPlus(false(), x, y, z) -> plusIter(x, s(y), s(z))
, a() -> c()
, a() -> d() }
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:
{ div(x, y) -> div2(x, y, 0())
, div2(x, y, i) ->
if1(le(y, 0()), le(y, x), x, y, plus(i, 0()), inc(i))
, if1(true(), b, x, y, i, j) -> divZeroError()
, if1(false(), b, x, y, i, j) -> if2(b, x, y, i, j)
, if2(true(), x, y, i, j) -> div2(minus(x, y), y, j)
, if2(false(), x, y, i, j) -> i
, inc(0()) -> 0()
, inc(s(i)) -> s(inc(i))
, le(s(x), 0()) -> false()
, le(0(), y) -> true()
, le(s(x), s(y)) -> le(x, y)
, minus(x, 0()) -> x
, minus(0(), y) -> 0()
, minus(s(x), s(y)) -> minus(x, y)
, plus(x, y) -> plusIter(x, y, 0())
, plusIter(x, y, z) -> ifPlus(le(x, z), x, y, z)
, ifPlus(true(), x, y, z) -> y
, ifPlus(false(), x, y, z) -> plusIter(x, s(y), s(z))
, a() -> c()
, a() -> d() }
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:
{ div(x, y) -> div2(x, y, 0())
, div2(x, y, i) ->
if1(le(y, 0()), le(y, x), x, y, plus(i, 0()), inc(i))
, if1(true(), b, x, y, i, j) -> divZeroError()
, if1(false(), b, x, y, i, j) -> if2(b, x, y, i, j)
, if2(true(), x, y, i, j) -> div2(minus(x, y), y, j)
, if2(false(), x, y, i, j) -> i
, inc(0()) -> 0()
, inc(s(i)) -> s(inc(i))
, le(s(x), 0()) -> false()
, le(0(), y) -> true()
, le(s(x), s(y)) -> le(x, y)
, minus(x, 0()) -> x
, minus(0(), y) -> 0()
, minus(s(x), s(y)) -> minus(x, y)
, plus(x, y) -> plusIter(x, y, 0())
, plusIter(x, y, z) -> ifPlus(le(x, z), x, y, z)
, ifPlus(true(), x, y, z) -> y
, ifPlus(false(), x, y, z) -> plusIter(x, s(y), s(z))
, a() -> c()
, a() -> d() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..