Can a Alphametic Solver be used in this case?

I am not as familiar with programming or scripting as a lot of people are here so I tend to use the Alphametic solver to solve my cryptarithmetic problems. For this question:
Q is finding pairs of two digit integers to multiply. The four digits which formed these two integers were all distinct. Q reversed the digits of both numbers and still obtained the correct product. What are all the pairs of integers.

AB*CD = EFGH
BA*DC = EFGH
Is what I have come up with but it does not seem to give me the solution.

If anyone has suggestions it would be appreciated.
Thanks.
.