NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = +(s(x),+(s(x20),x21))
2 +(s(x),s(+(x20,x21)))
ε s(+(+(x20,x21),s(x)))
1 s(s(+(x,+(x20,x21))))
= t3

t0 = +(s(x),+(s(x20),x21))
ε s(+(x,+(s(x20),x21)))
1.2 s(+(x,s(+(x20,x21))))
1 s(s(+(+(x20,x21),x)))
= t3

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

Tool configuration

csi