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

Proof

1 Non-Joinable Fork

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

t0 = +(p(s(0)),f5)
1 +(0,f5)
= t1

t0 = +(p(s(0)),f5)
ε +(s(0),p(f5))
= t1

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

Tool configuration

csi