Mid-Tier

GPT-5.4

Scottish Fold

OpenAI · Mid-Tier

GeneralistLv.1textcodeclosed-weight

“Round, agreeable, suspiciously good with computers. The dependable house cat that quietly learned to open every app on your desktop while you weren't looking.”

gpt-5.4$2.5/M in · $15/M out

Stats

STR

Output quality — how good are the responses overall

DEX

Speed — tokens per second and latency

CON

Reliability — consistency across runs and tasks

INT

Reasoning — logic, math, and multi-step problems

WIS

Accuracy — factual correctness and precision

CHA

Creativity — style, voice, and creative expression

Abilities

Folded Ears

hears exactly what you asked for, nothing else

Desktop Walker

built-in computer use, 75% house-trained

Steady Paws

knocks a third fewer facts off the shelf

Eval Results

Best: 10.0Worst: 7.6

Reasoning

9.9/10(5 prompts)

Reasoning #1

A cat knocks 3 things off a table every hour. The owner puts 2 things back every hour. There are 12 things on the table. When does the table become empty?

high10.0

Judge: The response identifies the net rate of -1 per hour immediately and applies it to 12 items to reach 12 hours, the answer the rubric defines as correct. The reasoning is concise, clean, and clearly presented with a numeric answer. Matches the rubric's top descriptor for both correctness and reasoning quality.

The table loses a net of: • 3 things knocked off per hour • 2 things put back per hour • Net loss = 1 thing per hour Starting with 12 things, it takes 12 hours for the table to become empty. Answer: 12 hours

openai/gpt-5.4 · 2026-06-11

Reasoning #2

You have 8 identical-looking balls. One is slightly heavier than the rest. Using a balance scale, what is the minimum number of weighings needed to guarantee you find the heavy ball? Explain your strategy.

high10.0

Judge: States the correct answer of 2 weighings with a valid 3-3-2 strategy covering every branch of both weighings. It also gives the information-theoretic argument (3^2 = 9 >= 8) for why 2 suffices and why 1 weighing cannot. Complete, rigorous, and clearly laid out.

Minimum number of weighings: 2 Strategy Label the balls into three groups: • Group A: 3 balls • Group B: 3 balls • Group C: 2 balls First weighing: Weigh 3 balls vs 3 balls (Group A vs Group B). Case 1: The scale balances That means the heavy ball is not in those 6 balls, so it must be in Group...

openai/gpt-5.4 · 2026-06-11

Reasoning #3

A farmer needs to cross a river with a cat, a mouse, and a bag of catnip. The boat can carry the farmer and one item at a time. If left alone together: the cat will eat the mouse, and the cat will destroy the catnip (cats gonna cat). The mouse ignores the catnip. How does the farmer get everything across? Show all steps.

high9.4

Judge: I traced every step: the cat is never left alone with the mouse or the catnip (mouse+catnip together is explicitly safe), and all items end up across in the optimal 7 crossings. State tracking is shown for most steps but the solo-return steps and the final crossing omit the full who-is-where breakdown, so completeness falls just short of perfect. Otherwise a clean, correct solution with a helpful trip summary.

Here’s the safe sequence: 1. Take the cat across - Left behind: mouse + catnip - Safe, because the mouse ignores the catnip. 2. Farmer returns alone 3. Take the mouse across - Now on far side: cat + mouse - That’s dangerous, so don’t leave them together. 4. Bring the cat back...

openai/gpt-5.4 · 2026-06-11

Reasoning #4

In a round-robin tournament with 6 players, each player plays every other player exactly once. A win is worth 2 points, a draw is 1 point each, and a loss is 0 points. After the tournament: Player A has 10 points, Player B has 8 points, and Player C has 6 points. Players D, E, and F each have the same score. What score do D, E, and F each have? Show your reasoning.

high10.0

Judge: Correct answer of 2 points each, derived via the elegant invariant that 15 matches always distribute exactly 30 points: 30 - 24 = 6, split equally three ways. The math is shown step by step, satisfying the hard constraint, and the presentation is crisp. This is exactly the reasoning the rubric's top band describes.

There are $\binom{6}{2} = 15$ matches total. Each match gives out: • $2$ total points if someone wins • $2$ total points if it’s a draw ($1+1$) So every match contributes 2 points total, meaning the tournament gives out \[ 15 \times 2 = 30 \] total points. We are told: • A = 10 • B = ...

openai/gpt-5.4 · 2026-06-11

Reasoning #5

There are 100 closed lockers in a hallway. 100 cats walk by. The first cat toggles every locker. The second cat toggles every 2nd locker. The third cat toggles every 3rd locker. And so on — the nth cat toggles every nth locker. After all 100 cats have passed: (a) which lockers are open? (b) Why? Prove your answer mathematically.

high10.0

Judge: Correctly lists all 10 open lockers (perfect squares 1-100) and gives a rigorous proof: locker n is toggled once per divisor, divisors pair as (d, n/d) except when d^2 = n, so only perfect squares have an odd divisor count. Includes worked examples (12 and 36) that reinforce the argument. Both hard constraints are clearly met.

Answer: (a) Which lockers are open? The lockers that remain open are exactly the ones with numbers: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100 These are the perfect squares from $1^2$ to $10^2$. (b) Why? Mathematical proof Each locker starts closed. A locker is toggled once for every cat whose n...

openai/gpt-5.4 · 2026-06-11