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