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))
s(s(x)) x

Proof

1 Non-Joinable Fork

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

t0 = +(s(x111),s(y))
ε s(+(x111,s(y)))
1 s(s(+(y,x111)))
ε +(y,x111)
= t3

t0 = +(s(x111),s(y))
ε s(+(y,s(x111)))
1 s(s(+(x111,y)))
ε +(x111,y)
= t3

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

Tool configuration

csi