Certification Problem
Input (COPS 946)
We consider the TRS containing the following rules:
|
a(a(x)) |
→ |
b(b(b(x))) |
(1) |
|
b(b(b(b(x)))) |
→ |
a(a(a(x))) |
(2) |
The underlying signature is as follows:
{a/1, b/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
|
= |
a(a(a(x13))) |
|
→
|
a(b(b(b(x13)))) |
|
= |
t1
|
| t0
|
= |
a(a(a(x13))) |
|
→
|
b(b(b(a(x13)))) |
|
= |
t1
|
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.