*Puzzle by Raymond Smullyan*)

There is a safe containing millions of dollars – unfortunately the combination is written on only one card, and that card has been accidentally locked inside the safe! If the wrong combination is used, the lock will jam and the only way to open the safe would be to blow it up, destroying the contents.

A combination is a string of digits from 0 through 9. It can be any length and contain any number of digits occurring any number of times; 90915 is a combination; so is 2133127; so is 5. Certain combinations will open the lock, certain combinations will jam the lock, and the remaining combinations will have no effect whatever (these last are called neutral).

The small letters x and y will represent arbitrary combinations, and by xy is meant the combination x followed by the combination y; for example, if x is 213 and y is 3812, then xy is 2133812. By the reverse of a combination is meant the combination written backwards; for example, the reverse of 3812 is 2183. By the repeat xx of a combination x is meant the combination followed by itself; for example, the repeat of 3182 is 31823182.

Now, some of the combinations are related to other combinations. There are five properties of this relation:

Find the shortest possible combination that will open the lock.

*
Notes/Clues:
a) The relation is only one way. Think of it like mother and son. The mother is the parent of the son, but the son is not the parent of the mother.
b) The first thing you need to do is to establish (just using property E) how to solve the puzzle (i.e. how do you know if a combination opens the lock?). Then use this information to solve the puzzle using properties A thru D.*