Problem Mixed outermost non-lin2

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..