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