Challenge
=========

Given two lists of strings where each string is of length 50 and each list is also of length 50 generate the shortest regex you can that fully matches all the strings in the first list and does not match any of the strings in the second list.

Scoring
=======

Your score will be the average length of the regexes your program outputs when applied to this file: <https://pastebin.com/MvwPbH1G>

In this file the lists are separated by a single newline and the pairs of lists by two newlines. Apply your program to each pair twice with once with the first list as the strings to match and once with the second list as the strings to match.

Rules
=====

* We will use Javascript flavor regexes for simplicity.