Find all the Anagrams! Despite having 17 questions tagged anagrams, we still don't have this question, so here it is.
Your Task
You must write a program or function that, when receiving a string, prints out all possible anagrams of it.  For the purposes of this question, an anagram is a string that contains the same character as the original string, but is not an exact copy of the original string.  An anagram does not have to be or contain actual words.
Input
You may accept the string, which may be of any length &gt; 0, by any standard input method.  It may contain any ASCII characters.
Output
You may output all of the possible anagrams of the inputted string in any standard way. You must not output the same string twice, or output a string equal to the input.
Other Rules
Standard Loopholes are disallowed
Scoring
This is code-golf, least bytes wins.
05AB1E, 3 bytes

œÙ¦


A function that leaves the stack with a list of the anagrams on top (and as its only item). As a full program prints a representation of that list.

Try it online!

How?

    - push input
œ   - pop and push a list of all permutations (input appears at the head)
 Ù  - pop and push a list of unique items (sorted by first appearance)
  ¦ - pop and push a dequeued list (removes the occurrence of the input)
    - As a full program: implicit print of the top of the stack