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