Problem AG01 3.26

Tool LMPO

Execution Time
0.030
Answer
MAYBE
InputAG01 3.26

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.031
Answer
MAYBE
InputAG01 3.26

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.035
Answer
MAYBE
InputAG01 3.26

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.019
Answer
MAYBE
InputAG01 3.26

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.020
Answer
MAYBE
InputAG01 3.26

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.027
Answer
MAYBE
InputAG01 3.26

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..