What a fascinatingly bizarre little program. It's like some kind of immutable-data assembly language with tortured syntax. The next level of Brainfuck.
Not sure where you get those weird infinity results from, but the "a = b = c = 0" solution is easily show:
Note that "a + b = c" implies "b = c - a", and given our assumption that "a = b = c", we can rewrite as "a = a - a = 0". This obviously results in "a = b = c = 0".
EDIT: Modifying the proof above, it becomes apparent that this is a property of groups (most number systems are groups): Again "a + b = c", iff "a + a = a" iff "a + a + (-a) = a + (-a)" which is "a = e".
Note that addition over IEEE754 floats do not constitute a group, (in part) because "inf + inf == inf" evaluates to true.
[1] https://regex101.com/r/8e2iU1/2
---
Edit: Found a newer article [2] which does point a working regex101 link [3]
[2] http://www.drregex.com/2018/11/how-to-match-b-c-where-abc-be...
[3] https://regex101.com/r/QsFZ5M/2