YES Confluence Proof

Confluence Proof

by csi

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 Redundant Rules Transformation

To prove that the TRS is (non-)confluent, we show (non-)confluence of the following modified system:

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

All redundant rules that were added or removed can be simulated in 1 steps .

1.1 Redundant Rules Transformation

To prove that the TRS is (non-)confluent, we show (non-)confluence of the following modified system:

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

All redundant rules that were added or removed can be simulated in 2 steps .

1.1.1 Development Closed

Confluence is proven since the TRS is development closed.

Tool configuration

csi