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