Problem AG01 3.52

Tool LMPO

Execution Time
0.030
Answer
MAYBE
InputAG01 3.52

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.021
Answer
MAYBE
InputAG01 3.52

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.024
Answer
MAYBE
InputAG01 3.52

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.035
Answer
MAYBE
InputAG01 3.52

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.037
Answer
MAYBE
InputAG01 3.52

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(0(), 1(), x) -> f(s(x), x, x)
     , f(x, y, s(z)) -> s(f(0(), 1(), z))}
  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.52

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..