Problem Zantema 05 z13

LMPO

Execution Time (secs)
0.053
Answer
MAYBE
InputZantema 05 z13
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(a(x)), y)
     , f(x, b(a(y))) -> f(b(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..

MPO

Execution Time (secs)
0.045
Answer
MAYBE
InputZantema 05 z13
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(a(x)), y)
     , f(x, b(a(y))) -> f(b(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..

POP*

Execution Time (secs)
0.049
Answer
MAYBE
InputZantema 05 z13
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(a(x)), y)
     , f(x, b(a(y))) -> f(b(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..

POP* (PS)

Execution Time (secs)
0.050
Answer
MAYBE
InputZantema 05 z13
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(a(x)), y)
     , f(x, b(a(y))) -> f(b(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..

Small POP*

Execution Time (secs)
0.052
Answer
MAYBE
InputZantema 05 z13
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(a(x)), y)
     , f(x, b(a(y))) -> f(b(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..

Small POP* (PS)

Execution Time (secs)
0.041
Answer
MAYBE
InputZantema 05 z13
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, a(b(y))) -> f(a(a(x)), y)
     , f(x, b(a(y))) -> f(b(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..