Certification Problem
Input (COPS 543)
We consider the TRS containing the following rules:
|
f(c) |
→ |
g(c) |
(1) |
|
g(c) |
→ |
f(c) |
(2) |
| c |
→ |
d |
(3) |
The underlying signature is as follows:
{f/1, c/0, g/1, d/0}Property / Task
Prove or disprove confluence.Answer / Result
No.Proof (by csi @ CoCo 2020)
1 Non-Joinable Fork
The system is not confluent due to the following forking derivations.
| t0
|
= |
f(c) |
|
→
|
g(c) |
|
→
|
g(d) |
|
= |
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.