It is known that LPF instances can be decided in polynomial time, including
the computation of a solution instance in the positive case (see [1]},
[2]}). The following corollary allows us to view the task of checking whether
the tuple \(F\)  is \(Z\) -separating as an LPF instance.
