Some initial results on the study of conformon-P systems with negative values are reported. One model of these conformon-P systems is proved to be computationally universal while another is proved to be at least as powerful as partially blind program machines.