Complete diagnostic length $2$ tests for logic networks under inverse faults of logic gates

It is proved that any Boolean function can be implemented by a logic network in the basis $\{x\,\&\,y\,\&\,z,x\oplus y,1\}$ in such a way that this logic network admits a complete diagnostic test of length at most $2$ with respect to inverse faults at the outputs of logic gates.