Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, 0()) -> s(0())
, f(s(x), s(y)) -> s(f(x, y))
, g(0(), x) -> g(f(x, x), x)}
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:
{ f(x, 0()) -> s(0())
, f(s(x), s(y)) -> s(f(x, y))
, g(0(), x) -> g(f(x, x), x)}
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:
{ f(x, 0()) -> s(0())
, f(s(x), s(y)) -> s(f(x, y))
, g(0(), x) -> g(f(x, x), x)}
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:
{ f(x, 0()) -> s(0())
, f(s(x), s(y)) -> s(f(x, y))
, g(0(), x) -> g(f(x, x), x)}
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:
{ f(x, 0()) -> s(0())
, f(s(x), s(y)) -> s(f(x, y))
, g(0(), x) -> g(f(x, x), x)}
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:
{ f(x, 0()) -> s(0())
, f(s(x), s(y)) -> s(f(x, y))
, g(0(), x) -> g(f(x, x), x)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..