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