Problem SK90 4.42

LMPO

Execution Time (secs)
0.063
Answer
MAYBE
InputSK90 4.42
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.047
Answer
MAYBE
InputSK90 4.42
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.054
Answer
MAYBE
InputSK90 4.42
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.066
Answer
MAYBE
InputSK90 4.42
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.058
Answer
MAYBE
InputSK90 4.42
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.065
Answer
MAYBE
InputSK90 4.42
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..