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