Tool LMPO
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
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*
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)
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*
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)
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..