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