Shortening codes

This is a regex golf problem. You have to write a regex that matches all lines from one list and none from the second one. Matching is implemented as Perl's m//, so it's not a precise match. E.g. to match "SPOJ" you don't need regex /^SPOJ$/ since it's enough to write /PO/ or /J/.

The regexes submitted should be compatible with Perl regular expressions (version 5.20.1).

Score is calculated as follows: it's equal to the length of your regex and for every line from the first list that's not matched by your regex X points are added to your score. Analogically, for every line from the second list that's matched by your regex X points are added to your score. The lower your score is, the better. X often equals 10 but it's different in some problems. Check below this problem's X value.

To quickly check the quality of your solution visit the original regex golf project.

Please don't look for solutions for this problem online or at least don't post them here if you didn't come up with them on your own.

Match all of these...

• bcow cbwo owbc wocb
• bytz ztby tzyb ybzt
• cuoh uhco ochu houc
• erad dare ader reda
• fbtp ptfb tpbf bfpt
• feqp efpq qpef pqfe
• gezw zwge wzeg egwz
• gkih hgki ihgk kihg
• hzdi dhiz idzh zihd
• ivpc vpci pciv civp
• jwok okjw kowj wjko
• kxrh rhkx hrxk xkhr
• ncib cnbi ibnc bicn
• rick kcir ckri irkc
• tqec qtce ecqt cetq
• vpth thpv htvp pvht
• whrl lwhr rlwh hrlw
• xiey ixye eyxi yeix
• zdvm vmzd dzmv mvdz
• znqp qpzn pznq nqpz

And none of these...

• asuw qome zfdr xivi
• bgmn kcjk xhrk axon
• brlm kytb bdad khtb
• ctio ersg xmak bynf
• dgpz ksaq tbem owxu
• fdue qcpp ypze hbue
• gjzp jwgb wiej eojz
• gxih hgkx ihck kihc
• hedi dhih ideh zhhd
• ivps vlci pcis clvp
• jwwk okjw kooj wjko
• kxrh rhsx hrxs xkhr
• nqib qnbi ibnc bicn
• rikc kcir ckri irkc
• tcqe qtce eqct cetq
• vhpt thpv htvp pvht
• wrrl lwhr rlwh hrlw
• xiey ixye eyxi yejx
• zdvm mvzd dzmv mvdz
• znqp qpzn pznq npqz

X = 10

The author of this problem is teukon.