YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

from(x) :(x,from(s(x)))
sel(0,:(y,z)) y
sel(s(x),:(y,z)) sel(x,z)

Proof

1 Redundant Rules Transformation

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

sel(s(x),:(y,z)) sel(x,z)
sel(0,:(y,z)) y
from(x) :(x,from(s(x)))
from(x) :(x,:(s(x),from(s(s(x)))))

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