YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

f(x1,g(x2)) f(x1,g(x1))
f(g(y1),y2) f(g(y1),g(y1))
g(a) g(b)
b a

Proof

1 Redundant Rules Transformation

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

b a
g(a) g(b)
f(g(y1),y2) f(g(y1),g(y1))
f(x1,g(x2)) f(x1,g(x1))
g(a) g(a)
f(g(y1),y2) f(g(y1),g(g(y1)))

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

1.1 Development Closed

Confluence is proven since the TRS is development closed.

Tool configuration

csi