When opening
cg_sort.log with the AP and filtering out all descendants of node i12, we can see in the screenshot below, that the equality node f(i) = f(inc(inc(inc(i)))) blames three nodes, namely f(i) = f(inc(i)), f(inc(i)) = f(inc(inc(i))), and f(inc(inc(i))) = f(inc(inc(inc(i)))), so it does not correctly compute the "shortest path" in the e-graph.
When opening cg_sort.log with the AP and filtering out all descendants of node i12, we can see in the screenshot below, that the equality node f(i) = f(inc(inc(inc(i)))) blames three nodes, namely f(i) = f(inc(i)), f(inc(i)) = f(inc(inc(i))), and f(inc(inc(i))) = f(inc(inc(inc(i)))), so it does not correctly compute the "shortest path" in the e-graph.