I want to make a list of all combinations.

There is a text file with 10,000 words (one new line at a time) consisting of five alphabetic characters.
Find out how many 5-character words are in the text file that can be created by rearranging the characters in the given n-character (5<=n) alphabet.
並び When sorting, all of the n characters given can only be used once.
意味 Some words have no meaning.Please take it as just a list of characters.
*No import

Assume that the string 'caarto' is given.
There are 720 permutations (in permutations) of these 6 to 5 characters.Of these 720 combinations, answer how many words appear in the text file.

First of all, I would like to make a correct list of 720 combinations, but the current code only shows 240 combinations.However, if you change the assumed string to 'cabrto' by one character and eliminate the duplication of 'a', 720 characters will be displayed correctly.I think the reason for this is that I can't distinguish the two 'a's well.
When I tried looking for a permutation to choose two characters from 'caarto' with the same code, I found that there were only 28 permutations, though it should have been 30 permutations correctly.

Now that I understand it, I'm stuck thinking about how to keep 'caarto' and display 720 different things.Please let me know.

Both python and jupyternotebook are the latest versions.