A t-set is a combination of several values and their positions
in the sequence. We denote the positions and the values separately.

A t-set is represented as follow:
<pos 1> <pos 2> ... <pos n> | <value 1> <value 2> ... <value n>
The positions and the values are separated by a single vertical bar "|".

For example,
0 3 4 7 | 3 4 2 1
means positions 0, 3, 4 and 7 have values 3, 4, 2 and 1 respectively.

Notice that the positions are always in ascending order, and the number
of positions and the number of values are always the same.

In the file for the infeasible t-sets, the first line is the number k of
the infeasible t-sets, and the following k lines contain the infeasible
t-sets.