Problem Zantema 05 z23

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..