YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Redundant Rules Transformation

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

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

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