Comparing DF with cut-off five and RPDF with cut-off five, we find that the RPDF algorithm finds a reasonable large subset of the overall possible paths screened by the DF search in noticeable shorter CPU times. The CPU times show a decrease of two orders of magnitude and are comparable with the DF search with cut-off four. Considering RPDF search with cutoff six, we examine that we can now cover more pathway alternatives than with the DF search with cut-off five with the same magnitude of CPU time as before. Figure illustrates these relationships. In order to enhance readability of Figure we use the Reaxys identification number for screened end products. Chemical names of the species can be found in the figures caption.