NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

plus(0,y) y
plus(s(x),y) s(plus(x,y))
qplus(0,y) y
qplus(s(x),y) qplus(x,s(y))
plus(x,y) qplus(x,y)

Proof

1 Non-Joinable Fork

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

t0 = plus(s(x160),y)
ε s(plus(x160,y))
1 s(qplus(x160,y))
= t2

t0 = plus(s(x160),y)
ε qplus(s(x160),y)
ε qplus(x160,s(y))
= t2

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

Tool configuration

csi