NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

br(0,y,z) y
br(s(x),y,z) z
p(0) 0
p(s(x)) x
+(x,y) br(x,y,+(p(x),s(y)))
+(x,y) br(y,x,+(s(x),p(y)))

Proof

1 Non-Joinable Fork

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

t0 = +(x,y)
ε br(x,y,+(p(x),s(y)))
= t1

t0 = +(x,y)
ε br(y,x,+(s(x),p(y)))
= t1

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

Tool configuration

csi