Certification Problem
Input (COPS 571)
We consider the TRS containing the following rules:
|
+(0,0) |
→ |
0 |
(1) |
|
+(s(x),y) |
→ |
s(+(x,y)) |
(2) |
|
+(x,s(y)) |
→ |
s(+(y,x)) |
(3) |
The underlying signature is as follows:
{+/2, 0/0, s/1}Property / Task
Prove or disprove confluence.Answer / Result
No.Proof (by csi @ CoCo 2023)
1 Non-Joinable Fork
The system is not confluent due to the following forking derivations.
| t0
|
= |
+(s(x66),s(y)) |
|
→
|
s(+(x66,s(y))) |
|
→
|
s(s(+(y,x66))) |
|
= |
t2
|
| t0
|
= |
+(s(x66),s(y)) |
|
→
|
s(+(y,s(x66))) |
|
→
|
s(s(+(x66,y))) |
|
= |
t2
|
The two resulting terms cannot be joined for the following reason:
- When applying the cap-function on both terms (where variables may be treated like constants)
then the resulting terms do not unify.