interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ le(s(x), s(y)) -> le(x, y)
, le(s(x), 0()) -> false()
, le(0(), y) -> true()
, double(s(x)) -> s(s(double(x)))
, double(0()) -> 0()
, log(s(x)) -> loop(s(x), s(0()), 0())
, log(0()) -> logError()
, loop(x, s(y), z) -> if(le(x, s(y)), x, s(y), z)
, if(false(), x, y, z) -> loop(x, double(y), s(z))
, if(true(), x, y, z) -> z
, maplog(xs) -> mapIter(xs, nil())
, mapIter(xs, ys) -> ifmap(isempty(xs), xs, ys)
, ifmap(false(), xs, ys) ->
mapIter(droplast(xs), cons(log(last(xs)), ys))
, ifmap(true(), xs, ys) -> ys
, isempty(nil()) -> true()
, isempty(cons(x, xs)) -> false()
, droplast(nil()) -> nil()
, droplast(cons(x, nil())) -> nil()
, droplast(cons(x, cons(y, xs))) -> cons(x, droplast(cons(y, xs)))
, last(nil()) -> error()
, last(cons(x, nil())) -> x
, last(cons(x, cons(y, xs))) -> last(cons(y, xs))
, a() -> b()
, a() -> c() }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ le(s(x), 0()) -> false()
, le(0(), y) -> true()
, le(s(x), s(y)) -> le(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, log(0()) -> logError()
, log(s(x)) -> loop(s(x), s(0()), 0())
, loop(x, s(y), z) -> if(le(x, s(y)), x, s(y), z)
, if(true(), x, y, z) -> z
, if(false(), x, y, z) -> loop(x, double(y), s(z))
, maplog(xs) -> mapIter(xs, nil())
, mapIter(xs, ys) -> ifmap(isempty(xs), xs, ys)
, ifmap(true(), xs, ys) -> ys
, ifmap(false(), xs, ys) ->
mapIter(droplast(xs), cons(log(last(xs)), ys))
, isempty(nil()) -> true()
, isempty(cons(x, xs)) -> false()
, last(nil()) -> error()
, last(cons(x, nil())) -> x
, last(cons(x, cons(y, xs))) -> last(cons(y, xs))
, droplast(nil()) -> nil()
, droplast(cons(x, nil())) -> nil()
, droplast(cons(x, cons(y, xs))) -> cons(x, droplast(cons(y, xs)))
, a() -> b()
, a() -> c() }
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:
{ le(s(x), 0()) -> false()
, le(0(), y) -> true()
, le(s(x), s(y)) -> le(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, log(0()) -> logError()
, log(s(x)) -> loop(s(x), s(0()), 0())
, loop(x, s(y), z) -> if(le(x, s(y)), x, s(y), z)
, if(true(), x, y, z) -> z
, if(false(), x, y, z) -> loop(x, double(y), s(z))
, maplog(xs) -> mapIter(xs, nil())
, mapIter(xs, ys) -> ifmap(isempty(xs), xs, ys)
, ifmap(true(), xs, ys) -> ys
, ifmap(false(), xs, ys) ->
mapIter(droplast(xs), cons(log(last(xs)), ys))
, isempty(nil()) -> true()
, isempty(cons(x, xs)) -> false()
, last(nil()) -> error()
, last(cons(x, nil())) -> x
, last(cons(x, cons(y, xs))) -> last(cons(y, xs))
, droplast(nil()) -> nil()
, droplast(cons(x, nil())) -> nil()
, droplast(cons(x, cons(y, xs))) -> cons(x, droplast(cons(y, xs)))
, a() -> b()
, a() -> c() }
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:
{ le(s(x), 0()) -> false()
, le(0(), y) -> true()
, le(s(x), s(y)) -> le(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, log(0()) -> logError()
, log(s(x)) -> loop(s(x), s(0()), 0())
, loop(x, s(y), z) -> if(le(x, s(y)), x, s(y), z)
, if(true(), x, y, z) -> z
, if(false(), x, y, z) -> loop(x, double(y), s(z))
, maplog(xs) -> mapIter(xs, nil())
, mapIter(xs, ys) -> ifmap(isempty(xs), xs, ys)
, ifmap(true(), xs, ys) -> ys
, ifmap(false(), xs, ys) ->
mapIter(droplast(xs), cons(log(last(xs)), ys))
, isempty(nil()) -> true()
, isempty(cons(x, xs)) -> false()
, last(nil()) -> error()
, last(cons(x, nil())) -> x
, last(cons(x, cons(y, xs))) -> last(cons(y, xs))
, droplast(nil()) -> nil()
, droplast(cons(x, nil())) -> nil()
, droplast(cons(x, cons(y, xs))) -> cons(x, droplast(cons(y, xs)))
, a() -> b()
, a() -> c() }
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:
{ le(s(x), 0()) -> false()
, le(0(), y) -> true()
, le(s(x), s(y)) -> le(x, y)
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))
, log(0()) -> logError()
, log(s(x)) -> loop(s(x), s(0()), 0())
, loop(x, s(y), z) -> if(le(x, s(y)), x, s(y), z)
, if(true(), x, y, z) -> z
, if(false(), x, y, z) -> loop(x, double(y), s(z))
, maplog(xs) -> mapIter(xs, nil())
, mapIter(xs, ys) -> ifmap(isempty(xs), xs, ys)
, ifmap(true(), xs, ys) -> ys
, ifmap(false(), xs, ys) ->
mapIter(droplast(xs), cons(log(last(xs)), ys))
, isempty(nil()) -> true()
, isempty(cons(x, xs)) -> false()
, last(nil()) -> error()
, last(cons(x, nil())) -> x
, last(cons(x, cons(y, xs))) -> last(cons(y, xs))
, droplast(nil()) -> nil()
, droplast(cons(x, nil())) -> nil()
, droplast(cons(x, cons(y, xs))) -> cons(x, droplast(cons(y, xs)))
, a() -> b()
, a() -> c() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..