YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

+(+(x,y),z) +(x,+(y,z))
+(x,+(y,z)) +(+(x,y),z)

Proof

1 Redundant Rules Transformation

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

+(x,+(y,z)) +(+(x,y),z)
+(+(x,y),z) +(x,+(y,z))
+(x,+(y,z)) +(x,+(y,z))
+(+(x,y),z) +(+(x,y),z)

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