Solving the majority of linear logical equations of inconsistent system on supercomputer

Overdefined systems of linear logical equations are considered, the number of equations in which surpasses the number of variables. As a rule, such a system has no root and therefore is called inconsistent. Anyhow, these systems can be solved in some sense. For example, from the cryptography point of view, it is interesting to find solutions satisfying the maximum number of equations or, if the right parts are distorted, to restore the system. The parallel implementation of a randomized algorithm is suggested for solving inconsistent systems on the supercomputer SKIF. The results of experiments testify the efficiency of parallel computations when solving large systems of linear logical equations.