Software evolution process model (EPM) is created in terms of a formal evolution process meta-model (EPMM) and semi-formal approach to modeling based on EPMM . In order to better manage and control the software evolution process and make the best of existing software technology, the method to transform any EPM to its execution model based logic programming has been proposed. Completeness of conversion depends on completeness of the rules, that is, all the expressions of the original model are found the correspondence in the target model. Since transformation rules are proposed based on precondition or post-condition types of activities in anyone EPM, this need to prove that activity type set in anyone EPM is completeness set. To this end, the precondition and post-condition of activities in EPM are classified based on analyzing all expressions in EPMs and the semantics of the activity execution. Type completeness set of activity’s precondition and its post-condition is presented. Lastly we prove that the activity type set in anyone EPM is completeness set by mathematical induction.