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