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