Shortest Uniquely Identifying Substrings Given a list of strings, replace each string by one of its non-empty substrings which is not a substring of any of the other strings in the list and as short as possible.
Example
Given the list [&quot;hello&quot;,&quot;hallo&quot;,&quot;hola&quot;], &quot;hello&quot; should be replaced by just &quot;e&quot; as this substring is not contained in &quot;hallo&quot; and &quot;hola&quot; and it is as short as possible. &quot;hallo&quot; could be replaced by either &quot;ha&quot; or &quot;al&quot; and &quot;hola&quot; by any of &quot;ho&quot;, &quot;ol&quot; or &quot;la&quot;.
Rules

You can assume that the strings will be non-empty and only contain alphabetical characters of the same case.
You can assume that such a substring exists for each string in the list, i.e. no string in the list will be a substring of any of the other strings.
Input and output can be in any reasonable format.
This is code-golf, so try to use as few bytes as possible in the language of your choice.

Test Cases
Only one possible output is given for most cases.
[&quot;ppcg&quot;] -&gt; [&quot;p&quot;] (or [&quot;c&quot;] or [&quot;g&quot;])
[&quot;hello&quot;,&quot;hallo&quot;,&quot;hola&quot;] -&gt; [&quot;e&quot;,&quot;ha&quot;,&quot;ho&quot;]
[&quot;abc&quot;,&quot;bca&quot;,&quot;bac&quot;] -&gt; [&quot;ab&quot;,&quot;ca&quot;,&quot;ba&quot;]
[&quot;abc&quot;,&quot;abd&quot;,&quot;dbc&quot;] -&gt; [&quot;abc&quot;,&quot;bd&quot;,&quot;db&quot;]
[&quot;lorem&quot;,&quot;ipsum&quot;,&quot;dolor&quot;,&quot;sit&quot;,&quot;amet&quot;] -&gt; [&quot;re&quot;,&quot;p&quot;,&quot;d&quot;,&quot;si&quot;,&quot;a&quot;]
[&quot;abc&quot;,&quot;acb&quot;,&quot;bac&quot;,&quot;bca&quot;,&quot;cab&quot;,&quot;cba&quot;] -&gt; [&quot;abc&quot;,&quot;acb&quot;,&quot;bac&quot;,&quot;bca&quot;,&quot;cab&quot;,&quot;cba&quot;]


Related: Shortest Identifying Substring - similar idea, but more involved rules and cumbersome format.
Jelly, &nbsp;12&nbsp; 9 bytes

Ẇ€ŒpẇþÞ⁸Ḣ


Try it online! Or see the test-suite (takes ~35s)