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