Problem Zantema 04 z009

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(x1) -> b(c(x1))
     , a(b(x1)) -> b(a(x1))
     , d(c(x1)) -> d(a(x1))
     , a(c(x1)) -> c(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(x1) -> b(c(x1))
     , a(b(x1)) -> b(a(x1))
     , d(c(x1)) -> d(a(x1))
     , a(c(x1)) -> c(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(x1) -> b(c(x1))
     , a(b(x1)) -> b(a(x1))
     , d(c(x1)) -> d(a(x1))
     , a(c(x1)) -> c(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(x1) -> b(c(x1))
     , a(b(x1)) -> b(a(x1))
     , d(c(x1)) -> d(a(x1))
     , a(c(x1)) -> c(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(x1) -> b(c(x1))
     , a(b(x1)) -> b(a(x1))
     , d(c(x1)) -> d(a(x1))
     , a(c(x1)) -> c(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(x1) -> b(c(x1))
     , a(b(x1)) -> b(a(x1))
     , d(c(x1)) -> d(a(x1))
     , a(c(x1)) -> c(a(x1))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..