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