Let CNF H1 = {| is a satisfiable cnf-formula where each clause contains any number of

Let CNF_H1 = {〈ϕ〉| ϕ is a satisfiable cnf-formula where each clause contains any number of positive literals and at most one negated literal. Furthermore, each negated literal has at most one occurrence in ϕ}. Show that CNF_H1 is NLϕ complete.