YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

h(f,a,a) h(g,a,a)
h(g,a,a) h(f,a,a)
a a'
h(x,a',y) h(x,y,y)
g f
f g

Proof

1 Redundant Rules Transformation

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

f g
g f
h(x,a',y) h(x,y,y)
a a'

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:

f g
g f
h(x,a',y) h(x,y,y)
a a'
f f
g g

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