Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ cond(true(), x) -> cond(odd(x), 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..
Tool MPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ cond(true(), x) -> cond(odd(x), 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..
Tool POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ cond(true(), x) -> cond(odd(x), 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..
Tool POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ cond(true(), x) -> cond(odd(x), 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..
Tool Small POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ cond(true(), x) -> cond(odd(x), 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..
Tool Small POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ cond(true(), x) -> cond(odd(x), 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..