Problem SK90 4.18

Tool LMPO

Execution Time
0.063
Answer
MAYBE
InputSK90 4.18

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  gcd(x, 0()) -> x
     , gcd(0(), y) -> y
     , gcd(s(x), s(y)) ->
       if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.077
Answer
MAYBE
InputSK90 4.18

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  gcd(x, 0()) -> x
     , gcd(0(), y) -> y
     , gcd(s(x), s(y)) ->
       if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.040
Answer
MAYBE
InputSK90 4.18

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  gcd(x, 0()) -> x
     , gcd(0(), y) -> y
     , gcd(s(x), s(y)) ->
       if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.041
Answer
MAYBE
InputSK90 4.18

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  gcd(x, 0()) -> x
     , gcd(0(), y) -> y
     , gcd(s(x), s(y)) ->
       if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.055
Answer
MAYBE
InputSK90 4.18

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  gcd(x, 0()) -> x
     , gcd(0(), y) -> y
     , gcd(s(x), s(y)) ->
       if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(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
InputSK90 4.18

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  gcd(x, 0()) -> x
     , gcd(0(), y) -> y
     , gcd(s(x), s(y)) ->
       if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..