NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

The system is not confluent due to the following forking derivations.

t0 = +(0,+(y,z))
ε +(y,z)
= t1

t0 = +(0,+(y,z))
ε +(+(z,y),0)
= t1

The two resulting terms cannot be joined for the following reason:

Tool configuration

csi