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