YES Confluence Proof

Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Strongly closed

Confluence is proven since the TRS is strongly closed. The joins can be performed within 0 step(s).

Tool configuration

ACP