The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable

In paper proved that it is impossible to build an algorithm that allows you to determine from an arbitrary finite task of the group whether it is solvable her positive theory. The specified group property is not Markov, so the fundamental Adyan-Rabin theorem does not apply to it.