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