Problem AG01 3.49

Tool LMPO

Execution Time
0.049
Answer
MAYBE
InputAG01 3.49

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.062
Answer
MAYBE
InputAG01 3.49

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.051
Answer
MAYBE
InputAG01 3.49

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.046
Answer
MAYBE
InputAG01 3.49

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.050
Answer
MAYBE
InputAG01 3.49

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.064
Answer
MAYBE
InputAG01 3.49

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..