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