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