Certification Problem
Input (COPS 1077)
We consider two TRSs R and S where R contains the rules
| c |
→ |
f(c) |
(1) |
| c |
→ |
c |
(2) |
|
f(a) |
→ |
b |
(3) |
| a |
→ |
c |
(4) |
and S contains the following rules:
| a |
→ |
f(c) |
(5) |
| a |
→ |
f(h(c)) |
(6) |
|
f(x) |
→ |
h(f(x)) |
(7) |
The underlying signature is as follows:
{a/0, b/0, c/0, f/1, h/1}Property / Task
Prove or disprove commutation.Answer / Result
No.Proof (by ACP @ CoCo 2023)
1 Non-Joinable Fork
The systems are not commuting due to the following forking derivations.
| t0
|
= |
f(a) |
|
→S
|
f(f(h(c))) |
|
= |
s1
|
and
There is no possibility to join
s1→R*·←S*
t1
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.