YES Confluence Proof

Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

f(x) g(x)
f(x) h(f(x))
h(f(x)) h(g(x))
g(x) h(g(x))

Proof

1 Strongly closed

Confluence is proven since the TRS is strongly closed. The joins can be performed within 3 step(s).

Tool configuration

ACP