LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, inc(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(x)) -> x
, bits(x) -> bitIter(x, 0())
, bitIter(x, y) -> if(zero(x), x, inc(y))
, if(true(), x, y) -> p(y)
, if(false(), x, y) -> bitIter(half(x), y)}
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(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, inc(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(x)) -> x
, bits(x) -> bitIter(x, 0())
, bitIter(x, y) -> if(zero(x), x, inc(y))
, if(true(), x, y) -> p(y)
, if(false(), x, y) -> bitIter(half(x), y)}
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(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, inc(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(x)) -> x
, bits(x) -> bitIter(x, 0())
, bitIter(x, y) -> if(zero(x), x, inc(y))
, if(true(), x, y) -> p(y)
, if(false(), x, y) -> bitIter(half(x), y)}
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(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, inc(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(x)) -> x
, bits(x) -> bitIter(x, 0())
, bitIter(x, y) -> if(zero(x), x, inc(y))
, if(true(), x, y) -> p(y)
, if(false(), x, y) -> bitIter(half(x), y)}
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(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, inc(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(x)) -> x
, bits(x) -> bitIter(x, 0())
, bitIter(x, y) -> if(zero(x), x, inc(y))
, if(true(), x, y) -> p(y)
, if(false(), x, y) -> bitIter(half(x), y)}
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(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, inc(0()) -> 0()
, inc(s(x)) -> s(inc(x))
, zero(0()) -> true()
, zero(s(x)) -> false()
, p(0()) -> 0()
, p(s(x)) -> x
, bits(x) -> bitIter(x, 0())
, bitIter(x, y) -> if(zero(x), x, inc(y))
, if(true(), x, y) -> p(y)
, if(false(), x, y) -> bitIter(half(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..