It has been recently proposed AspenPlus: an Answer Set Programming (ASP) encoding for LACE+, which is a novel declarative approach to Collective Entity Resolution in the classical relational database setting, capable of performing both global and local merges. Here, we report an experiment evaluating AspenPlus on the dataset Pokémon. Specifically, we describe an ASP specification, execute it on the dataset Pokémon, and report the running time, precision, and recall of the derived solutions made of merges of constants representing references to real-world entities (global merges) as well as merges of constants representing values (local merges).