We applied our proposed AAM algorithm to a benchmark dataset of AAM. We found that the enumeration algorithm using Isingcomputing outperforms a conventional exact algorithm for the maximum clique problem in terms of computation time. Additionally, our algorithm successfully found the correct mappings in all reactions of the benchmark dataset. We also clarified in some reactions that the enumeration of multiple mappings is especially significant in covering correct mappings without any reaction rules. The benchmark results and discussion are detailed in Section 3.