AST node for solveSystem(equations, v1, v2, ...) in the grammar.
equations is expected to be a _Matrix whose elements are _Equation nodes -- e.g. [[2*x + y = 5, x + 3*y = 10]]. After the REPL substitutes any named matrix binding, eval extracts the equations and delegates to solveSystem.
The solve variables are binders (excluded from children / substitute traversal), exactly as in _Derivative and _Integral -- solving for x does not substitute x itself.
The equations may outnumber the unknowns (F_0242): a consistent system is solved, and declineReason says why any other stays unevaluated.
Why the system is left unevaluated, or None when it is solved (F_0242): fewer equations than unknowns, not linear, no unique solution, inconsistent (naming the equation), or over-determined with symbolic coefficients. Read by the REPL's decline note.
Why the system is left unevaluated, or None when it is solved (F_0242): fewer equations than unknowns, not linear, no unique solution, inconsistent (naming the equation), or over-determined with symbolic coefficients. Read by the REPL's decline note.