Problem Zantema 05 z27

LMPO

Execution Time (secs)
0.064
Answer
MAYBE
InputZantema 05 z27
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.103
Answer
MAYBE
InputZantema 05 z27
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.044
Answer
MAYBE
InputZantema 05 z27
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.065
Answer
MAYBE
InputZantema 05 z27
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.057
Answer
MAYBE
InputZantema 05 z27
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.069
Answer
MAYBE
InputZantema 05 z27
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..