I already asked a similar question, but I recently began a course of Logic and it gave me not an answeat but a refination of my question, which I redefine here.
My thinking is the following:
Suppose we have a limited set of $n$ symbols {$\forall$, $\neg$, ...} and some statements {$P$, $Q$, ..., $Z$} made with the symbols and assumed True, therefore Axioms.
Now suppose that we want to prove a statement $A$, that means, we want to start at the Axioms and arrive at $A$ using only a logic combination of our symbols.
My question is: why not set a computer to try every possible path?
To clarify, we want something like $P \land Q \land \text{...} \land Z \to \text{(?)} \to A$, so my question is: why not set a computer to change the $(?)$ to one of each of the $n$ symbols from {$\forall$, $\neg$, ...}, then if it doesn't work go for two symbols, then for three.
It is curious because as I am writing this, I realized that the Time Complexity of this proccess would be indeed complex. However, I stand my question, because for example if the problem is an important one like the Goldbach Conjecture, why not set a lot of computers to optimize the proccess, and if we will inevitably do it someday why not do it already, as we need to start sometime? Speaking of that, one thing I would also like to know is if Quantum Computing would help this cause I proposed, making Math just a matter of combinatorical computer trial and error.
My questioning is somewhat vague, but any glimpsy of why Math proofs can't work like that would be of great value.