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