YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

+(0,y) y
+(s(0),y) s(+(0,y))
+(x,y) +(y,x)
s(s(x)) x

Proof

1 Redundant Rules Transformation

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

s(s(x)) x
+(x,y) +(y,x)
+(s(0),y) s(+(0,y))
+(0,y) y
+(y,0) y
+(y,s(0)) s(+(0,y))

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