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