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