Create a_equals_b.sql

This could be sped up by starting from graph1.db and going incrementally. At every step, if A=B at step i-1 but not at step i, then delete it from try_pairs. We only want to keep a match if A=B for all n. Incrementally deleting will decrease the number of rows, hopefully substantially for the larger n databases.