Does Bitcoin Blockchain solves Byzantine General Problem? If bitcoin blockchain solves byzantine general problem, can you give an example of how it solves it?

Thanks
The Proof of Work algorithms is a probabilistic solution to the Byzantine General's problem in the case where traitorous generals represent strictly less than 50% of the generals.

To simplify, the main thing a solution to this problem has to guarantee is that all honest generals (honest miners) agree on the same thing. 

Let's assume there are 10 miners in the Bitcoin blockchain and a new transaction comes in. This transaction (noted tr1) is broadcasted among all miners. 10 of those miners are traitorous and they broadcast another transaction (noted tr2) where they changed the recipient in tr1.
Each miner will starts to solve a puzzle just after he received his first transaction message. Some will receive tr1 first, others will receive tr2 first.

The puzzle is difficult enough that, on average, a solution will be found every 10 minutes. After 10 minutes, miner M solves the proof of work problem. He broadcasts his solution to the 9 other miners and includes in there the transaction he received first. Upon receiving this solution, each miner adjusts his transaction to the new one received. They then all work on the next puzzle. After 1 hour, the chain has 6 blocks (6 puzzles solved). Each general can evaluate how much CPU was necessary to get solve 6 puzzles in 10 minutes. Each general knows then if the majority of the general contributed to building this chain. If the answer is yes, then they agreed on the transaction inside the initial block of this chain.

Now an interesting point: what if the transaction in the initially mined block is tr2? The solution described here doesn't prevent from agreeing on a false transaction. In the context of the Byzantine Generals problem, it is sufficient for the generals to agree on a false plan as long as they agree.