Limiting the consecutive occurrence

[ntk]

for this problem aGia I would use the combinator. You got the half of your password in one file, the second file you can generate via mp64 or mp32. Combinate them, you still have 2billion combined possibilities, then feed it in to oclHashcat+

2billion you can be run in a few hours at speed of 100,000 c/s.

Of course you can filter them so cut down about 28%.

Thanks for opfer the calculation power. which country is it?