Problem AG01 3.47

Tool LMPO

Execution Time
0.027
Answer
MAYBE
InputAG01 3.47

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.039
Answer
MAYBE
InputAG01 3.47

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.020
Answer
MAYBE
InputAG01 3.47

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.056
Answer
MAYBE
InputAG01 3.47

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.031
Answer
MAYBE
InputAG01 3.47

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.035
Answer
MAYBE
InputAG01 3.47

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..