On the reliability of non-branching programs in a basis containing a function of the form $x_1^{\alpha_1} \vee x_2^{\alpha_2}$

The problem of synthesis of nobranching programs with conditional stop-operator is considered in full finite basis, contained some kind function $x_1^{\alpha_1} \vee x_2^{\alpha_2}$, $\alpha_1, \alpha_2 \in \{0,1\}$. All functional operators are supposed to be prone output inverse failures with probability $\epsilon$ ($\epsilon \in (0,1/2)$). Conditional stop-operators are absolutely reliable. Any boolean function is proved to be possible to realize by nobranching program, functioned with unreliability no more $\epsilon+81\epsilon^2$ at $\epsilon \in (0,1/960]$.