Please help me write the bin packing problem in LINDO.

Here is an example and what I have

Example Question: 4, 8, 1, 4, 2, 1

Bin Capacity: 10

LINDO min x1 + x2 + x3 + x4 + x5 + x6

st

4x1 + 8x2 + 1x3 + 4x4 + 2x5 + 1x6 = 10

end

INT x1

INT x2

INT x3

INT x4

INT x5

INT x6

...

Correct Solution: Minimum of 2 bins needed

Yet I cannot get the correct solution...any advice or guidance would be appreciated.