12
Candidates
{"N": 2}
Ground Truth
{"N": 2}
Top-1 Prediction
1.000
Match Score
#1
TOP-1
1.00 ± 0.00
COC(=O)c1cc[n]2->[Ru+2]<-[n]3ccc(C(=O)OC)cc3-c2c1
#1
TOP-1
0.12 ± 0.24
COC(=O)c1cc[n]2->[Ru+2]34567(<-[cH]8[cH]->3[c]->4(C(C)C)[cH]->5[cH]->6[c]->78C)<-[n]3ccc(C(=O)OC)cc3...
#2
0.00 ± 0.00
COC(=O)c1ccnc(-c2cc(C(=O)OC)cc[n]2->[Ru+2])c1
#2
0.09 ± 0.10
COC(=O)c1cc[n]2->[Ru+2]3(<-[cH]4c(C)ccc(C(C)C)[cH]->34)<-[n]3ccc(C(=O)OC)cc3-c2c1
#3
0.00 ± 0.00
COC(=O)c1ccnc(-c2cc(C(OC)=[O]->[Ru+2])ccn2)c1
#3
0.00 ± 0.00
COC(=O)c1cc[n]2->[Ru+2](<-[cH]3cc(C)ccc3C(C)C)<-[n]3ccc(C(=O)OC)cc3-c2c1
#4
0.00 ± 0.00
COC1=[O]->[Ru+2]<-[O]=C(OC)c2ccnc(-c3cc1ccn3)c2
#4
0.00 ± 0.00
COC(=O)c1cc[n]2->[Ru+2](<-[cH]3cc(C(C)C)ccc3C)<-[n]3ccc(C(=O)OC)cc3-c2c1
#5
0.00 ± 0.00
COC1=[O]->[Ru+2]<-[O](C)C(=O)c2ccnc(-c3cc1ccn3)c2
#6
0.00 ± 0.00
COC(=O)c1ccnc(-c2cc(C(=O)[O](C)->[Ru+2])ccn2)c1
#7
0.00 ± 0.00
COC(=O)c1ccnc(-c2cc(C(=O)OC)[cH](->[Ru+2])cn2)c1
#8
0.00 ± 0.00
COC(=O)c1ccnc(-c2nccc(C(=O)OC)[cH]2->[Ru+2])c1