We demonstrate that deciding if two terms containing uninterpreted associative-commutative function symbols and commutative variable binding operators are equal is polynomially equivalent to determining if two graphs are isomorphic. The reductions we use provide insight into this result and suggest polynomial time special cases.