I am seeing some strange behaviors from

*'[TMPL]/Library/Rochester/instructiveProblems/NewProblems/Sets_2N.pg*

In this problem, three sets A, B, and C are given, and we have to find the intersection A \cap B, the union A \cup B, and another set (B \cup C) \cap A.

The intersection A \cap B is fine, but the solutions for the other sets sets are wonky. For A \cup B, the correct answer has 5 elements, but if your response has just 5 elements, the message says there should be more numbers in the set. If you give 6 elements with repeats, exactly as the "Correct" answer does, then the message says there should be no repeated elements. The same issue happens with (B \cup C) \cap A.

See the screen snip at http://faculty.msmc.edu/daven/images/ww090214.png -- I was acting as a student to recreate the issue.

Thanks for your help!