Abstract: Based on the property of the disjointed cubes that the logic operators OR and EXOR can replace each other, an algorithm of two level Mixed-Polarity Reed-Muller (MPRM) optimization is proposed. In the algorithm, by searching and decomposing the majority cubes of these disjointed cubes and replacing them with more compacted and less cubes, a minimized MPRM function is obtained. Further, an efficient approach for logic verification based on logic covers is also presented to check whether two functions are equal or not after logic minimization. The proposed algorithm is implemented in C and tested on MCNC benchmarks. Experimental results show that the proposed method can offer a compacted MPRM expression efficiently in contrast to the reported methods.