Problem Waldmann 07 size12 size-12-alpha-3-num-540

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(b(x1)) -> x1
     , a(b(x1)) -> b(c(x1))
     , a(c(x1)) -> b(a(a(a(x1))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(b(x1)) -> x1
     , a(b(x1)) -> b(c(x1))
     , a(c(x1)) -> b(a(a(a(x1))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(b(x1)) -> x1
     , a(b(x1)) -> b(c(x1))
     , a(c(x1)) -> b(a(a(a(x1))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(b(x1)) -> x1
     , a(b(x1)) -> b(c(x1))
     , a(c(x1)) -> b(a(a(a(x1))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(b(x1)) -> x1
     , a(b(x1)) -> b(c(x1))
     , a(c(x1)) -> b(a(a(a(x1))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(b(x1)) -> x1
     , a(b(x1)) -> b(c(x1))
     , a(c(x1)) -> b(a(a(a(x1))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..