n-DNF boolean formula k satisfiability
Your problem can't be any easier than DNF-TAUTOLOGIES since that problem is produced by setting $k$ equal to $2^n$.  Therefore your problem is NP-hard, just as DNF-TAUTOLOGIES is.