ReEfBench: Quantifying the Reasoning Efficiency of LLMs
Zhizhang Fu, Yuancheng Gu, Chenkai Hu, Hanmeng Liu, Yue Zhang
TL;DR
ReEfBench introduces a neuro-symbolic, FOL-grounded framework to quantify LLM reasoning efficiency by separating logical depth from computational cost. The pipeline generates scalable reasoning datasets, uses LLM-based parsing to build formal reasoning graphs, and applies rule-based verification to yield six diagnostic metrics, then clusters models into four behavioral archetypes. Key findings show that deep reasoning does not require extended token generation, that mixing long and short CoT data can disrupt strategies, and that distillation yields behavioral mimicry without guaranteed depth gains, with capacity constraints playing a critical role. The work provides a principled, scalable tool for evaluating reasoning processes, with potential to guide training, prompting, and deployment choices in practical AI systems.
Abstract
Test-time scaling has enabled Large Language Models (LLMs) to tackle complex reasoning, yet the limitations of current Chain-of-Thought (CoT) evaluation obscures whether performance gains stem from genuine reasoning or mere verbosity. To address this, (1) we propose a novel neuro-symbolic framework for the non-intrusive, comprehensive process-centric evaluation of reasoning. (2) Through this lens, we identify four distinct behavioral prototypes and diagnose the failure modes. (3) We examine the impact of inference mode, training strategy, and model scale. Our analysis reveals that extended token generation is not a prerequisite for deep reasoning. Furthermore, we reveal critical constraints: mixing long and short CoT data in training risks in premature saturation and collapse, while distillation into smaller models captures behavioral length but fails to replicate logical efficacy due to intrinsic capacity limits.
