| Rank | Model | Score |
|---|---|---|
| 1 | grok-4-5 | 0.505 |
| 2 | claude-sonnet-5 | 0.497 |
| 3 | claude-opus-4-8 | 0.492 |
| 4 | claude-fable-5 | 0.487 |
| 5 | gpt-5-6 | 0.451 |
| 6 | gpt-5-5 | 0.445 |
| 7 | minimax-m3 | 0.385 |
| 8 | claude-sonnet-4-6 | 0.373 |
| 9 | kimi-k2-7-code | 0.367 |
| 10 | glm-5-2 | 0.316 |
| 11 | qwen3-6-plus | 0.313 |
| 12 | deepseek-v4-pro | 0.307 |
| 13 | qwen3-7-max | 0.296 |
| 14 | hy3 | 0.288 |
| 15 | seed-2-1-pro | 0.286 |
| 16 | gemini-3-1-pro | 0.279 |
| 17 | gpt-5-4 | 0.272 |
| 18 | glm-5-1 | 0.267 |
| 19 | kimi-k2-6 | 0.255 |
| 20 | gpt-5-3-codex | 0.203 |
| 21 | grok-4-20 | 0.08 |
1 phaseActive
Agent benchmark with 46 hard, multi-hour terminal tasks and continuous partial-credit grading across 9 categories. Best model scores 0.505 mean reward.
Quick answer: Long-Horizon Terminal-Bench (LHTB) is an agent benchmark from Lehigh University and Tencent that drops a model into a Docker container with a goal requiring hundreds of dependent terminal actions — then grades the outcome with a hidden, fake-proof verifier using continuous partial credit. Across 46 tasks and 18 frontier models, the best result (Grok 4.5) is only 0.505 mean reward, and 29 of 46 tasks have never been fully solved by any model.
What it tests: Whether an AI agent can sustain coherent multi-step work inside a live terminal environment over a 90-minute budget — carrying state across hundreds of actions, recovering from dead ends, and knowing when a complex goal is actually complete.
Why it matters: Most agent benchmarks end within minutes; LHTB targets the regime where long-horizon state management and sustained reasoning are the limiting factor, not baseline task knowledge. It reveals a failure mode — losing the thread — that short benchmarks structurally cannot expose.
Known limitations: All baseline runs use the identical Terminus-2 harness, so scores reflect a specific scaffold rather than the model's raw capability. Evaluation cost is high ($2.50–$73 per task), limiting the number of providers who can submit fresh runs.
LHTB is built around three design axes that run through every task. First, each task demands a long horizon: solutions require hundreds of dependent actions and sustained state — a single task averages 69–93 minutes of wall-clock time and roughly 120–320 agent steps. Second, the benchmark actively resists shortcutting: a hidden verifier replays the agent's evidence using deterministic seeds and held-out answer keys so that claimed progress never counts — only replayed work does. Third, scoring uses a continuous graded reward rather than binary pass/fail. On tasks where nearly every frontier model scores zero under a strict threshold, partial credit is what keeps the ranking informative.
The 46 tasks span nine categories: software & reverse engineering, scientific computing, earth/climate & energy, multimodal & imaging, research reproduction, systems & security, professional (APEX) workflows, interactive games, and logic & constraint puzzles. Every task follows the same contract: a Docker container, an instruction file, a live environment, and a hidden test suite that grades the outcome. A task counts as solved at reward ≥ 0.95.
All baseline evaluations run under the Terminus-2 harness with a fixed 90-minute budget per task. The harness uses a JSON action parser, proactive context summarisation, and full terminal-session recording. No model-specific tools or bespoke agents are allowed; each model differs only in the API endpoint behind a single identical harness. A model that times out retains whatever partial credit the verifier can replay at the deadline.
| Field | Value |
|---|---|
| Task category | Agent / long-horizon terminal |
| Metric | Mean reward (0–1), solved at reward ≥ 0.95 |
| Number of tasks | 46 |
| Categories | 9 |
| Budget per task | 90 minutes |
| Avg. steps per run | ~120–320 agent actions |
| Harness | Terminus-2 (identical for all models) |
| Saturation | Low (best model: 0.505) |
| Created by | Zongxia Li et al. (Lehigh University / Tencent) |
| Paper | arXiv:2607.08964 |
| Dataset | HuggingFace — IntelligenceLab/Long-Horizon-Terminal-Bench |
Each task yields a reward in the continuous range [0, 1]. Banded or proportional partial credit is awarded per task by a hidden verifier that replays the agent's evidence using seeded environments and held-out answer keys. A reward of exactly 0 means no verifiable progress at all; a reward ≥ 0.95 counts as a full solve. The headline metric is mean reward averaged over all 46 tasks. A secondary metric — solve count — reports how many tasks crossed the 0.95 threshold; this is a sparser, harder signal.
Partial credit matters because on tasks of this difficulty, binary scoring compresses nearly every model to zero. In the published runs, 7% of all 782 model-task pairs crossed the solve threshold; under strict pass/fail, the other 93% would be indistinguishable. The continuous reward spreads that mass: more than half of all runs land in the low-partial band (0–0.25), where models differ by how far they get before losing the thread.
| Rank | Model | Mean Reward | Solved (≥0.95) | Source | Date |
|---|---|---|---|---|---|
| 1 | Grok 4.5 | 0.505 | 13/46 (28%) | LHTB leaderboard | 2026-07 |
| 2 | Claude Sonnet 5 | 0.497 | 8/46 (17%) | LHTB leaderboard | 2026-07 |
| 3 | Claude Opus 4.8 | 0.492 | 9/46 (20%) | LHTB leaderboard | 2026-07 |
| 4 | Claude Fable 5 | 0.487 | 12/46 (26%) | LHTB leaderboard | 2026-07 |
| 5 | GPT-5.6 Sol | 0.451 | 7/46 (15%) | LHTB leaderboard | 2026-07 |
| 6 | GPT-5.5 | 0.445 | 7/46 (15%) | LHTB leaderboard | 2026-07 |
| 7 | MiniMax M3 | 0.385 | 3/46 (7%) | LHTB leaderboard | 2026-07 |
| 8 | Claude Sonnet 4.6 | 0.373 | 4/46 (9%) | LHTB leaderboard | 2026-07 |
| 9 | Kimi K2.7 Code | 0.367 | 3/46 (7%) | LHTB leaderboard | 2026-07 |
| 10 | GLM 5.2 | 0.316 | 1/46 (2%) | LHTB leaderboard | 2026-07 |
| 11 | Qwen3.6 Plus | 0.313 | 1/46 (2%) | LHTB leaderboard | 2026-07 |
| 12 | DeepSeek V4 Pro | 0.307 | 3/46 (7%) | LHTB leaderboard | 2026-07 |
| 13 | Qwen3.7 Max | 0.296 | 2/46 (4%) | LHTB leaderboard | 2026-07 |
| 14 | Hy3 | 0.288 | 1/46 (2%) | LHTB leaderboard | 2026-07 |
| 15 | Seed 2.1 Pro | 0.286 | 2/46 (4%) | LHTB leaderboard | 2026-07 |
| 16 | Gemini 3.1 Pro | 0.279 | 2/46 (4%) | LHTB leaderboard | 2026-07 |
| 17 | GPT-5.4 | 0.272 | 1/46 (2%) | LHTB leaderboard | 2026-07 |
| 18 | GLM 5.1 | 0.267 | 2/46 (4%) | LHTB leaderboard | 2026-07 |
| 19 | Kimi K2.6 | 0.255 | 0/46 (0%) | LHTB leaderboard | 2026-07 |
| 20 | GPT-5.3 Codex | 0.203 | 2/46 (4%) | LHTB leaderboard | 2026-07 |
| 21 | Grok 4.20 | 0.080 | 0/46 (0%) | LHTB leaderboard | 2026-07 |
Scores sourced from the LHTB paper and official leaderboard (Li et al. 2026). All runs use the Terminus-2 harness with a 90-minute budget.
A striking result from the LHTB paper is the weak correlation between cost and quality. Per-task spend ranges nearly 30×, from approximately $2.50 (Hy3) to $73 (Claude Fable 5), while mean reward spans only 2.5× from the best to worst result. Grok 4.5 posts the top mean reward at roughly $11 per task — combining the best score with low cost. MiniMax M3 and Qwen3.6 Plus deliver 60–80% of the top score at $4–6 per task, making them the value-efficient picks for production workloads that require repeated long-horizon runs.
No Benchgen results yet — be the first to run Long-Horizon Terminal-Bench.
| Benchmark | What it tests | Tasks | Metric | Saturation |
|---|---|---|---|---|
| LHTB | Long-horizon multi-step terminal tasks | 46 | Mean reward (0–1) | Low |
| TerminalBench 2.1 | Long-horizon terminal & shell interactions | — | % success | Low |
| SWE-bench Verified | Real GitHub issue resolution | 500 | % resolved | Medium |
| SWE-bench Pro | Harder real-world software engineering | — | % resolved | Low |
| CyberGym | Vulnerability reproduction | 1,507 | % success | Low |
Comparing long-horizon terminal performance across model versions is precisely the kind of regression-sensitive evaluation where Benchgen adds the most value. Because LHTB tasks run for 60–90 minutes each and use hidden verifiers, a single ad-hoc run cannot tell you whether an improvement in one update was offset by a regression in another. Running LHTB through Benchgen gives you version-controlled, reproducible results with trajectory-level diagnostics — so you can see not just whether the score improved, but where and why the agent lost the thread.
Top-performing models: Claude Sonnet 5, Claude Opus 4.8, Claude Fable 5, GPT-5.6 Sol, GPT-5.5
Related benchmarks: TerminalBench 2.1, SWE-bench Verified, SWE-bench Pro, CyberGym, TAU3 Banking
Long-Horizon Terminal-Bench (LHTB) is a benchmark that evaluates AI agents on 46 hard, long-duration terminal tasks across 9 categories. Each task runs inside a Docker container, requires hundreds of dependent actions over a 90-minute budget, and is graded by a hidden verifier using continuous partial credit (0–1). It was created by Zongxia Li et al. from Lehigh University and Tencent and released in July 2026.
The best published result as of July 2026 is 0.505 mean reward (Grok 4.5, 13/46 tasks solved). A score above 0.40 places a model in the top tier. 29 of 46 tasks have never been solved (reward ≥ 0.95) by any model, so the benchmark is far from saturation.
LHTB was created by Zongxia Li, Zhongzhi Li, Yucheng Shi, Ruhan Wang, Junyao Yang, Zhichao Liu, Xiyang Wu, Anhao Li, Yue Yu, Ninghao Liu, Lichao Sun, Haotao Mi, and Leowei Liang, affiliated with Lehigh University and Tencent. The paper is available at arXiv:2607.08964.
Both benchmarks evaluate AI agents on terminal tasks, but they differ in scope and difficulty. TerminalBench (version 2.1) measures reliability across CLI tasks at shorter time horizons and uses binary % success. LHTB specifically targets tasks that take 60–90 minutes per attempt and average 120–320 agent steps, using continuous partial-credit grading to maintain signal where binary scoring would assign near-universal zeros. LHTB also uses hidden, replay-based verifiers that make shortcutting and reward hacking unprofitable.
At the difficulty level targeted by LHTB, strict binary pass/fail collapses nearly all frontier models to zero — 10 of the 18 evaluated models solve zero tasks outright under a perfect-score threshold, even though many make substantial partial progress. Continuous partial credit preserves the ranking signal by distinguishing an agent that reconstructs 70% of a pipeline from one that reconstructs 20%, even if neither fully passes.