IV-matching is strongly NP-hard

In this note, we resolve the question and prove that, contrary to the expectations of the authors, the given problem is strongly NP-hard (already in the simplest non-trivial case of three layers). Hence it is unlikely that there would be an efficient (polynomial or pseudo-polynomial in case of at least four layers) algorithm solving the problem.