Mask/Charset - Try 1 More Character?

[DanielG]

It's binary counting where 0 = ?? and 1 = ?1 whereby avoiding 11111 (which you already brute-forced) and 00000 (5 question marks). This means there are only (2^5 - 2 =) 30 lines.

Here are those 30 lines:

Code:

?l?u?d!@,?????????1
?l?u?d!@,???????1??
?l?u?d!@,???????1?1
?l?u?d!@,?????1????
?l?u?d!@,?????1???1
?l?u?d!@,?????1?1??
?l?u?d!@,?????1?1?1
?l?u?d!@,???1??????
?l?u?d!@,???1?????1
?l?u?d!@,???1???1??
?l?u?d!@,???1???1?1
?l?u?d!@,???1?1????
?l?u?d!@,???1?1???1
?l?u?d!@,???1?1?1??
?l?u?d!@,???1?1?1?1
?l?u?d!@,?1????????
?l?u?d!@,?1???????1
?l?u?d!@,?1?????1??
?l?u?d!@,?1?????1?1
?l?u?d!@,?1???1????
?l?u?d!@,?1???1???1
?l?u?d!@,?1???1?1??
?l?u?d!@,?1???1?1?1
?l?u?d!@,?1?1??????
?l?u?d!@,?1?1?????1
?l?u?d!@,?1?1???1??
?l?u?d!@,?1?1???1?1
?l?u?d!@,?1?1?1????
?l?u?d!@,?1?1?1???1
?l?u?d!@,?1?1?1?1??