In this paper, the authors discuss the first-order disunification and the algorithm for computing the complete set of disunifiers. There are many methods for solving unification problem, the method by using translation rules has been thoroughly studied. Many translation rules are also given out in the study of disunification problem. By using translation rules, people usually get some solved forms for the problem. In this paper, the authors are concerted with the method for giving out the complete set of disunifiers based on solved forms. The method becomes more convenient and direct by using functions G_θand Z.