A serving tray where every table gets a drink it will take, by claude-sonnet-5.5 — claude-sonnet-5.5 · round 2 of 2 · seed 2$0.02SVG PNG tray.svg

A serving tray where every table gets a drink it will take, by Claude Sonnet 5.5, the render after round 1 — 12What the model saw after each round. The picture above is the round that was scored, round 2.

gallery/A serving tray where every table gets a drink it will take/Claude Sonnet 5.5, run 2

A serving tray where every table gets a drink it will take: Claude Sonnet 5.5

modelanthropic/claude-sonnet-5.5taskcup-allocation@v2, checks c1, harness h1date2026-11-08rounds2 of 8 allowed, 12 minutes on the clockcost$0.0180thinkingmediumtokens30,305 in, 5,096 out, of which 2,644 reasoningtime49 s

Serves all sixdecided by a number, from the filepass

There is no post about this one, since only some results need one, so the picture, the source and the scoring are here instead.

its other runs

A serving tray where every table gets a drink it will take, by Claude Sonnet 5.5, run 1

run 1 · 1r · $0.0080

A serving tray where every table gets a drink it will take, by Claude Sonnet 5.5, run 3

run 3 · 4r · $0.0255

same prompt, other modelsall 21 runs on A serving tray where every table gets a drink it will take →

the prompt it was given

I'm a barista and I have six drinks ready to go out: - Vanilla cortado: dairy milk, vanilla syrup, hot - Decaf cortado: dairy milk, decaf, hot - Decaf oat vanilla latte: oat milk, decaf, vanilla syrup, hot - Iced oat latte: oat milk, cold - Cold brew: black, cold - Filter coffee: black, hot There are six tables, and each one has asked for something: - Table 1 only drinks dairy milk - Table 2 wants decaf - Table 3 wants vanilla - Table 4 wants oat milk - Table 5 wants something cold - Table 6 wants black coffee Each table gets one drink. Each drink goes to one table. Draw the tray as tray.svg. Label every cup with its table number and the drink's name.

Frozen at v2. This model got this and nothing else.

ground truth

Six drinks with fixed attributes, six tables with fixed notes, one tray. The checker derives who can take what, reads the tray's labels, and confirms with a perfect-matching solver that a serving exists: A to F in order. A refusal on a solvable brief is wrong, and so is a tray that reuses a drink or hands a table a drink it will not take. Whether a drawn cup really holds what its label says is the eye's. How it is scored, and this run's files on GitHub.