Furthermore, as explained in section "??", in SI, the SP-query has non-deterministic influence in constructing the synthesis graph, which influences the number of combination graphs to enumerate, hence affecting the runtime of the SynGPS algorithm. We demonstrate this behaviour via specific examples in Figure S??, in SI. Namely, depending on the database configuration at hand, the same intermediate can have varying number of incoming edges. As a consequence, the SynGPS algorithm needs to enumerate different number of potential synthesis routes which translates to difference in processing time.