Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), 1(), X) -> h(X, X)
, h(0(), X) -> f(0(), 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:
{ f(0(), 1(), X) -> h(X, X)
, h(0(), X) -> f(0(), 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:
{ f(0(), 1(), X) -> h(X, X)
, h(0(), X) -> f(0(), 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:
{ f(0(), 1(), X) -> h(X, X)
, h(0(), X) -> f(0(), 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:
{ f(0(), 1(), X) -> h(X, X)
, h(0(), X) -> f(0(), 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:
{ f(0(), 1(), X) -> h(X, X)
, h(0(), X) -> f(0(), 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..