Recently, many methods have been developed for representing knowledge, reasoning, and result extraction extracting results based on the respective domain knowledge in question. Despite the ontological success in knowledge representation, the reasoning method has faces some challenges. The main challenge in ontology reasoning methods is the failure in solving realization problems in the reasoning process. Apart from the complexity of solving realization problems, this already daunting challenge is compounded by computational complexity the time complexity of the solving realization problem solving process problems is equal to that of NEXP TIME. This important issue problem is achieved solved by solving the subsumption and satisfiability problems. Thus, to solve the realization problem, we first partition the ontology or extract partitions related to the query. Then, the satisfiability problem is solved by extracting partitions, and all concepts related to the query are extracted. This study proposes a method to overcome this problem, where a new solution is proposed with an appropriate time position. Finally, the efficiency of the proposed method, is evaluated against other reasoning engines, and the results show optimized performance vis-a-vis previous studies.