YES Confluence Proof

Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

f(g(x)) → h(x,x)
g(a) → b
f(x) → h(x,x)
b → a
h(x,y) → h(g(x),g(y))
g(x) → x
a → b

Proof

1 Development Closed

Confluence is proven since the TRS is development closed.

Tool configuration

ACP