The problem you are trying to solve is vastly more complicated than that, but it is solvable using computers and an iterative process.

The solution to this problem is shown in Mathematics of Poker, starting page 123 with [0,1] toy games and progressing to show how to solve the no limit hold'em problem with an iterative algorithm and computers. The [0,1] toy games are easy to solve on paper and give you a very good idea of the process involved. If you care you can read that part of Maths of Poker, and report here if you have problems with the math.

This solution has been implemented in software such as SNG Wizard. You can download a free trial version of it (and there are also "workarounds" to the trial version expiry).

However, the demonstration in Mathematics of Poker and implementation in SNG wizard consider the problem when the starting range of each player is "any 2 cards". This is not the case in your 5bet problem, because both players already have non random ranges. However the exact same methodology could be used to solve your 5bet problem, provided you assign decently accurate starting ranges to both players.