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