Complete diagnostic tests of the length two for logic networks under inverse faults of logic gates

It is proved that one can implement any Boolean function by a logic network in the basis $\{x\& y\& z, x\oplus y, 1\}$, allowing a complete diagnostic test with a length not exceeding $2$ regarding inverse faults on outputs of logic gates.