YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

-(0,0) 0
-(s(x),0) s(x)
-(x,s(y)) -(d(x),y)
d(s(x)) x
-(s(x),s(y)) -(x,y)
-(d(x),y) -(x,s(y))

Proof

1 Redundant Rules Transformation

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

-(d(x),y) -(x,s(y))
-(s(x),s(y)) -(x,y)
d(s(x)) x
-(x,s(y)) -(d(x),y)
-(s(x),0) s(x)
-(0,0) 0
-(d(x),y) -(d(x),y)
-(x,s(y)) -(x,s(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