Problem Zantema 05 z15

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(b(x)), y)
     , f(a(x), y) -> f(x, a(y))
     , f(b(x), y) -> f(x, b(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(b(x)), y)
     , f(a(x), y) -> f(x, a(y))
     , f(b(x), y) -> f(x, b(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(b(x)), y)
     , f(a(x), y) -> f(x, a(y))
     , f(b(x), y) -> f(x, b(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(b(x)), y)
     , f(a(x), y) -> f(x, a(y))
     , f(b(x), y) -> f(x, b(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(b(x)), y)
     , f(a(x), y) -> f(x, a(y))
     , f(b(x), y) -> f(x, b(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(b(x)), y)
     , f(a(x), y) -> f(x, a(y))
     , f(b(x), y) -> f(x, b(y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..