YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a → b
a → c
a → e
b → d
c → a
d → a
d → e
g(x) → h(a)
h(x) → e

Proof

1 Redundant Rules Transformation

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

h(x) → e
g(x) → h(a)
d → e
d → a
c → a
b → d
a → e
a → c
a → b
g(x) → e
g(x) → h(e)
g(x) → h(c)
g(x) → h(b)
d → c
d → b
c → e
c → c
c → b
b → e
b → a
a → a
a → d

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

1.1 Strongly closed

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

Tool configuration

csi