NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = +(f5,s(s(f6)))
2 +(f5,f6)
= t1

t0 = +(f5,s(s(f6)))
ε s(+(s(f6),f5))
= t1

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

Tool configuration

csi