Certification Problem
Input (COPS 1650)
We consider the TRS containing the following rules:
|
f(f(x)) |
→ |
f(g(f(x))) |
(1) |
|
f(x) |
→ |
x |
(2) |
The underlying signature is as follows:
{f/1, g/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
|
= |
f(f(x33)) |
|
→
|
f(g(f(x33))) |
|
→
|
g(f(x33)) |
|
→
|
g(x33) |
|
= |
t3
|
| t0
|
= |
f(f(x33)) |
|
→
|
f(x33) |
|
→
|
x33 |
|
= |
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.