Problem AG01 innermost 4.19

Tool LMPO

Execution Time
0.050
Answer
MAYBE
InputAG01 innermost 4.19

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.064
Answer
MAYBE
InputAG01 innermost 4.19

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.048
Answer
MAYBE
InputAG01 innermost 4.19

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.053
Answer
MAYBE
InputAG01 innermost 4.19

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.049
Answer
MAYBE
InputAG01 innermost 4.19

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.040
Answer
MAYBE
InputAG01 innermost 4.19

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..