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