LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ half(x) -> if(ge(x, s(s(0()))), x)
, if(false(), x) -> 0()
, if(true(), x) -> s(half(p(p(x))))
, p(0()) -> 0()
, p(s(x)) -> x
, ge(x, 0()) -> true()
, ge(0(), s(x)) -> false()
, ge(s(x), s(y)) -> ge(x, y)
, log(0()) -> 0()
, log(s(x)) -> s(log(half(s(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ half(x) -> if(ge(x, s(s(0()))), x)
, if(false(), x) -> 0()
, if(true(), x) -> s(half(p(p(x))))
, p(0()) -> 0()
, p(s(x)) -> x
, ge(x, 0()) -> true()
, ge(0(), s(x)) -> false()
, ge(s(x), s(y)) -> ge(x, y)
, log(0()) -> 0()
, log(s(x)) -> s(log(half(s(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ half(x) -> if(ge(x, s(s(0()))), x)
, if(false(), x) -> 0()
, if(true(), x) -> s(half(p(p(x))))
, p(0()) -> 0()
, p(s(x)) -> x
, ge(x, 0()) -> true()
, ge(0(), s(x)) -> false()
, ge(s(x), s(y)) -> ge(x, y)
, log(0()) -> 0()
, log(s(x)) -> s(log(half(s(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ half(x) -> if(ge(x, s(s(0()))), x)
, if(false(), x) -> 0()
, if(true(), x) -> s(half(p(p(x))))
, p(0()) -> 0()
, p(s(x)) -> x
, ge(x, 0()) -> true()
, ge(0(), s(x)) -> false()
, ge(s(x), s(y)) -> ge(x, y)
, log(0()) -> 0()
, log(s(x)) -> s(log(half(s(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ half(x) -> if(ge(x, s(s(0()))), x)
, if(false(), x) -> 0()
, if(true(), x) -> s(half(p(p(x))))
, p(0()) -> 0()
, p(s(x)) -> x
, ge(x, 0()) -> true()
, ge(0(), s(x)) -> false()
, ge(s(x), s(y)) -> ge(x, y)
, log(0()) -> 0()
, log(s(x)) -> s(log(half(s(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ half(x) -> if(ge(x, s(s(0()))), x)
, if(false(), x) -> 0()
, if(true(), x) -> s(half(p(p(x))))
, p(0()) -> 0()
, p(s(x)) -> x
, ge(x, 0()) -> true()
, ge(0(), s(x)) -> false()
, ge(s(x), s(y)) -> ge(x, y)
, log(0()) -> 0()
, log(s(x)) -> s(log(half(s(x))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..