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