Vernon Toh, Navonil Majumder, Zhengyuan Liu, Nancy F. Chen, Soujanya Poria
Current LLM agents fail to use deductive reasoning when tool mappings shift unexpectedly, collapsing from 93% to 3% episode completion under combined dynamic conditions and resorting to exhaustive brute-force search even when their own internal map could guide recovery.
20 five-task evaluation episodes per model on ScrambleToolBench, a terminal benchmark with 28 obfuscated API tools and 20 procedural task templates. Tested 15 models (open-source and proprietary, including Claude Sonnet 5, Gemini 3.5 Flash, GPT-5.4, Qwen 3.6 27B, and others) across six conditions: unscrambled baseline, plus four independent dynamic stressors (mapping drift, stochastic action failure, temporal execution windows) and all combined. Memory-augmented variants tested for four models.
Aggregate episode completion rate (mean across 15 no-memory models) falls from 0.93 in the unscrambled baseline to 0.03 under all combined dynamics, a drop of 0.90. Average tasks solved falls from 4.88 to 0.84 out of 5. Best-performing individual model (Claude Sonnet 5) achieves 1.00 completion under drift alone and stochastic failure alone but drops to 0.00 under the combined condition. Persistent memory improves aggregate completion by +0.09 on average under combined conditions but does not recover full performance; no memory-augmented model exceeds 0.50 completion under all dynamics.
Authors concede: the environment is a lightweight Python simulator rather than a live Docker system, which may reduce ecological validity. The task pool is limited to 20 templates and 28 tools, so generalization to richer real-world APIs is unproven. Semantic obfuscation represents an intentional worst-case scenario that may not reflect the partial-semantic conditions most common in practice. The memory baseline is a single schema design (Appendix A) rather than a search over memory architectures. Only one cycle-tracing recovery strategy is analyzed analytically, and it was never spontaneously discovered by any agent.
The benchmark is a deliberately adversarial worst-case: fully obfuscated identifiers are rare in real deployments, so the 0.03 collapse figure may overstate fragility for practical use. The simulator is not a live environment, raising questions about whether failure modes would manifest identically in production systems. With only 20 episodes per condition, variance estimates are wide. The best model (Claude Sonnet 5) performs perfectly under several individual stressors, suggesting the combined condition may be measuring benchmark extremity rather than a broadly reproducible reasoning failure. Benchmark novelty also makes independent replication impossible at time of publication.
In the 12 to 24 month horizon, these findings complicate enterprise deployment of autonomous agents in environments with evolving or poorly documented APIs, a common real-world scenario. If agents revert to exhaustive search when tool behavior drifts, token and inference costs per task spike sharply, eroding the ROI case for unattended agentic pipelines. Operators will likely need human-in-the-loop checkpoints or explicit memory and monitoring infrastructure, adding integration cost. Little direct revenue or market impact is measurable from a single benchmark paper, but the result adds evidence that current agents are not ready for reliably autonomous operation in non-stationary tool environments.
Technical Capability: The benchmark isolates a specific and previously unmeasured reasoning gap: agents cannot translate a correct internal model into deductive recovery when mappings shift, and scaling test-time compute worsens token cost without fixing the failure.
Market & Valuation: Enterprises evaluating agentic products for IT operations, API orchestration, or system administration tasks should note that even top-tier models collapse under realistic dynamic conditions, raising questions about readiness and TCO for unattended deployments.