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))
+(p(x),y) p(+(y,x))
p(s(x)) s(p(x))
s(p(x)) x

Proof

1 Non-Joinable Fork

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

t0 = +(p(s(x153)),y)
1 +(s(p(x153)),y)
1 +(x153,y)
= t2

t0 = +(p(s(x153)),y)
ε p(+(y,s(x153)))
= t1

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

Tool configuration

csi