YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

f(a,a,b,b) f(c,c,c,c)
a b
a c
b a
b c

Proof

1 Redundant Rules Transformation

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

b c
b a
a c
a b
f(a,a,b,b) f(c,c,c,c)
b b
a a

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