Python function: building an array from a set of non-entirely matching subarrays.

Hi, I need a Python function (will be part of a mastermind-like game):
the function has to build an unique array of integers Y -shape (10,)- given a sub-array list.
Y's items range is 1 to 20.
Each subarray can be of variable length (from two to nine elements): shape (n,) , item range 1 to 20.
Each item of each subarray may or may not not belong to Y (quantity and position are unknown, but generally most of the elements of each subarray are part of Y).
The task is finding Y (if possible) taking into account all or part of the various subarrays as a function of the unic 'implicit logic' (10 and no more than 10 values present in the subarrays belong to Y).

The function code must be properly commented in a sample Python module resolving the provided samples (uploaded in a txt file).

Given the logic nature of the task, prolog could be also used. In case, PySWIP must be used to connect the function to the sample python module. Prolog code must also be accurately commentend.

Many thanks in advance!
Giordano