interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, lt(x, 0()) -> false()
, lt(0(), s(y)) -> true()
, lt(s(x), s(y)) -> lt(x, y)
, if(false(), x, y) -> y
, if(true(), x, y) -> x
, div(x, 0()) -> 0()
, div(0(), y) -> 0()
, div(s(x), s(y)) -> if(lt(x, y), 0(), s(div(-(x, y), s(y)))) }
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:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, lt(x, 0()) -> false()
, lt(0(), s(y)) -> true()
, lt(s(x), s(y)) -> lt(x, y)
, if(true(), x, y) -> x
, if(false(), x, y) -> y
, div(x, 0()) -> 0()
, div(0(), y) -> 0()
, div(s(x), s(y)) -> if(lt(x, y), 0(), s(div(-(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:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, lt(x, 0()) -> false()
, lt(0(), s(y)) -> true()
, lt(s(x), s(y)) -> lt(x, y)
, if(true(), x, y) -> x
, if(false(), x, y) -> y
, div(x, 0()) -> 0()
, div(0(), y) -> 0()
, div(s(x), s(y)) -> if(lt(x, y), 0(), s(div(-(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:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, lt(x, 0()) -> false()
, lt(0(), s(y)) -> true()
, lt(s(x), s(y)) -> lt(x, y)
, if(true(), x, y) -> x
, if(false(), x, y) -> y
, div(x, 0()) -> 0()
, div(0(), y) -> 0()
, div(s(x), s(y)) -> if(lt(x, y), 0(), s(div(-(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:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, lt(x, 0()) -> false()
, lt(0(), s(y)) -> true()
, lt(s(x), s(y)) -> lt(x, y)
, if(true(), x, y) -> x
, if(false(), x, y) -> y
, div(x, 0()) -> 0()
, div(0(), y) -> 0()
, div(s(x), s(y)) -> if(lt(x, y), 0(), s(div(-(x, y), s(y)))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..