No.
Okay, let's suppose it were that simple. (It isn't.)
How many possible failures are there? Let's suppose we could identify every single one of those possible failures. Let's suppose there are only 50 things that could fail (instead of 50 million). Some failures cause other failures. To predict where everything lands, we'll have to calculate probabilities for each ordering of the failures within each subset.
There are 2^50 = 1125899906842624 subsets of those 50 failures. The number of possible orders for the largest of those subsets is
Code:
50! = 30414093201713378043612608166064768844377641568960512000000000000
That's 3 times 10 to the 64th power.
Let's suppose we could design incredibly fast special-purpose hardware that, for each ordering of those 50 failures, could calculate where everything lands in just 1 nanosecond. With that ridiculously fast hardware, under these ridiculously over-simplified assumptions, the number of years it would take to calculate where everything lands would still be more than 10 to the 48th power. That's about 10 to the 38th power times the number of years that have elapsed since the Big Bang.
Clayton Moore says it's a snap.