Problem AG01 3.24

LMPO

Execution Time (secs)
0.028
Answer
MAYBE
InputAG01 3.24
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.035
Answer
MAYBE
InputAG01 3.24
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.027
Answer
MAYBE
InputAG01 3.24
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.027
Answer
MAYBE
InputAG01 3.24
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.028
Answer
MAYBE
InputAG01 3.24
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.023
Answer
MAYBE
InputAG01 3.24
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..