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