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