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