## Step 1: Define the symbolic representation of the problem

Let's define the symbolic variables:
- $x_1$ represents the number of first-class seats
- $x_2$ represents the number of regular seats

The objective function is to maximize profit: $1200x_1 + 700x_2$

## Step 2: Define the constraints

The constraints based on the problem description are:
1. Total seats: $x_1 + x_2 \leq 300$
2. Minimum first-class seats: $x_1 \geq 50$
3. Preference for regular seats over first-class seats: $x_2 \geq 3x_1$
4. Non-negativity constraints: $x_1 \geq 0, x_2 \geq 0$

However, since $x_1$ and $x_2$ represent the number of seats, the non-negativity constraints are implicitly satisfied by the minimum first-class seats constraint and the context of the problem.

## 3: Write down the symbolic representation

```json
{
'sym_variables': [('x1', 'first-class seats'), ('x2', 'regular seats')],
'objective_function': '1200*x1 + 700*x2',
'constraints': [
    'x1 + x2 <= 300',
    'x1 >= 50',
    'x2 >= 3*x1'
]
}
```

## 4: Convert the problem into Gurobi code

```python
import gurobi

def solve_train_seating_problem():
    # Create a new model
    model = gurobi.Model()

    # Define the variables
    x1 = model.addVar(name="first_class_seats", lb=0, vtype=gurobi.GRB.INTEGER)
    x2 = model.addVar(name="regular_seats", lb=0, vtype=gurobi.GRB.INTEGER)

    # Objective function: maximize profit
    model.setObjective(1200 * x1 + 700 * x2, gurobi.GRB.MAXIMIZE)

    # Constraints
    model.addConstr(x1 + x2 <= 300, name="total_seats")
    model.addConstr(x1 >= 50, name="min_first_class")
    model.addConstr(x2 >= 3 * x1, name="regular_preference")

    # Solve the model
    model.optimize()

    # Check if the model is optimized
    if model.status == gurobi.GRB.OPTIMAL:
        print(f"Optimal solution: First-class seats = {x1.varValue}, Regular seats = {x2.varValue}")
        print(f"Maximum profit: ${1200 * x1.varValue + 700 * x2.varValue}")
    else:
        print("The model is infeasible.")

solve_train_seating_problem()
```