A and U have the same nullspace. Elimination brings us to U
A⟹10011−112−213−3⟹100110120130=U
We identify our pivot columns and our free columns. The pivot columns, x1, and x2 contain our pivots. The other columns, x3 and x4, are free. Now we have two choices: back substitution, and solving by row reduced echelon form.
However, it is quicker to "complete" elimination, and find the solution from rref. A, U, and R have the same nullspace. Our example matrix, A, is very close to rref already (the pivots are already 1).
100110120130⟹100010−120−230
Notice how if we set x3=1 and x4=0 we can read the values x1 and x2 from the third column (if we reverse the sign).
A1−210=0
You cannot do back substitution on a matrix in rref. This yields incorrect results.