Problem AG01 innermost 4.25

Tool LMPO

Execution Time
0.028
Answer
MAYBE
InputAG01 innermost 4.25

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.030
Answer
MAYBE
InputAG01 innermost 4.25

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.029
Answer
MAYBE
InputAG01 innermost 4.25

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.023
Answer
MAYBE
InputAG01 innermost 4.25

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.038
Answer
MAYBE
InputAG01 innermost 4.25

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.023
Answer
MAYBE
InputAG01 innermost 4.25

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..