Narrowing brute force

[chararray]

I'm using hashcat against a bcrypt hash. With the method i'm using this will take years on my 3070 but I see a way to massively reduce this time I just don't know how to do it. I'm running: 

hashcat.exe -m 3200 -a 3 -o cracked.txt hash.txt -w 4 -1 ?u?l -2 ?l?u! ` ?1?l?l?l?2?2 --increment --increment-min 6 --increment-max 6 ` ?1?1?l?l?l?2?2 --increment --increment-min 7 --increment-max 7 ` ?1?l?l?l?l?2?2?2 --increment --increment-min 8 --increment-max 8 ` ?1?l?l?l?l?l?2?2?2  --increment --increment-min 9 --increment-max 9 ` ?1?l?l?l?l?l?2?2?2?2 --increment --increment-min 10 --increment-max 10 ` ?1?l?l?l?l?l?l?2?2?2?2 --increment-min 11 --increment-max 11 ` ?1?l?l?l?l?l?l?l?2?2?2?2 --increment --increment-min 12 --increment-max 12

But I know that it has to include at least one uppercase, one number, and one special character (most likely !). How can I restrict attempts that make up the bulk of my attack that look like "kfpevin". I obviously don't know the exact positions but it seems intuitive that there'd be a way to block attempts that don't fill a criteria. Otherwise will I have to make a script to do this myself? 

Any other tips for dehashing a bcrypt is helpful. I get about 1500-1600 H/s.