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