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