interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, inc(0()) -> s(0())
, inc(s(x)) -> s(inc(x))
, logarithm(x) -> logIter(x, 0())
, logIter(x, y) ->
if(le(s(0()), x), le(s(s(0())), x), half(x), inc(y))
, if(true(), true(), x, y) -> logIter(x, y)
, if(true(), false(), x, s(y)) -> y
, if(false(), b, x, y) -> logZeroError()
, f() -> g()
, f() -> h() }
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:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, inc(s(x)) -> s(inc(x))
, inc(0()) -> s(0())
, logarithm(x) -> logIter(x, 0())
, logIter(x, y) ->
if(le(s(0()), x), le(s(s(0())), x), half(x), inc(y))
, if(false(), b, x, y) -> logZeroError()
, if(true(), false(), x, s(y)) -> y
, if(true(), true(), x, y) -> logIter(x, y)
, f() -> g()
, f() -> h() }
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:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, inc(s(x)) -> s(inc(x))
, inc(0()) -> s(0())
, logarithm(x) -> logIter(x, 0())
, logIter(x, y) ->
if(le(s(0()), x), le(s(s(0())), x), half(x), inc(y))
, if(false(), b, x, y) -> logZeroError()
, if(true(), false(), x, s(y)) -> y
, if(true(), true(), x, y) -> logIter(x, y)
, f() -> g()
, f() -> h() }
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:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, inc(s(x)) -> s(inc(x))
, inc(0()) -> s(0())
, logarithm(x) -> logIter(x, 0())
, logIter(x, y) ->
if(le(s(0()), x), le(s(s(0())), x), half(x), inc(y))
, if(false(), b, x, y) -> logZeroError()
, if(true(), false(), x, s(y)) -> y
, if(true(), true(), x, y) -> logIter(x, y)
, f() -> g()
, f() -> h() }
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:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, inc(s(x)) -> s(inc(x))
, inc(0()) -> s(0())
, logarithm(x) -> logIter(x, 0())
, logIter(x, y) ->
if(le(s(0()), x), le(s(s(0())), x), half(x), inc(y))
, if(false(), b, x, y) -> logZeroError()
, if(true(), false(), x, s(y)) -> y
, if(true(), true(), x, y) -> logIter(x, y)
, f() -> g()
, f() -> h() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..