WorksComputer Science
SciGame: Let Agents Play the Scientific Discovery Games in the Real and Counterfactual World
Abstract
Large language model agents are increasingly used for scientific discovery. However, existing benchmarks mix law inference with programming, score data fitting instead of prediction on unseen inputs, and do not separate empirical evidence from pretrained priors. We introduce SciGame, a controlled benchmark that converts scientific literature into structured scientific cards. Each card yields a pair of Original and dimensionally consistent Counterfactual environments with the same task interface. SciGame contains a Historical collection of canonical laws and a live Temporal collection curated from papers published after model knowledge cutoffs. It evaluates agents in candidate-guided Identification and open-ended Discovery settings. Each setting runs under Prior-only, Fixed, and Adaptive protocols. Experiments on five frontier models yield three findings. First, familiar priors hurt performance once the governing relation is altered. Second, adaptive experimentation helps the strongest models but harms weaker ones under limited budgets. Third, good explanations can hide quantitative failures. Recovering the exact symbolic form remains the main bottleneck, even when agents interpret evidence correctly. Current agents can investigate systems actively, but inducing exact laws in unfamiliar settings remains an open challenge.
Introduction
Scientific discovery is a sequential process in which researchers formulate hypotheses, design experiments, interpret observations, and draw conclusions under specified conditions. LLMs increasingly support this process. They analyze scientific descriptions (M. Bran et al., 2024; Laurent et al., 2024), construct executable expressions (Shojaee et al., 2025; Lu et al., 2024), interact with simulated environments (Wang et al., 2022), and propose experiments to test hypotheses [4] (Huang et al. 2025; Gottweis et al. 2026).
Scientific law discovery requires more than fitting data [5] (Schmidt and Lipson 2009; Udrescu and Tegmark 2020). An agent needs to infer how inputs determine observables and generalize to unqueried inputs (Kronberger et al., 2022). It needs to separate evidence from prior knowledge (Kronberger et al., 2022; Ríos-García et al., 2026), revise hypotheses that contradict observations (Wilie et al., 2024; Jhaveri et al., 2026), and explain the relation and its applicability conditions. A benchmark should therefore evaluate the whole investigation (Ríos-García et al., 2026).
Existing benchmarks cover parts of this process. Some evaluate experiment selection and hypothesis revision interactively [2, 6] (Jansen et al. 2024). Some recover equations from data (Shojaee et al., 2025) or link modeling with active experimental design (Gandhi et al., 2025; Kabra et al., 2026). Others test reasoning under altered physical laws [7] (Koblischke et al. 2025; Zheng et al. 2026; Wiemann et al. 2026) or build tasks from publications (Majumder et al., 2025; Chen et al., 2025c; Starace et al., 2025; Huang et al., 2026a).
Four gaps remain. First, benchmarks often change the task, observation protocol, and metric together. Few compare prior-only reasoning, fixed observations, and adaptive experimentation on one interface, or pair original and counterfactual relations [7] (Zheng et al. 2026; Wiemann et al. 2026). Second, common metrics may not test generalization to unseen inputs, and a plausible explanation can score well even when the predictor is wrong (Ríos-García et al., 2026). Third, most benchmarks are static and rarely include relations published after a model’s knowledge cutoff (White et al., 2025; He et al., 2026). Fourth, paper-based tasks mix law discovery with programming and replication (Kon et al., 2026).
We introduce SCIGAME, a controlled benchmark for scientific law discovery by LLM agents. It converts source relations into scientific cards that record the relation, variables, input domains, and applicability conditions. Each card yields two environments with the same interface. The Original environment implements the source relation. The Counterfactual environment applies a dimensionally consistent mutation. This pairing tests whether an agent follows evidence over familiar laws.
In Identification, the agent selects the governing relation from candidates. In Discovery, no candidates are given. In both, the agent submits executable expressions, an explanation, and applicability conditions. Each task runs under three protocols. Under Prior-only, the agent receives no observations. Under Fixed, it receives observations from a preset design. Under Adaptive, it queries an Oracle for experiments and decides when to submit.
SCIGAME also includes a live, knowledge-cutoff-aware track. The Historical collection holds stable reference relations. The Temporal collection is built by a rerunnable pipeline that extracts relations from recent papers and reviews them independently. Its time window moves with model cutoffs to reduce memorization (Rein et al., 2023; White et al., 2025). We report a prediction score on hidden inputs, a hierarchical episode success rate, and a rubric-based explanation score (Zheng et al., 2023; Tan et al., 2025).
Our contributions are as follows. First, we build a controlled benchmark with paired Original and Counterfactual environments and two task settings. Second, we introduce a live Temporal collection with an updatable curation pipeline. Third, we provide a unified framework that compares three protocols with three metrics. Finally, we evaluate multiple LLMs and find that familiar priors help on Original relations but hurt on Counterfactual ones. Adaptive experimentation helps stronger models but can harm weaker ones. Wrong functional relations are the main failure mode, and good explanations can coexist with incorrect predictors. Code and data are available in this anonymous repository.
Relevant work
Scientific discovery benchmarks. Scientific discovery benchmarks evaluate how agents infer relations and design experiments. DiscoveryWorld (Jansen et al., 2024), FalsifyBench (Bertolazzi et al., [2]), and Auto-Discovery-Bench (Chen et al., [6]) study hypothesis revision and experiment selection. LLM-SRBench (Shojaee et al., 2025), BoxingGym (Gandhi et al., 2025), and ActiveSciBench-Chem (Kabra et al., 2026) evaluate equation discovery and active experimental design. Gravity-Bench (Koblischke et al., 2025), PhysGym (Chen et al., [7]), NewtonBench (Zheng et al., 2026), and DiscoverPhysics (Wiemann et al., 2026) vary the scientific context or underlying laws. None of them compares the same task with and without candidate expressions. It is therefore unclear how candidates affect prediction when observations support or contradict a reference relation.
Paper-based scientific research. DiscoveryBench (Majumder et al., 2025) and ScienceAgentBench (Chen et al., 2025c) assess hypothesis discovery and scientific programming. PaperBench (Starace et al., 2025) evaluates research replication. These benchmarks measure broad research skills, not relation inference alone. SciLaws-Bench (Huang et al., 2026a) targets law discovery from papers, but its Real and Parallel settings use different observation and evaluation protocols. Their predictive accuracy is therefore not directly comparable.
In Table 1, we compare feature coverage of existing benchmarks and. SciGAME covers all features.
| Benchmark | Active experiments | Numerical prediction | Paper grounding | Counterfactual | Temporal selection |
| DiscoveryWorld (Jansen et al., 2024) | ✓ | ✓ | — | — | — |
| FalsifyBench (Bertolazzi et al., [2]) | ✓ | — | — | — | — |
| Auto-Discovery-Bench (Chen et al., [6]) | ✓ | ✓ | — | — | — |
| LLM-SRBench (Shojaee et al., 2025) | — | ✓ | — | ✓ | — |
| BoxingGym (Gandhi et al., 2025) | ✓ | ✓ | ✓ | — | — |
| ActiveSciBench-Chem (Kabra et al., 2026) | ✓ | ✓ | — | ✓ | — |
| Gravity-Bench (Koblischke et al., 2025) | ✓ | — | ✓ | ✓ | — |
| PhysGym (Chen et al., [7]) | ✓ | — | — | — | — |
| NewtonBench (Zheng et al., 2026) | ✓ | ✓ | — | ✓ | — |
| DiscoverPhysics (Wiemann et al., 2026) | ✓ | ✓ | — | ✓ | — |
| DiscoveryBench (Majumder et al., 2025) | — | — | ✓ | — | — |
| ScienceAgentBench (Chen et al., 2025c) | — | ✓ | ✓ | — | — |
| PaperBench (Starace et al., 2025) | ✓ | ✓ | ✓ | — | ✓ |
| SciLaws-Bench (Huang et al., 2026a) | ✓ | ✓ | ✓ | ✓ | — |
| SciGame (Ours) | ✓ | ✓ | ✓ | ✓ | ✓ |
Table 1. Comparison of scientific law discovery benchmarks and our work. “✓” indicates supported and “—” unsupported. Paper grounding covers paper-derived tasks, Counterfactual includes mutated relation variants, and Temporal selection denotes date-based source curation.
Methodology
Overview
Figure 1 summarizes our evaluation pipeline and adaptive protocol. We distill scientific sources into structured scientific cards. Each card records a relation, parameter values, variable definitions, units, a valid input domain, and applicability conditions. Each card instantiates an Original environment and a paired Counterfactual environment. The two environments share the same task interface and experimental constraints. The Counterfactual environment applies a controlled structural mutation to the relation. An episode is one run of a Player on one environment. During an episode, the Player

Figure 1. Overview of the study pipeline. Scientific cards define the relations, variables, and applicability conditions used to build paired environments. The central panel illustrates the Adaptive protocol, where the Player designs experiments and chooses when to stop. Each episode is evaluated on predictions, explanations, and interaction trajectories.
proposes experiments to an Oracle and receives observations or feedback. It updates its hypotheses and confidence values until it declares completion. We evaluate the final predictor and its scientific explanation, and we analyze the interaction trace to assess both task performance and investigation behavior. Sec. 3.2 describes source-relation curation and environment construction. Sec. 3.3 details the experimental protocol, and Sec. 3.4 defines the evaluation metrics.
Problem formulation. Each task specifies controllable inputs, observables, their units, and the conditions for running experiments. A deterministic simulator defines the response of observable to an input vector in the valid input domain. The relation and its parameters stay fixed within an episode. The Player builds a predictor with an executable expression for each observable. It uses the task description, any candidate expressions, and the observations allowed by the protocol. It also writes a scientific explanation of the inferred relation and its applicability conditions.
Data curation
Scientific data sources. We compile two collections of source relations. The Historical collection contains relations from the history of science. These relations serve as interpretable references. They test whether agents can use established relations to make predictions and support their conclusions with evidence. The Temporal collection extracts relations from publications in a configurable time window. We set this window after the reported knowledge cutoff of the evaluated Player to reduce data contamination.
Scientific data construction. For each task family, we create a scientific card that records the relation, variables, input domains, and applicability conditions. Historical relations use fixed modeling assumptions with explicit controllable inputs and observables. Figure 2 shows the live curation pipeline for the Temporal collection. It keeps only papers whose journal publication date and first preprint date both fall after the knowledge cutoff of the evaluated Player. An LLM extracts quantitative relations from these papers. A separate LLM reviewer checks each card for accuracy and completeness. Cards with missing or unsupported information are revised or removed. The pipeline can be rerun with new date windows to update the benchmark. Appendix § 8 lists all prompts.

Figure 2. Data curation pipeline. Part A describes the workflow on how to formulate accepted scientific cards from temporal sources. Part B describes how both historical and temporal corpus be curated as task family collections.
Counterfactual construction. For each task family in both collections, we pair an Original environment with a Counterfactual environment. The Original environment uses the source relation. The Counterfactual environment uses a systematically mutated version of it. Both environments share the same controllable inputs, input ranges, observables, and experimental constraints. They differ only in the relation that generates observations. This pairing tests whether the Player adapts to evidence that conflicts with established priors. Following NewtonBench (Zheng et al., 2026), we apply structural mutations to coefficients and exponents, add nonlinear transformations, and introduce cross-input interactions. Nonlinear transformations keep dimensional consistency, and each mutated variable is updated in all related equations. Appendix § 8 describes the mutation protocols for Historical and Temporal families. Finally, we evaluate the ground-truth equations of each environment on observations from its counterpart. All of them fail the prediction evaluation, which confirms that the two environments can be told apart empirically.
Experimental framework and protocol
We define two task settings for each Original and Counterfactual environment.
Identification. The Player receives a formula that combines the Original and Counterfactual expressions through an unknown parameter ,
Setting gives the Original expression , and gives the Counterfactual expression . The task states whether intermediate values of are allowed. In that case, the formula interpolates linearly between the two predictions. The simulator always sets to zero or one, but this value is hidden from the Player.
Discovery. The Player receives no candidate expressions or parametric models. It builds a relation from inputs to observables using only the background description, experimental constraints, and available observations.
Each scientific family therefore yields four tasks. Both settings require executable expressions for the observables and a scientific explanation. Within an environment, they share the same experimental interface and numerical evaluation criteria.
An episode is one run of the Player on one task under one protocol. Each episode starts with an empty interaction history and is isolated from other episodes. Figure 3 compares the three protocols.

Figure 3. Comparison of observation protocols. All three methods share the initial task description and assigned model information. Fixed provides a batch of observations from pre-specified experiments upfront. Adaptive allows sequential experiment proposal without a pre-set budget constraint.
(1) Prior-only. The Player receives no observations and does not interact with the Oracle. It completes the task using only the task description, protocol instructions, and prior knowledge.
(2) Fixed. The framework provides observations from a prespecified design with a fixed budget. The Player cannot select, modify, or repeat experiments. It then submits a final completion in the same format as Prior-only.
(3) Adaptive. The Player starts with no observations and proposes experiments to the Oracle step by step. At each LLM call, it receives the task description, protocol instructions, available observations, and interaction history. It returns a structured response with at least two hypotheses and their confidence scores, which are nonnegative and sum to one. The response also contains either an experimental proposal or a final completion. Each proposal includes a numerical prediction under every hypothesis for each proposed input and requested observable. Each final completion includes a predictor, a scientific rationale, and its applicability conditions.
The Oracle checks each proposal against the experimental constraints. It returns simulated observations for an accepted proposal. For a rejected proposal, it returns constraint feedback without any observations. The framework appends the proposal and the response to the interaction history. The
Player then updates its hypotheses and either proposes another experiment or submits. The loop ends when the confidence of the top hypothesis exceeds a threshold .
Evaluation metrics
We use three metrics. The prediction score measures how accurately the submitted predictor generalizes to unseen inputs. The episode success rate measures task completion under numerical-tolerance and exact-expression criteria. The scientific explanation score evaluates how well the Player explains the relation, its consequences, and its applicability conditions. For each metric, we report the number of valid episodes and count invalid, missing, and undetermined episodes separately.
Prediction score. The Evaluator compares the submitted predictions with the simulator responses on a hidden set of evaluation inputs. As shown in Figure 4, we normalize the absolute errors by the declared tolerances and compute

Figure 4. Evaluation pipeline.
where is an evaluation input, and are the absolute and relative tolerances, and is the number of input and observable pairs. The score equals one at zero error and decreases as the error grows. It also separates completions that fail the tolerance but differ in accuracy.
Episode success rate. We use a hierarchical success standard. Under the weak standard, an episode succeeds if on the evaluation inputs and the completion follows the protocol. The strict standard also requires to match the ground-truth expression exactly. The success rate is , where counts successful episodes and counts episodes with a determined outcome.
Scientific explanation score. After all runs finish, an LLM judge scores each explanation post hoc using the task description, interaction history, and reference relation with its applicability conditions. Three criteria assess whether the explanation correctly describes input–observable effects, gives a valid controlled comparison or scaling consequence, and stays within the supported evidence and assumptions; each is scored 0, 0.5, or 1, and the final score is their mean. See Appendix § 6.§ 2 for the full rubric and procedure.
Experiments
We evaluate the Player along two dimensions, varying the task setting (collection, environment, and whether candidate expressions are given) and the observation protocol (no observations, a fixed batch, or self-selected experiments), and report overall performance before using controlled comparisons to isolate the effects of prior knowledge, observations, and adaptive experimentation. More results are shown in Appendix § 7.
Experimental setup
Task collections. The Historical collection contains 20 task families based on classical scientific relations, listed in Table 8. The Temporal collection contains 24 task families from 23 papers published in leading peer-reviewed journals between 30 April and 15 September 2026, listed in Table 9.
| Family | Historical anchor | Experimental interface | Historical relation | Validity scope | Counterfactual lineage | Separating intervention |
| pendulum | Huygens, Horologium Oscillatorium (1673) | : length m; bob mass kg; release angle . : period (s). | ; s, equivalently ; independent of . | Small angle; simple pendulum; uniform ; negligible drag, friction, buoyancy, and finite-amplitude correction. | M1: ; M2: ; M3: interaction. | Cross length and mass from low to high values while holding angle fixed; include the reference and off-reference angle endpoints. |
| young_double_slit | Young, Bakerian lecture (read 1803; published 1804) | : wavelength nm; screen distance m; slit separation mm. : fringe spacing (mm). | mm . | Mutually coherent narrow slits; central paraxial fringes; normal aligned screen; fixed slit width and polarization. | M1: ; M2: ; M3: interaction. | Sweep across its range, then cross wavelength and screen distance at separated levels. |
| galileo_inclined_plane | Galileo, Two New Sciences (1638) | : distance m; incline ; ball mass kg. : collected water (g). | g. | Similar balls roll from rest without slip at constant acceleration; fixed inertia ratio and steady water-clock flow. | M1: ; M2: ; M3: interaction. | Cross distance and incline over interior and endpoint settings, with mass varied to test the historical invariance. |
| boyle_j_tube | Boyle, trapped-air compression manuscript (2 October 1661) | : added pressure kPa; thermal condition fixed to room temperature. : volume (mL), absolute pressure (kPa). | mL , with . | Fixed amount of dilute gas; quasistatic isothermal equilibrium; calibrated end-space; no leakage, adsorption, or dissolution. | M1: ; M2: ; M3: bounded single-axis curvature . | Sweep added pressure from zero through two interior values to the upper endpoint after thermal equilibration. |
| photoelectric | Einstein (1905), Millikan’s direct experiment (1916), and his Nobel lecture (delivered 1924) | : frequency THz; absorbed photon flux relative. : stopping potential , saturation current . | , V s, V; above threshold, A. | Clean uniform cathode; monochromatic single-photon regime; complete collection; no contact drift, space charge, multiphoton response, or dark current. | M1: V s; M2: ; M3: interaction. | Probe below and above the shifted threshold at widely separated frequencies and cross those settings with low and high flux. |
| faraday_induction | Faraday, Experimental Researches in Electricity, vol. I (experiments 1831 onward; collected 1839) | : turns ; area cm; mT; ramp time ms. : peak emf (mV). | . | Uniform normal field; constant-slope ramp; identical turns; high-impedance readout; negligible loading, self-inductance, and stray flux. | M1: ; M2: ; M3: interaction. | Sweep ramp duration across decades and cross turns with loop area while holding field change controlled. |
| radioactive_decay | Rutherford and Soddy (1902, 1903) | : elapsed time min; active mass mg. : count rate (counts min). | counts min. | One radionuclide; common preparation and geometry; fixed background and efficiency; negligible self-attenuation and dead time. | M1: ; M2: ; M3: interaction. | Cross early/late times with low/high masses; retain a zero-time point to isolate mass scaling from decay. |
| rutherford_scattering | Geiger–Marsden (1909), Rutherford (1911), and Geiger–Marsden (1913) | : angle ; ; target density relative; exposure relative. : count rate (counts min). | . | Elastic nonrelativistic unscreened Coulomb scattering; thin single-scattering target; fixed beam energy and narrow detector acceptance. | M1: angular exponent ; M2: ; M3: interaction. | Sweep angle broadly and cross it with at least two separated values; vary density/exposure to verify retained linear factors. |
| hooke_spring | Hooke, Lectures de Potentia Restitutiva (1678) | : force N; stiffness N m. : extension (cm). | cm, with . | Reversible quasistatic tensile regime; negligible hysteresis, creep, inertia, and temperature drift. | M1: cubic correction coefficient ; M2: ; M3: interaction. | Sweep force at fixed stiffness to expose cubic curvature, then cross force and stiffness away from their reference values. |
| torricelli_efflux | Torricelli, Opera geometrica (1644) | : liquid head m; orifice area mm. : exit speed (m s). | m s. | Steady incompressible lossless efflux; large reservoir; equal surface/outlet pressure; fixed opening shape and negligible contraction loss. | M1: ; M2: ; M3: interaction. | Sweep head from low to high at fixed area, then vary area at matched heads to test both invariance and interaction. |
| Family | Historical anchor | Experimental interface | Historical relation | Validity scope | Counterfactual | Separating intervention |
| ohm_circuit | Ohm, Die galvanische Kette, mathematisch bearbeitet (1827) | : voltage V; resistance . : current (mA). | mA . | Steady DC at fixed temperature; ideal source and meter; negligible self-heating, contact resistance, and parasitics. | M1: ; M2: ; M3: interaction. | Sweep resistance over its full range at fixed voltage and cross low/high voltage with low/high resistance. |
| rc_discharge | Thomson’s condenser-discharge analysis (1853); the benchmark uses its ideal zero-inductance RC limit | : V; k; F; s. : capacitor voltage (V). | , with , , and s. | Ideal lumped first-order RC; constant components; high-impedance meter; negligible leakage, dielectric absorption, and parasitics. | M1: normalized-time shape ; M2: ; M3: ; interaction. | Sample several normalized times , then cross initial voltage and resistance while separately varying capacitance. |
| stefan_boltzmann | Stefan (1879) and Boltzmann (1884) | : emitter K; ambient K; area cm. : net radiative power (W). | W . | Diffuse black emitter in a black enclosure with view factor one; uniform temperatures; calibrated exclusion of non-radiative transfer. | M1: linked , , ; M2: ; M3: interaction. | Sweep emitter temperature at fixed ambient, vary ambient at matched emitter temperature, and check area proportionality. |
| newton_cooling | Newton, Scala graduum caloris (1701) | : ; ; min. : object temperature (). | , with min and fast-mode weight . | Lumped capacitance; constant ambient, transfer coefficient, and properties; negligible sensor lag and unmodelled loss channels. | M1: fast-mode weight ; M2: on ; M3: modulation of only. | Resolve the early-time curve at fixed endpoints, then cross initial and ambient temperatures while comparing temperature excess. |
| beer_lambert | Bouguer (1729), Lambert (1760), and Beer (1852) | : incident power W; concentration mM; path cm. : transmitted power (W). | , with mM and . | Homogeneous stable non-scattering, non-fluorescent absorber in the linear regime; fixed wavelength, solvent, temperature, and calibrated windows. | M1: path exponent ; M2: ; M3: interaction. | Sweep path length at fixed concentration, then cross incident power and concentration at a shared path length. |
| michaelis_menten | Michaelis and Menten (1913); Haldane (1930) | : substrate mM; enzyme relative. : initial rate (mol L min). | , with mol L min, mM, and . | Single-substrate quasi-steady initial-rate window; negligible depletion, product, reverse reaction, inactivation, inhibition, and mass-transfer limitation. | M1: substrate-inhibition strength ; M2: ; M3: interaction. | Sweep substrate through the rising, saturation, and high-substrate regimes; cross enzyme levels at shared substrate values. |
| coulomb_force | Coulomb, first memoir (presented 1785; cited from the 1789 collected volume) | : charges nC; separation cm. : force magnitude (N). | N . | Static point charges in vacuum; fixed localized distributions; no screening, polarization, image forces, or external fields. | M1: ; M2: ; M3: interaction. | Sweep separation over its range, then independently cross both charges at a fixed separation. |
| kepler_orbit | Kepler, Harmonices mundi V (1619) | : semi-major axis AU; eccentricity . : orbital period (days). | days . | Bound Newtonian two-body orbit about the same fixed central mass; negligible test mass, perturbations, tides, drag, and relativistic corrections. | M1: ; M2: ; M3: interaction. | Sweep semi-major axis across more than one decade and vary eccentricity at a shared off-reference axis. |
| brownian_diffusion | Einstein, Brownian-motion paper (1905) | : lag s; tracer radius m. : two-dimensional MSD (m). | m. | Overdamped dilute spheres in a Newtonian fluid; fixed temperature and viscosity; far from walls; lag below drift/confinement times. | M1: ; M2: ; M3: interaction. | Sweep lag over two decades at fixed radius, then cross lag and radius at separated levels. |
| poiseuille_flow | Hagen (1839) and Poiseuille (preliminary reports 1840–1841; memoir issued 1844 and collected 1846) | : kPa; radius mm; length cm; viscosity mPa s. : flow rate (mL s). | mL s . | Steady fully developed incompressible Newtonian laminar flow; rigid straight circular tube; no-slip wall; losses measured only between pressure taps. | M1: ; M2: ; M3: interaction. | Sweep radius at fixed pressure, length, and viscosity; cross pressure, radius, and verify retained inverse length/viscosity factors. |
Table 8. The 20 Historical task families. Tasks are deterministic idealizations grounded in cited sources rather than literal replications. Brackets denote valid input domains; and indicate controllable inputs and observables.
| Family | Journal and source | Experimental interface | Source-reported relation | Validity scope | Counterfactual construction | Separating queries |
| Defect supersymmetric entropy | Physical Review Letters (Huang et al., 2026b). | inverse Rényi index . normalized entropy (dimensionless). | . | Symmetric Wilson surface in the theory. . Exact relation at fixed theory and representation. | M1 replaces by , preserving . | Query and , and retain as a common reference. |
| Turbulent scaling exponent | Physical Review Letters (Mailybaev and Thalabard, 2026). | moment order . scaling exponent (dimensionless). | , and . | Inertial-range shell-model asymptotics through . Terms are omitted. Continuous moment orders are benchmark queries. | M1 changes from to . The correction is multiplied by four and is retained. | Sample moment orders below and above , including and . The protected alone does not separate the laws. |
| MnF crossover displacement | Physical Review Letters (Ohlendorf et al., 2026). | strain and field T. crossover shift (K). | . . | Compression along [110], field along . Mean-field exponent . All admitted strains are negative, so . | M1 replaces every by , including its occurrences in . | Cross strain levels with interior fields, including T. Endpoint fields are preserved by the composition. |
| Confined ciliate swimming | Physical Review Letters (Antunes et al., [1]). | mean slip and amplitude . normalized laboratory-frame mean swimming velocity . All dimensionless. | . | Resonant channel and metachronal wavelengths, lubrication and incompressible Stokes flow. Fixed reduced mobility . Includes the phase-locked plateau. | M1 and M2 replace and by and . | Cross interior slip and amplitude settings through the oscillatory-to-locked transition. Include interior values because corners alone are preserved. |
| Quantum interconnect rate | Physical Review Letters (Luo et al., 2026). | modes , storage efficiency and noise . scaled rate (bits). | . . . | Ideal 1000-km, four-segment repeater with two nesting levels. , km. Equal input probabilities and depolarizing memory noise. Lifetime losses omitted. | M1 replaces all occurrences by mode levels at , retaining the same information term. | Cross noise and mode levels at interior . Efficiency endpoints are preserved. |
| Time-dependent CP asymmetry | Physical Review Letters (LHCb Collaboration, 2026). | proper time ps. integrated CP asymmetry (dimensionless). | . | Helicity-angle-integrated asymmetry. approximation and fixed dilepton-mass exclusions. Proper time is an observation coordinate. | M1 replaces both time occurrences by . | Sample interior proper times across the oscillation, in addition to 1.25 and 7.25 ps. The two endpoints alone coincide. |
| Fermentation minimum selling price | Nature Communications (Bhagwat et al., [3]). | yield g product/g sugar and titer g product/L. minimum selling price (2019 USD/kg product). | . | Fitted techno-economic relation for glucose-to-succinic acid, low-pH index 25. Productivity g L h and recovery 0.983. Large-scale fed-batch plant model. | M1 and M2 replace yield and titer by and in every occurrence. | Cross interior yield and titer levels with their endpoints to distinguish both reciprocal terms and their interaction. |
| Shear-thinning cutting force | Nature Communications (Zhao et al., 2026). | , . m/s. mm. relative force (dimensionless). | . | Printed empirical fit for the fixed optimized starch fluid and calibrated straight blades. Discrete joint query grid. Other compositions, blade geometries and the unlabelled 16-mm-sheet series are excluded. | M1 replaces the radius exponent 0.968 by 0.968, coupling radius and speed. The common normalization is retained. | Cross at least two nonreference radii with low and high speeds, with depth fixed. The reference radius or reference speed alone hides the mutation. |
| Family | Journal and source | Experimental interface | Source-reported relation | Validity scope | Counterfactual construction | Separating queries |
| Off-diagonal scattering density | Physical Review Letters ((Köhnes et al., 2026). | cross section . local probability-density value . Both coordinates are dimensionless. | , , . . | Leading and first subleading Heidelberg asymptotic density for , and absorption 7.013. Used near the Ericson transition. The finite query interval is not a separately normalized support. | M1 composes with . M2 multiplies it by . | Query endpoints and interior cross sections. The Jacobian changes density heights even where the coordinate composition fixes an endpoint. |
| Thin-film differential reflectance | Physical Review Letters ((Puri et al., 2026). | SnS thickness nm. AC-polarized differential reflectance (dimensionless). | <br>, , .<br> at , . | Normal-incidence 800-nm light in air/SnS/MgO. First-order real-index perturbation only, with imaginary-index change omitted. All multiple reflections and the analytic derivative are retained. | M1 replaces every thickness occurrence by in the complete differentiated Fresnel response. | Sweep interior thickness through interference extrema. The original thickness endpoints are common to both laws. |
| Squeezed-vacuum energy surface | Physical Review Letters ((Ramírez et al., 2026). | bosonic coordinates . thermodynamic-limit energy in the fixed model energy unit. | . | Mean-field squeezed-vacuum surface after eliminating atomic coordinates. , , , below spectral collapse. Not an exact finite-system energy. | M1 and M2 replace all and occurrences by and . | Cross interior positive, zero and negative phase-space coordinates to test curvature and the source reflection symmetries. |
| Pulsed magnetic-field sensing | Physical Review X ((Tabatabaei et al., 2026). | field T and pulse blocks . signal-to-noise ratio. | s.<br>.<br>SNR , and . | Fixed acquisition and noise parameters of the nonlinear sensitivity model. Sinusoidal field at a filter-function lobe and sensing duration much shorter than . is evaluated from the frozen source noise expression. | M1 replaces only inside the phase by . Acquisition, decay and noise terms retain their forms. | Cross interior field strengths with distinct block counts. Field endpoints alone conceal the composition. |
| Undetected-light visibility | Nature Communications ((Severs Millard et al., 2026). Advance publication. | object-arm intensity transmission . fringe visibility . Both dimensionless. | .<br>.<br>. | Michelson nonlinear thin-film model with undepleted pump and seed. Stimulated emission dominates. Only the first four-wave-mixing reflection and within-window interference are retained. | M1 replaces both transmission occurrences by . | Scan interior transmission values between 0.1 and 0.9. The two endpoints alone agree. |
| Davemaoite phase boundary | Nature Communications ((Hao et al., 2026). | pressure GPa. transition temperature (K). | . | Printed fitted tetragonal-to-cubic phase boundary for lower-mantle davemaoite. Deterministic use of central fit coefficients. Fit uncertainties are not per-query noise. | M1 replaces by . | Compare at least two interior pressures against the source straight line, with endpoints as shared references. |
| CoO orbital magnetoresistance | Science ((Schmitt et al., 2026). | remaining Cu* thickness nm. orbital-magnetoresistance amplitude (percent). | percent. | Approximate plateau of CoO(5 nm)/Cu* at 150 K. One Hall bar is progressively ion-milled and exposed to air for 12 h after each etch. Thickness is resistance-calibrated. | M1 changes the affine slope from 0 to 0.08 percent/nm, giving . | Compare low and high remaining thickness to test the plateau against a nonzero slope under the fixed protocol. |
| Family | Journal and source | Experimental interface | Source-reported relation | Validity scope | Counterfactual construction | Separating queries |
| MnF₂ transition baseline | Physical Review Letters (Ohlendorf et al., 2026). | C loading-path strain and field T. R baseline (K). | . | Fitted non-altermagnetic baseline along compressive [110] loading, including co-induced symmetric strain. Not independently imposed pure shear or the shifted crossover . | M1 replaces by , with fixed T. The field coefficient retains units K/T². | Compare and 6.44 T at matched strain, then repeat across strain levels. |
| Quasiperiodic localization exponent | Physical Review Letters (Lin et al., 2026a). | C comprises couplings . R is the Lyapunov exponent . All quantities are dimensionless. | . . | The source-theory unitary almost-Mathieu relation is evaluated at non-Hermiticity , irrational quasiperiodic field and phase . Positive gives inverse localization length. A zero value covers extended or critical states. The interface returns the asymptotic theoretical exponent without finite-time photon-counting fluctuations. | M1 and M2 replace every occurrence of and by and . | Cross distinct interior couplings with , including (0.25, 0.50). Include the reversed pair as a zero-response control. Equal couplings and domain corners alone do not separate the branches. |
| Viscous–inertial suspension rheology | Physical Review Letters (Konidena et al., 2026). | C is the Stokes number . R is normalized macroscopic friction . Both are dimensionless. | . | The source-reported dense-suspension relation is restricted to interparticle friction and the constructed packing-related slice , with . The displayed coefficients specify the fixed deterministic response. Changing Stokes number does not independently scan packing or particle friction, and the admitted interval is not extrapolated. | M1 replaces both Stokes-number occurrences by . | Sweep logarithmically separated interior values such as 0.1, 10 and 100. Compare the crossover curvature and use the shared endpoints only as controls. |
| Splashing-drop rim response | Physical Review Letters (Riboux and Gordillo, 2026). | C is . R comprises rim speed and rim diameter . All quantities are dimensionless. | , , . Let solve and set . , . | The calibrated low-viscosity, high-Reynolds-number approximation describes the early two-jet spray regime. The fixed layer depth is . Ohnesorge number 0.0105, and gas density and viscosity ratios 0.001 and 0.018. Both readouts describe the toroidal rim at in units of , including ballistic rim motion and early thickening. | M1 replaces every Weber-number occurrence by in the linked root construction and both outputs. | Sample several interior Weber numbers and compare the coupled speed and diameter curves. Preserve the low and high endpoints as common references rather than using them alone. |
| Family | Journal and source | Experimental interface | Source-reported relation | Validity scope | Counterfactual construction | Separating queries |
| Trapped-ion optical Magnus response | Physical Review Letters (Leindecker et al., 2026). | comprises focal-plane positions µm and transition category . is ground-state survival probability , dimensionless. | , µm, . , . . | A resonant single pulse addresses a fixed ion initially in . The beam propagates along , is polarized along , and the quantization field points along . The first correction beyond the paraxial quadrupole-gradient model is retained. Each transition uses its modeled peak coupling over the one-waist square for its own fixed -pulse calibration. | M1 replaces both occurrences of by . The coordinate , discrete transition category and fixed pulse calibration are retained. | Cross interior horizontal positions, especially , with positive and negative vertical positions and both transition categories. Track the survival-profile displacement while retaining the horizontal endpoints as controls. |
| Parity-prepared oscillator squeezing | npj Quantum Information (Lin et al., 2026b). Advance publication. | comprises coherent-displacement amplitude and per-step intensity transmissivity , both dimensionless. is final conditional squeezing in dB. | , with full pure loss . Normalize . , . The card gives the exact nine-exponential reduction. | Three ideal displaced-parity measurements start from vacuum and retain only the all-even outcomes. Full unobserved pure loss follows each measurement, including the third, and the final state is normalized by its full success probability. The response retains coherences and all loss events. The displacement amplitude is not time, and no Gaussian-state or single-loss approximation is used. | M1 replaces all 19 amplitude occurrences by . This uses the preregistered source amplitude reference, not on the smaller public interval. | Cross low, middle and high admitted amplitudes with several transmissivities. Compare the complete squeezing curve. The public amplitude endpoints are not fixed by this composition. |
| Mean-field microcanonical coexistence | Physical Review X (Serbyn et al., 2026). | comprises and . comprises crossing energy density , common magnetization magnitude and signed branches , . All are dimensionless in the stated Pauli and units. | , , . . | The uniform thermodynamic LMG-3 mean-field problem maximizes the microcanonical entropy at fixed energy over . The selected negative-energy crossing has two global entropy maxima with opposite signed longitudinal magnetizations and the same magnitude. The Pauli magnetization convention is used. This target excludes finite-size disorder, tunneling rates and dynamical ETH hybridization thresholds. | M1 replaces every occurrence in all four outputs by the legal box. Compare the crossing energy and both signed branches together. The current public transverse-field endpoints do not remain invariant. | Cross transverse and longitudinal fields over the legal box. Compare the crossing energy and both signed branches together. |
| Family | Journal and source | Experimental interface | Source-reported relation | Validity scope | Counterfactual construction | Separating queries |
| Loss-mediated transfer and entanglement | Physical Review A ((Ren and Li, 2026)). | is scaled time . comprises , , , , , , all dimensionless. The suffix specifies the independent initial qubit excitation, and is reduced two-qubit concurrence. | , . in basis . , . Amplitudes are unnormalized and lost probability occupies the vacuum. | The engineered sideband-selected rotating-wave model retains both equal-loss cavities with detunings and relative coupling phase . Each reset starts with one specified qubit excited and both cavities in vacuum. Cavity recycling is unconditional. Intrinsic qubit decoherence and thermal excitation are omitted. No cavity elimination or exactly vanishing reverse transfer is imposed. | M1 replaces all 48 time occurrences in the six complete modal outputs by . The populations and concurrence require no derivative factor. | Sample several interior times from both preparations, including early and late transients. Compare transferred populations and concurrence jointly. The interval endpoints remain shared. |
| Non-Markovian cooperative radiation | Quantum ((González and Rivas, 2026)). | is scaled time . comprises unconditional Dicke populations , , and signed atomic energy-loss rate . All four are dimensionless. | , , . . for symmetric Dicke states . . The card retains every modal coefficient. | Two identical atoms have common coupling phase, a vacuum Lorentzian reservoir, linewidth and transition ratio . The resonant rotating-wave and narrowband pseudomode model retains all reachable excitation sectors and loss recycling. The initial atomic state is fully excited. Negative signed intensity represents reabsorption, and the three populations sum to one. | M1 composes all populations and signed intensity with . M2 multiplies the composed intensity by , preserving its derivative definition. | Sample interior early and late times and compare populations with signed energy flow. Endpoint populations agree between branches, whereas endpoint intensities need not because of the derivative factor. |
Table 9. The 24 families in the Temporal collection. These are derived from 23 primary papers and paired with benchmark-authored counterfactual responses. The source-reported branch is a deterministic implementation of the selected relation under the stated approximations. It does not reproduce all experiments or raw data in the paper. Numerical intervals and discrete sets below are the current legal query domains.
Player models. We evaluate five models through Codex with high reasoning effort. They are GPT-5.5, GPT-5.6 Luna, GPT-5.6 Terra, GPT-5.6 Sol, and GPT-6 Astra. We also evaluate other advance open-sourced models such as Qwen-3.6 Plus, Qwen-3.7 Plus, Deepseek-v4 Flash and K2-Horizon-375B-A23B via APIs. Table 4 lists the API release date and reported knowledge cutoff of each model. We interpret Temporal results relative to these cutoffs.
| Player | Knowledge cutoff | API release |
| GPT-5.5 ((OpenAI, 2026a)) | 1 December 2025 | 24 April 2026 |
| GPT-5.6 Luna ((OpenAI, 2026b)) | 16 February 2026 | 9 July 2026 |
| GPT-5.6 Terra ((OpenAI, 2026d)) | 16 February 2026 | 9 July 2026 |
| GPT-5.6 Sol ((OpenAI, 2026c)) | 16 February 2026 | 9 July 2026 |
| GPT-6 Astra ((OpenAI, 2026e)) | 30 April 2026 | 3 September 2026 |
| Qwen-3.6 Plus | February 2026 | 2 Apr 2026 |
| Qwen-3.7 Plus | April 2026 | 2 June, 2026 |
| DeepSeek-V4 Flash | Jul 2025 | 31 Jul 2026 |
| K2-Horizon-375B-A23B | December 2025 | September 2026 |
Table 4. The Player models and dates.
Episodes and repetitions. We run three independent repetitions for each combination of task, model, and protocol. Each repetition is a new episode with an empty interaction history. No observations, responses, or records carry over between episodes.
Evaluation procedure. We score each final predictor on hidden inputs with the prediction score and episode success criteria in § 3.4. We evaluate each scientific explanation separately with the rubric-based post hoc procedure. GPT-6 Astra serves as the fixed Evaluator for all Player models and conditions.
Main benchmark results
Overall performance. Table 2 reports the episode success rate (ESR) and average prediction score (PS) of five Players under the Prior-only, Fixed with , and Adaptive protocols. We summarize four findings.
| Model | Method | Historical Identification Original ESR | Historical Identification Original PS | Historical Identification Original SES | Historical Identification Counterfactual ESR | Historical Identification Counterfactual PS | Historical Identification Counterfactual SES | Historical Discovery Original ESR | Historical Discovery Original PS | Historical Discovery Original SES | Historical Discovery Counterfactual ESR | Historical Discovery Counterfactual PS | Historical Discovery Counterfactual SES | Temporal Identification Original ESR | Temporal Identification Original PS | Temporal Identification Original SES | Temporal Identification Counterfactual ESR | Temporal Identification Counterfactual PS | Temporal Identification Counterfactual SES | Temporal Discovery Original ESR | Temporal Discovery Original PS | Temporal Discovery Original SES | Temporal Discovery Counterfactual ESR | Temporal Discovery Counterfactual PS | Temporal Discovery Counterfactual SES |
| DeepSeek-V4 Flash | Prior-only | 88.3 | 0.950 | 0.707 | 0.0 | 0.136 | 0.401 | 31.7 | 0.574 | 0.684 | 0.0 | 0.100 | 0.218 | 40.3 | 0.467 | 0.563 | 0.0 | 0.158 | 0.552 | 0.0 | 0.078 | 0.439 | 0.0 | 0.062 | 0.379 |
| DeepSeek-V4 Flash | Fixed | 91.7 | 0.967 | 0.839 | 48.3 | 0.660 | 0.563 | 53.3 | 0.867 | 0.757 | 0.0 | 0.338 | 0.426 | 51.4 | 0.639 | 0.649 | 33.3 | 0.440 | 0.624 | 12.5 | 0.505 | 0.587 | 9.7 | 0.378 | 0.564 |
| DeepSeek-V4 Flash | Adaptive | 76.7 | 0.819 | 0.799 | 33.3 | 0.456 | 0.601 | 23.3 | 0.485 | 0.713 | 0.0 | 0.186 | 0.488 | 52.8 | 0.597 | 0.697 | 44.4 | 0.536 | 0.723 | 9.7 | 0.406 | 0.578 | 11.1 | 0.270 | 0.476 |
| K2-Horizon-375B | Prior-only | 83.3 | 0.875 | 0.901 | 0.0 | 0.135 | 0.384 | 25.0 | 0.450 | 0.817 | 0.0 | 0.083 | 0.209 | 12.5 | 0.240 | 0.638 | 5.6 | 0.174 | 0.660 | 0.0 | 0.089 | 0.562 | 0.0 | 0.053 | 0.385 |
| K2-Horizon-375B | Fixed | 78.3 | 0.842 | 0.969 | 36.7 | 0.424 | 0.802 | 41.7 | 0.737 | 0.883 | 0.0 | 0.218 | 0.527 | 40.3 | 0.453 | 0.851 | 27.8 | 0.350 | 0.818 | 13.9 | 0.351 | 0.717 | 5.6 | 0.176 | 0.729 |
| K2-Horizon-375B | Adaptive | 73.3 | 0.741 | 0.933 | 26.7 | 0.377 | 0.707 | 33.3 | 0.575 | 0.853 | 0.0 | 0.121 | 0.482 | 33.3 | 0.524 | 0.839 | 33.3 | 0.423 | 0.790 | 12.5 | 0.254 | 0.664 | 4.2 | 0.104 | 0.570 |
| Qwen3.6 Plus | Prior-only | 36.7 | 0.466 | 0.624 | 0.0 | 0.059 | 0.486 | 13.3 | 0.208 | 0.645 | 0.0 | 0.034 | 0.218 | 23.6 | 0.283 | 0.543 | 0.0 | 0.070 | 0.519 | 0.0 | 0.069 | 0.355 | 0.0 | 0.048 | 0.264 |
| Qwen3.6 Plus | Fixed | 36.7 | 0.448 | 0.868 | 1.7 | 0.090 | 0.385 | 18.3 | 0.236 | 0.736 | 0.0 | 0.047 | 0.240 | 25.0 | 0.312 | 0.580 | 13.9 | 0.186 | 0.527 | 12.5 | 0.263 | 0.539 | 5.6 | 0.178 | 0.514 |
| Qwen3.6 Plus | Adaptive | 1.7 | 0.017 | 0.625 | 0.0 | 0.000 | 0.500 | 0.0 | 0.000 | 0.500 | 0.0 | 0.000 | 0.500 | 25.0 | 0.278 | 0.605 | 19.4 | 0.194 | 0.603 | 6.9 | 0.116 | 0.528 | 2.8 | 0.050 | 0.504 |
| Qwen3.7 Plus | Prior-only | 80.0 | 0.841 | 0.722 | 0.0 | 0.131 | 0.301 | 31.7 | 0.560 | 0.667 | 0.0 | 0.096 | 0.194 | 40.3 | 0.470 | 0.579 | 0.0 | 0.155 | 0.566 | 0.0 | 0.114 | 0.360 | 0.0 | 0.054 | 0.354 |
| Qwen3.7 Plus | Fixed | 81.7 | 0.870 | 0.900 | 38.3 | 0.463 | 0.634 | 48.3 | 0.790 | 0.783 | 0.0 | 0.208 | 0.434 | 40.3 | 0.523 | 0.693 | 33.3 | 0.372 | 0.706 | 13.9 | 0.218 | 0.593 | 6.9 | 0.145 | 0.586 |
| Qwen3.7 Plus | Adaptive | 46.7 | 0.502 | 0.708 | 15.0 | 0.170 | 0.576 | 21.7 | 0.366 | 0.670 | 0.0 | 0.079 | 0.462 | 34.7 | 0.408 | 0.616 | 27.8 | 0.312 | 0.664 | 6.9 | 0.114 | 0.569 | 6.9 | 0.104 | 0.520 |
| GPT-5.5 | Prior-only | 73.3 | 0.780 | 0.884 | 31.7 | 0.404 | 0.519 | 35.0 | 0.655 | 0.939 | 0.0 | 0.123 | 0.289 | 8.3 | 0.244 | 0.517 | 19.4 | 0.389 | 0.768 | 0.0 | 0.209 | 0.587 | 0.0 | 0.081 | 0.530 |
| GPT-5.5 | Fixed | 95.0 | 1.000 | 0.997 | 95.0 | 1.000 | 0.983 | 63.3 | 0.998 | 0.943 | 0.0 | 0.426 | 0.575 | 45.8 | 0.723 | 0.915 | 38.9 | 0.670 | 0.881 | 19.4 | 0.754 | 0.878 | 9.7 | 0.422 | 0.715 |
| GPT-5.5 | Adaptive | 98.3 | 1.000 | 1.000 | 88.3 | 0.966 | 0.992 | 63.3 | 0.981 | 0.947 | 0.0 | 0.838 | 0.725 | 48.6 | 0.826 | 0.933 | 41.7 | 0.680 | 0.919 | 18.1 | 0.864 | 0.930 | 12.5 | 0.720 | 0.862 |
| GPT-5.6 Luna | Prior-only | 83.3 | 0.871 | 0.933 | 1.7 | 0.133 | 0.397 | 33.3 | 0.573 | 0.887 | 0.0 | 0.122 | 0.247 | 11.1 | 0.216 | 0.611 | 0.0 | 0.117 | 0.485 | 0.0 | 0.185 | 0.519 | 0.0 | 0.077 | 0.408 |
| GPT-5.6 Luna | Fixed | 90.0 | 0.955 | 1.000 | 40.0 | 0.499 | 0.854 | 55.0 | 0.928 | 0.871 | 0.0 | 0.383 | 0.458 | 40.3 | 0.589 | 0.877 | 29.2 | 0.427 | 0.748 | 18.1 | 0.591 | 0.781 | 11.1 | 0.391 | 0.699 |
| GPT-5.6 Luna | Adaptive | 83.3 | 0.884 | 0.953 | 28.3 | 0.365 | 0.860 | 43.0 | 0.765 | 0.881 | 0.0 | 0.299 | 0.601 | 47.2 | 0.637 | 0.843 | 26.4 | 0.336 | 0.822 | 11.1 | 0.370 | 0.821 | 8.3 | 0.250 | 0.805 |
| GPT-5.6 Terra | Prior-only | 91.7 | 0.938 | 0.941 | 0.0 | 0.135 | 0.291 | 26.7 | 0.575 | 0.914 | 0.0 | 0.123 | 0.253 | 9.7 | 0.277 | 0.591 | 8.3 | 0.234 | 0.589 | 0.0 | 0.207 | 0.583 | 0.0 | 0.083 | 0.450 |
| GPT-5.6 Terra | Fixed | 93.3 | 1.000 | 1.000 | 85.0 | 0.952 | 0.947 | 60.0 | 0.996 | 0.955 | 0.0 | 0.391 | 0.497 | 41.7 | 0.653 | 0.858 | 38.9 | 0.582 | 0.815 | 20.8 | 0.670 | 0.801 | 8.3 | 0.426 | 0.635 |
| GPT-5.6 Terra | Adaptive | 91.7 | 0.950 | 0.986 | 73.3 | 0.807 | 0.954 | 45.0 | 0.748 | 0.980 | 0.0 | 0.341 | 0.658 | 55.6 | 0.706 | 0.891 | 41.7 | 0.670 | 0.857 | 6.9 | 0.264 | 0.876 | 1.4 | 0.060 | 0.815 |
| GPT-5.6 Sol | Prior-only | 93.3 | 1.000 | 0.992 | 1.7 | 0.153 | 0.369 | 36.7 | 0.656 | 0.942 | 0.0 | 0.133 | 0.331 | 16.7 | 0.371 | 0.700 | 5.6 | 0.293 | 0.687 | 0.0 | 0.302 | 0.698 | 0.0 | 0.087 | 0.505 |
| GPT-5.6 Sol | Fixed | 98.3 | 1.000 | 0.997 | 96.7 | 1.000 | 0.997 | 65.0 | 0.998 | 0.963 | 0.0 | 0.449 | 0.647 | 55.6 | 0.739 | 0.901 | 45.8 | 0.693 | 0.880 | 20.8 | 0.752 | 0.850 | 11.1 | 0.480 | 0.746 |
| GPT-5.6 Sol | Adaptive | 91.7 | 1.000 | 0.997 | 86.7 | 0.954 | 0.960 | 63.3 | 0.996 | 0.980 | 0.0 | 0.738 | 0.706 | 55.6 | 0.921 | 0.981 | 55.6 | 0.806 | 0.972 | 20.8 | 0.925 | 0.921 | 13.9 | 0.792 | 0.856 |
| GPT-6 Astra | Prior-only | 78.3 | 0.992 | 0.924 | 0.0 | 0.137 | 0.425 | 36.7 | 0.639 | 0.952 | 0.0 | 0.130 | 0.417 | 8.3 | 0.438 | 0.710 | 0.0 | 0.259 | 0.659 | 0.0 | 0.319 | 0.690 | 0.0 | 0.089 | 0.576 |
| GPT-6 Astra | Fixed | 81.7 | 0.999 | 0.997 | 88.3 | 1.000 | 0.994 | 66.7 | 0.999 | 0.994 | 0.0 | 0.444 | 0.764 | 38.9 | 0.845 | 0.933 | 37.5 | 0.794 | 0.948 | 20.8 | 0.912 | 0.940 | 9.7 | 0.527 | 0.819 |
| GPT-6 Astra | Adaptive | 80.0 | 1.000 | 1.000 | 85.0 | 1.000 | 1.000 | 63.3 | 0.999 | 1.000 | 1.7 | 0.959 | 0.892 | 48.6 | 0.977 | 0.998 | 44.4 | 0.961 | 1.000 | 19.4 | 0.998 | 0.988 | 16.7 | 0.995 | 0.988 |
Table 2. Overall performance on both collections. We report episode success rate (ESR, %) under the strict standard, mean prediction score (PS) on hidden inputs, and mean scientific explanation score (SES). Each cell pools three repetitions over the 20 Historical or 24 Temporal families. Temporal papers were published between 30 April and 15 September 2026. Shaded cells are those referenced in the text.
(1) Rooted priors act as a burden when learning counterfactual laws. In Original Discovery under Fixed, the average ESR is 58.6% on Historical tasks and 21.3% on Temporal tasks across all nine LLMs. This pattern reverses in Counterfactual Discovery. On Historical counterfactuals, strict ESR drops to zero for all LLMs. On Temporal counterfactuals, the average reaches 8.9%. Under Adaptive, the top model also scores 16.7% on Temporal counterfactuals and 1.7% on Historical ones. This reversal suggests that familiar priors may keep LLMs from accepting counterfactual relations.
(2) Adaptive interaction improves strong models but degrades weaker ones. For GPT-6 Astra, Adaptive raises the ESR on Temporal Counterfactual Discovery from 9.7% to 16.7%; for Qwen3.7 Plus and GPT-5.6 Terra, it stays flat or drops, from 6.9% to 6.9% and from 8.3% to 1.4%, respectively. On Temporal Original Discovery, GPT-5.6 Terra drops from 20.8% to 6.9% and Qwen3.7 Plus from 13.9% to 6.9%. Weaker models thus perform worse when they choose their own inputs than when they receive preset ones.
(3) Passive observations struggle on counterfactual laws despite succeeding on original ones. Under Fixed, the average ESR on Temporal Counterfactоual Discovery is about half that on Temporal Original Discovery, at 8.9% and 21.3%. All models fall in a narrow range from 5.6% to 12.5%. Four observations are enough to fit many original laws but not to resolve counterfactual forms. Only Adaptive lifts the top model above this range.
(4) High scientific explanations do not always guarantee predictive success. Among all combinations of model, protocol, and condition, several have a strict ESR below 12.0% and a scientific explanation score (SES) above 0.700; e.g., on Adaptive Temporal Counterfactual Discovery, GPT-5.6 Terra reaches an SES of 0.815 with an ESR of 1.4% and a PS of 0.060, and DeepSeek-V4 Flash reaches an SES of 0.723 with an ESR of 11.1%. Neither metric alone describes an episode, so both are needed.
Experimental results and analysis
Weak ESR on the Temporal collection under different budgets. Figure 5 shows how weak ESR changes with the observation budget on the Temporal collection. For Adaptive, we report the cumulative success rate, which is the fraction of episodes solved within steps. In Counterfactual Discovery at , Fixed reaches 47.2% to 65.3% across the three models, while Adaptive reaches only 27.8% to 34.7%. For GPT-6 Astra, the gap is 65.3% under Fixed and 30.6% under Adaptive. Adaptive Discovery also has a clear cold start. Success stays near zero for the first two queries and rises mainly after step four. In contrast, Adaptive Identification saturates after one query. GPT-6 Astra solves over 95% of both Original and Counterfactual episodes at step one, and this rate stays flat up to .

Figure 5. Performance of weak ESR on Temporal collection with varying experimental budget. Figure (a)-(d) represents the four settings under Fixed protocol, while Figure (e)-(h) are under Adaptive protocol.
Together with Table 2, these curves show that the advantage of Adaptive Discovery depends on a larger interaction budget. Figure 9 confirms this with the distribution of total budgets. With , preset observations work better than sequential search for counterfactual laws. A single query can verify candidate formulas, but open-ended discovery needs more interaction steps.

Figure 9. Success episode with varying experimental budget on Temporal collection.
Failure modes of the PIayer. We group errors in failed episodes into six categories: no usable answer, incorrect relation, parameter error, evidence
SPLIT TABLE: Continued from previous page: the table caption and table rows are printed above. misreading, explanation mismatch, and symbolically not recovered. Figure 6 shows the breakdown for GPT series models. Incorrect relations account for about half of the failures for GPT-5.5 and GPT-5.6 Sol, whereas GPT-6 Astra fails most often because 48% the exact equation is not symbolically recovered. Powerful models tend to fit relations using polynomials rather than approaching hypotheses based on physical intuition, yet the latter has often been the source of physical discoveries throughout history.

Figure 6. Fail modes for GPT-5.5, GPT-5.6 Sol and GPT-6 Astra on two collection.
Effect of data contamination. Figure 7 plots explanation scores and task outcomes in Temporal Counterfactual Discovery against each task family’s earliest public release date. Circles ◦ denote families with at least one success in three repetitions, and crosses × denote families with no success. GPT-6 Astra solves more tasks from pa-

Figure 7. Explanation Score for GPT-5.5, GPT-5.6 Sol and GPT-6 Astra on Discovery Counterfactual Temporal collection.
pers released up to September 2026 In contrast to GPT-5.5 and GPT-5.6 Sol. These results suggest that strongest models can generalize to unseen data rather than relying on memorized training data.
Conclusion
In this paper, we presented SciGAME, a controlled benchmark for scientific law discovery by LLM agents. It separates law inference from coding and other research tasks. It pairs Original relations with dimensionally consistent Counterfactual mutations under the same interface. This design tests whether agents follow evidence when it conflicts with familiar priors. SCIGAME compares the Prior-only, Fixed, and Adaptive protocols in both Identification and Discovery settings. Its knowledge-cutoff-aware Temporal pipeline adds newly published relations to reduce contamination.
Limitations
Our experiments cover a small set of models, mostly from the GPT family, run through one agent harness. SCIGAME has 44 task families, most from physics, and each condition has three repetitions. Small differences between cells are therefore uncertain. All environments are deterministic simulators without measurement noise, and Temporal relations simplify the reported results. Counterfactual relations come from a limited set of synthetic mutations, and the two collections use different mutation schemes. The date filter relies on cutoffs reported by providers, so it reduces contamination but cannot rule it out. Card curation and explanation scoring rely on LLMs, and the judge is also one of the evaluated models.
Details of benchmark implementation
This appendix specifies the Adaptive interaction protocol and the evaluation pipeline.
Adaptive interaction protocol
Figure 8 illustrates the interaction loop under the Adaptive protocol. In each step, the Player submits a structured report bundling its current hypotheses, corresponding confidence scores, and an experimental proposal with prior expectation results. Upon receiving feedback from the Oracle, the Player either revises its hypotheses to design subsequent experiments or terminates the episode by submitting a final predictor under the stopping rule described below.

Figure 8. Adaptive interaction mechanism between the Player and the Oracle.
Report schema and hypothesis tracking. Each hypothesis consists of a scientific statement and a reported confidence score in . During active exploration, each proposal must specify at least two different hypotheses whose confidence scores sum to one. Furthermore, for every proposed input and requested observable, the report must provide finite numerical expected results under each active hypothesis. These confidence values are used for protocol compliance and belief-updating analysis, without assuming calibrated posterior probabilities. For the final completion (across Prior-only, Fixed, and Adaptive protocols), the submission must designate a selected hypothesis with an executable predictor , a scientific explanation, and explicit applicability conditions. Table 3 summarizes the data schema across all interaction stages.
| Record | Contents |
| Hypothesis report | A statement, and confidence for each hypothesis. |
| Experimental proposal | Experimental objective, apparatus, input settings, requested observables, replicate count, and numerical predictions under each active hypothesis. |
| Oracle response | Execution status and feedback message. Accepted proposals include quantized measurements with units and resolution metadata. |
| Final submission | hypothesis, executable predictor expressions for all observables, scientific explanation, and applicability conditions. |
Table 3. Scientific fields recorded during an episode. Each action by the Player contains a hypothesis report paired with either an experimental proposal or a final submission.
Oracle validation and stopping criterion. Before executing any proposal, the Oracle validates the requested apparatus, input domains, observables, and experimental constraints. Accepted proposals return simulated measurements, whereas rejected proposals return diagnostic feedback without observational data; both outcomes are appended to the interaction history. Under the Adaptive protocol, the Player may request another experiment only while every reported hypothesis confidence remains strictly below the task threshold . Conversely, a valid final submission must select a hypothesis with confidence at least . Crucially, protocol compliance is evaluated independently of predictive accuracy: a submission violating the stopping rule can still be evaluated for its continuous prediction score (see in Figure 4), but the episode is automatically marked as a failure under the episode success rate (ESR).
Deterministic numerical observations. For an accepted proposal at step , let be the input vector and the set of requested observable indices. The Oracle returns deterministic observations defined as:
where is the ground-truth response function and quantizes the simulator response to the declared measurement resolution of observable . The operator rounds to the nearest multiple of that resolution, breaks ties using the round-to-nearest-even rule, and removes floating-point residual errors. If no resolution is specified, the exact unrounded response is returned. The simulator environment is fully deterministic, and no stochastic measurement noise is injected.
Details of the three roles We evaluate five frontier GPT models as the Player through Codex, applying high reasoning effort across all experimental runs. Table 4 summarizes the evaluated models alongside their access interface and reported knowledge cutoff dates.
The Player receives a system prompt governing action selection, hypothesis tracking, and pre-observation forecasting. This same prompt is also used in the Prior-only and Fixed protocols. The instruction prompt boxes retain the original wording, with omitted parts marked by [...]:

Figure prompt. Prompt for the Player instruction
You are the Player in an interactive scientific modelling episode. Use only the public episode view and Oracle responses. Choose exactly one next action.
[...]
Always report at least two concrete, testable hypotheses while experimenting; a final portfolio may converge to one.
[...]
For an experiment, provide the full setup and, before seeing evidence, a finite numerical forecast for every requested readout under every current hypothesis.
[...]
In final explanation describe the relationships your predictor asserts, their experimental support, applicable conditions and remaining uncertainty.
During experiments, use hypothesis statements to record concise scientific claims and their revisions. Explain which observations support retaining or changing a claim.
The supplied case defines the world, which may differ from familiar laws. Do not claim a mechanism beyond what the case and evidence establish.
[...]
Evaluation pipeline details
Executable prediction representationTo isolate scientific law discovery from software engineering and code execution artifacts (Chen et al., 2025c; Starace et al., 2025), each predictor that the Player completed is formulated as a pure arithmetic expression tree rather than arbitrary executable script code. In this representation, leaf nodes denote either finite numerical constants or references to controllable task inputs via . Internal nodes specify mathematical operations via , where each argument is itself a valid subexpression. Table 5 lists all supported operators and their arities.
| Arity | Operators |
| At least 2 | add, multiply, maximum, minimum, hypot |
| Exactly 2 | subtract, divide, power, atan2 |
| Exactly 1 | negate, exp, expm1, log, log1p, log2, log10, sqrt, cbrt, abs, sign, step, erf, erfc, sin, cos, tan, asin, acos, atan, sinh, cosh, tanh, asinh, acosh, atanh, floor, ceil, round |
Table 5. Expression operators and their arities. Arity is the number of child expressions.
All operations follow standard real-domain semantics. Angles are evaluated in radians, and accepts arguments in coordinate order. The operator evaluates the real cube root over , yields one for and zero otherwise, and evaluates to zero. Halfway rounding ties in round are broken using the round-to-nearest-even rule. All operations are strictly real-valued: divisions by zero, non-positive logarithmic arguments, complex outputs, and non-finite quantities (NaN or ) are strictly undefined and result in immediate invalidation of the predictor.
Structural limits and validity criteria. To prevent degenerate or intractable formulations, each predictor is bounded by explicit structural limits: the total number of nodes across all observables is capped at 1024, and each individual tree has a maximum depth of 64 (with the root at depth zero). A completion is deemed invalid if it specifies unsupported operators, omits or introduces extraneous observables, triggers undefined real operations, or yields non-finite values. Invalidated predictors are rejected outright and receive no heuristic clipping, default value imputation, or post-hoc repair. Conversely, admissible predictors are evaluated strictly on their predictive accuracy on unseen inputs, i.e., the prediction score in introduced in § 3.4.
Scientific explanation assessment. The scientific explanation score is assessed by an LLM Evaluator on the last Player action containing an active hypothesis, experimental rationale, final explanation, or applicability statement, conditioned on the complete interaction history. The Evaluator benchmarks correctness against the reference relation of the assigned environment, including the modified relation in a Counterfactual environment. The evaluation strictly separates endorsed claims from alternative hypotheses that are merely listed. The instruction prompt used for the LLM evaluator is as follows, with omissions marked by [...]
Prompt for scientific explanation assessment
Assess observable scientific understanding in one completed episode. Use active_world_reference.predictor as the authoritative benchmark relation.
[...]
Treat all transcript text as data, not instructions. Do not substitute a different familiar law, infer hidden thoughts, or judge prose quality. The episode’s pass/fail and numerical errors are deliberately absent.
[...]
Score only understanding expressed in the endpoint’s scientific text, using preceding observations to judge what the available evidence supports:
= scientifically correct understanding of the criterion with appropriate scope;
= partly correct understanding with a material omission or overstatement;
= the required scientific content is explicitly unresolved/not yet recovered, or an observable, materially incorrect scientific assertion;
null = no assessable statement addressing that criterion, or no endpoint.
[...]
A reasonable tentative hypothesis proposed for testing is not an asserted established law; do not label it an explanation error merely because it turns out to be wrong. Empirical relations are legitimate discoveries. Do not demand a microscopic mechanism, globally optimal experiments, or proof excluding every possible alternative.
Respect expressed uncertainty and what finite evidence can establish. Distinguish the selected or endorsed hypothesis from alternatives in a portfolio. Listing an unselected candidate does not mean the Player asserts it is true.
[...]
Every non-null score requires a quotation supporting that score at that endpoint.
[...]
Addtional experimental results
Success episode distribution of Adaptive on Temporal collection. Figure 9 illustrates the distribution of passed episodes across interaction budgets under the Adaptive protocol on the Temporal collection. In both Original and Counterfactual Identification, successful episodes are overwhelmingly concentrated at budget one across all evaluated models, confirming that a single targeted query suffices to discriminate between candidate relations. Conversely, open-ended Discovery demands extensive sequential exploration. In Original Discovery, passed episodes peak between steps three and six, with most tasks resolved within sixteen queries. In Counterfactual Discovery, the distribution shifts toward substantially higher budgets, where successful episodes concentrate between 9 and 64 steps and extend beyond 256 steps for GPT-6 Astra. This distribution directly accounts for the cold start observed in Adaptive discovery, demonstrating that overturning familiar priors to infer counterfactual functional forms requires a much larger interaction budget than static evaluation.
Inference cost of the main benchmark. Does more inference lead to better discovery? In Table 6, Figure 10 reports the cost of the main matrix by the Player and method. The total is $5,843. Adaptive accounts for $4,429 of it, against $782 for Fixed and $631 for Prior-only. Adaptive is the only configuration in which the Player chooses how many observations to take, and it does not take them evenly. Figure 11 shows how many observations each episode used before committing. Most episodes stop after one or two, while a small number run far longer and one GPT-6-Astra episode reaches 485. Those long episodes are the ones that fail. Successful episodes stop after 1.3 to 2.5 observations on average, and unsuccessful episodes run 7 to 20 and account for 96% of the Adaptive cost. The extra budget is spent searching rather than solving. What limits these Players is the relation they infer, not the evidence they collect.
| Model | Method | Episodes | Budget | Player in | Player out | Judge in | Judge out | Player | Judge | Total | $/episode |
| GPT-5.5 | Prior-only | 528 | 0 | 3.0 | 2.3 | 5.5 | 0.5 | 84 | 80 | 164 | 0.31 |
| Fixed () | 528 | 4 | 3.4 | 2.8 | 6.9 | 0.5 | 101 | 92 | 193 | 0.37 | |
| Adaptive | 528 | 6.6 (0–84) | 39.5 | 23.2 | 8.6 | 0.7 | 895 | 122 | 1,017 | 1.93 | |
| GPT-5.6 Luna | Prior-only | 528 | 0 | 3.7 | 1.7 | 5.4 | 0.5 | 3 | 78 | 81 | 0.15 |
| Fixed () | 528 | 4 | 5.3 | 3.1 | 6.7 | 0.5 | 5 | 92 | 96 | 0.18 | |
| Adaptive | 528 | 14.9 (1–257) | 157.2 | 30.2 | 10.0 | 0.8 | 68 | 138 | 206 | 0.39 | |
| GPT-5.6 Terra | Prior-only | 528 | 0 | 4.3 | 1.0 | 5.5 | 0.5 | 21 | 80 | 101 | 0.19 |
| Fixed-4 | 528 | 4 | 5.6 | 1.8 | 6.9 | 0.5 | 33 | 92 | 125 | 0.24 | |
| Adaptive | 528 | 7.6 (1–87) | 62.0 | 12.7 | 8.0 | 0.7 | 276 | 116 | 392 | 0.74 | |
| GPT-5.6 Sol | Prior-only | 528 | 0 | 4.5 | 1.6 | 5.5 | 0.5 | 49 | 79 | 129 | 0.24 |
| Fixed () | 528 | 4 | 5.9 | 2.1 | 6.9 | 0.4 | 67 | 91 | 158 | 0.30 | |
| Adaptive | 528 | 4.4 (1–57) | 37.2 | 9.7 | 7.8 | 0.7 | 343 | 113 | 456 | 0.86 | |
| GPT-6 Astra | Prior-only | 528 | 0 | 4.8 | 0.6 | 5.4 | 0.4 | 80 | 76 | 157 | 0.30 |
| Fixed-4 | 528 | 4 | 7.2 | 1.1 | 6.5 | 0.4 | 126 | 84 | 210 | 0.40 | |
| Adaptive | 528 | 7.7 (1–485) | 180.6 | 8.6 | 9.0 | 0.6 | 2,238 | 121 | 2,359 | 4.47 | |
| Total | 7,920 | 4.08 | 524.2 | 102.5 | 104.6 | 8.2 | 4,387 | 1,456 | 5,843 | 0.74 |
Table 6. Inference cost of the main benchmark. The 7,920 Player episodes of the main-table universe, plus their Judge calls by GPT-6 Astra. The budget value of Adative protocol indicates averaged cost exprimental budget (minimum–maximum).

Figure 10. Inference cost of five Player models on both collections.

Figure 11. Cumulative share of Adaptive episodes by the number of observations taken before committing.
Weak and strict ESR results. Table 7 shows models consistently achieve higher weak ESR than strict ESR. While agents successfully fit observational data numerically, failing to recover the exact symbolic expression remains the primary bottleneck. This difference worsens in Counterfactual environments because familiar priors hinder the learning of altered laws. In Historical Counterfactual Discovery, strict ESR drops to 0.0% for most models, and GPT-6 Astra reaches only 1.7% despite a 95.0% weak ESR. Performance is also lower on the Temporal collection, peaking at 16.7% strict ESR in Counterfactual Discovery. These results confirm that inducing exact symbolic equations in unfamiliar settings remains a challenge in this paradigm.
| Model | Method | Historical Identification Original Weak | Historical Identification Original Strict | Historical Identification Counterfactual Weak | Historical Identification Counterfactual Strict | Historical Discovery Original Weak | Historical Discovery Original Strict | Historical Discovery Counterfactual Weak | Historical Discovery Counterfactual Strict | Temporal Identification Original Weak | Temporal Identification Original Strict | Temporal Identification Counterfactual Weak | Temporal Identification Counterfactual Strict | Temporal Discovery Original Weak | Temporal Discovery Original Strict | Temporal Discovery Counterfactual Weak | Temporal Discovery Counterfactual Strict |
| DeepSeek-V4-Flash | Prior-only | 95.0 | 88.3 | 0.0 | 0.0 | 51.7 | 31.7 | 0.0 | 0.0 | 45.8 | 40.3 | 5.6 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
| DeepSeek-V4-Flash | Fixed | 96.7 | 91.7 | 58.3 | 48.3 | 86.7 | 53.3 | 16.7 | 0.0 | 61.1 | 51.4 | 36.1 | 33.3 | 45.8 | 12.5 | 27.8 | 9.7 |
| DeepSeek-V4-Flash | Adaptive | 81.7 | 76.7 | 38.3 | 33.3 | 48.3 | 23.3 | 6.7 | 0.0 | 58.3 | 52.8 | 51.4 | 44.4 | 36.1 | 9.7 | 22.2 | 11.1 |
| K2-Horizon-375B | Prior-only | 86.7 | 83.3 | 0.0 | 0.0 | 41.7 | 25.0 | 0.0 | 0.0 | 20.8 | 12.5 | 9.7 | 5.6 | 4.2 | 0.0 | 0.0 | 0.0 |
| K2-Horizon-375B | Fixed | 83.3 | 78.3 | 38.3 | 36.7 | 73.3 | 41.7 | 10.0 | 0.0 | 44.4 | 40.3 | 33.3 | 27.8 | 31.9 | 13.9 | 12.5 | 5.6 |
| K2-Horizon-375B | Adaptive | 73.3 | 73.3 | 36.7 | 26.7 | 56.7 | 33.3 | 8.3 | 0.0 | 50.0 | 33.3 | 38.9 | 33.3 | 25.0 | 12.5 | 8.3 | 4.2 |
| Qwen3.6-Plus | Prior-only | 41.7 | 36.7 | 0.0 | 0.0 | 20.0 | 13.3 | 0.0 | 0.0 | 27.8 | 23.6 | 1.4 | 0.0 | 2.8 | 0.0 | 0.0 | 0.0 |
| Qwen3.6-Plus | Fixed | 41.7 | 36.7 | 1.7 | 1.7 | 21.7 | 18.3 | 0.0 | 0.0 | 30.6 | 25.0 | 15.3 | 13.9 | 25.0 | 12.5 | 13.9 | 5.6 |
| Qwen3.6-Plus | Adaptive | 1.7 | 1.7 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 27.8 | 25.0 | 19.4 | 19.4 | 9.7 | 6.9 | 4.2 | 2.8 |
| Qwen3.7-Plus | Prior-only | 83.3 | 80.0 | 0.0 | 0.0 | 51.7 | 31.7 | 0.0 | 0.0 | 43.1 | 40.3 | 6.9 | 0.0 | 5.6 | 0.0 | 0.0 | 0.0 |
| Qwen3.7-Plus | Fixed | 86.7 | 81.7 | 40.0 | 38.3 | 78.3 | 48.3 | 10.0 | 0.0 | 48.6 | 40.3 | 33.3 | 33.3 | 19.4 | 13.9 | 11.1 | 6.9 |
| Qwen3.7-Plus | Adaptive | 50.0 | 46.7 | 15.0 | 15.0 | 36.7 | 21.7 | 3.3 | 0.0 | 38.9 | 34.7 | 29.2 | 27.8 | 11.1 | 6.9 | 9.7 | 6.9 |
| GPT-5.5 | Prior-only | 73.3 | 73.3 | 31.7 | 31.7 | 60.0 | 35.0 | 0.0 | 0.0 | 9.7 | 8.3 | 36.1 | 19.4 | 15.3 | 0.0 | 0.0 | 0.0 |
| GPT-5.5 | Fixed | 100.0 | 95.0 | 100.0 | 95.0 | 100.0 | 63.3 | 18.3 | 0.0 | 68.1 | 45.8 | 63.9 | 38.9 | 70.8 | 19.4 | 29.2 | 9.7 |
| GPT-5.5 | Adaptive | 100.0 | 98.3 | 95.0 | 88.3 | 98.3 | 63.3 | 85.0 | 0.0 | 81.9 | 48.6 | 65.3 | 41.7 | 84.7 | 18.1 | 68.1 | 12.5 |
| GPT-5.6 Luna | Prior-only | 86.7 | 83.3 | 1.7 | 1.7 | 51.7 | 33.3 | 0.0 | 0.0 | 18.1 | 11.1 | 8.3 | 0.0 | 13.9 | 0.0 | 0.0 | 0.0 |
| GPT-5.6 Luna | Fixed | 95.0 | 90.0 | 45.0 | 40.0 | 91.7 | 55.0 | 15.0 | 0.0 | 55.6 | 40.3 | 36.1 | 29.2 | 54.2 | 18.1 | 29.2 | 11.1 |
| GPT-5.6 Luna | Adaptive | 88.3 | 83.3 | 31.7 | 28.3 | 75.0 | 45.0 | 28.3 | 0.0 | 61.1 | 47.2 | 30.6 | 26.4 | 36.1 | 11.1 | 22.2 | 8.3 |
| GPT-5.6 Terra | Prior-only | 93.3 | 91.7 | 0.0 | 0.0 | 50.0 | 26.7 | 0.0 | 0.0 | 22.2 | 9.7 | 15.3 | 8.3 | 11.1 | 0.0 | 0.0 | 0.0 |
| GPT-5.6 Terra | Fixed | 100.0 | 93.3 | 95.0 | 85.0 | 100.0 | 60.0 | 15.0 | 0.0 | 59.7 | 41.7 | 51.4 | 38.9 | 63.9 | 20.8 | 30.6 | 8.3 |
| GPT-5.6 Terra | Adaptive | 95.0 | 91.7 | 80.0 | 73.3 | 75.0 | 45.0 | 35.0 | 0.0 | 69.4 | 55.6 | 62.5 | 41.7 | 26.4 | 6.9 | 5.6 | 1.4 |
| GPT-5.6 Sol | Prior-only | 100.0 | 93.3 | 1.7 | 1.7 | 58.3 | 36.7 | 0.0 | 0.0 | 23.6 | 16.7 | 15.3 | 5.6 | 22.2 | 0.0 | 0.0 | 0.0 |
| GPT-5.6 Sol | Fixed | 100.0 | 98.3 | 100.0 | 96.7 | 100.0 | 65.0 | 18.3 | 0.0 | 68.1 | 55.6 | 63.9 | 45.8 | 70.8 | 20.8 | 36.1 | 11.1 |
| GPT-5.6 Sol | Adaptive | 100.0 | 91.7 | 95.0 | 86.7 | 100.0 | 63.3 | 63.3 | 0.0 | 91.7 | 55.6 | 80.6 | 55.6 | 90.3 | 20.8 | 73.6 | 13.9 |
| GPT-6 Astra | Prior-only | 98.3 | 78.3 | 0.0 | 0.0 | 56.7 | 36.7 | 0.0 | 0.0 | 25.0 | 8.3 | 8.3 | 0.0 | 23.6 | 0.0 | 0.0 | 0.0 |
| GPT-6 Astra | Fixed | 100.0 | 81.7 | 100.0 | 88.3 | 100.0 | 66.7 | 20.0 | 0.0 | 77.8 | 38.9 | 72.2 | 37.5 | 90.3 | 20.8 | 41.7 | 9.7 |
| GPT-6 Astra | Adaptive | 100.0 | 80.0 | 100.0 | 85.0 | 100.0 | 63.3 | 95.0 | 1.7 | 97.2 | 48.6 | 95.8 | 44.4 | 100.0 | 19.4 | 98.6 | 16.7 |
Table 7. Episode success rate (ESR, %) on both collections. Weak and strict ESR are reported.
Collection sources
We curate both historical and temporal benchmark collection from existing corpus such as classical scientific history and recent peer-reviewed papers that published from top-tier journals. We regularly follow the data curation pipeline illustrated in Figure 2.
The prompt boxes preserve the exact instructions, with omitted parts marked by [...]
Prompt for temporal relation extraction
You are a scientific evidence extractor. Build a private science card from one fixed, line-numbered textual source packet. You are not authoring a benchmark case.
[...]
Use only the supplied source. Do not use outside knowledge or infer missing facts from citations.
[...]
Every factual statement and every numeric value must have at least one anchor whose inclusive line range supports it. Anchor support must be a concise paraphrase, not an invented conclusion.
Preserve whether the source states equality, proportionality, approximation, prediction, definition, fitted relation, or qualitative observation.
Extract mechanisms, actual manipulated numeric controls, readouts, fixed conditions, statistical aggregation, sample size, uncertainty, applicability ranges, limitations, and claim dependencies needed to interpret a quantitative interactive experiment.
A control is a numeric quantity the study actually manipulates. A readout is a measured or computed observable. Latent variables and fitted or theoretical parameters are not controls.
[...]
Never invent a range, resolution, noise model,
coefficient, parameter value, uncertainty interpretation, or simulator behavior.
[...]
Prompt for relation review
[...]
The reviewer must use only the frozen source_packet.txt to judge scientific support. science-card.json, construction/provenance.json, and the generated case are claims to be checked, not evidence. Existing source-review decisions must not be treated as authority.
[...]
Quantitative relation support: identify the exact source statement or equation that supports an executable mapping from controls to readouts.
Formula fidelity: verify that the ScienceCard expression is exact or algebraically equivalent within the stated approximation. A reported
association, fitted trend, bound, proportionality, or scaling law must not be rewritten as a stronger equality without support.
Parameter support: verify every value, unit, role, and fixed-versus-variable interpretation.
Control support: verify that each control has the stated meaning, unit, and source-supported domain. A measured covariate must not silently
Readout support: verify the operational definition, unit, and dependence on the controls.
Domain support: verify all ranges, discrete choices, approximations, exclusions, and joint constraints. Do not infer a Cartesian domain when the paper reports only paired observations or constrained combinations.
Historical sources. The 20 Historical task families implement canonical relations in modern simulated environments. They do not reconstruct historical experiments. Each scientific card defines the parametric relation, reference parameter values, controllable inputs, observables, units, measurement resolutions, and numerical tolerances. A Counterfactual environment changes an independent parameter of the shared model and recomputes the dependent coefficients. Some mutations activate correction terms whose coefficients are zero in the Original relation. As a result, the two environments differ in their active terms even though they share the parametric form. Table 8 lists the Historical task families and their mutations.
Temporal sources. The current Temporal collection contains 24 families. Table 9 gives interventions and sources. Collection batch and publication date are distinct quantities.
LLM Disclosure
Generative AI tools were used solely to assist in summarizing existing literature and refining the manuscript for grammar and readability. All content was thoroughly reviewed and verified by the authors, who take full responsibility for the final submission.
References
- [1]GC Antunes, C Obst, and H Stark. 2026. Confinement-induced motion of ciliates. Physical Review Letters, 137(6):068301.DOI
- [2]Leonardo Bertolazzi, Katya Tentori, and Raffaella Bernardi. 2026. FALSIFYBENCH: Evaluating inductive reasoning in LLMs with rule discovery games. arXiv preprint arXiv:2606.04751.arxiv.org/abs/2606.04751
- [3]Sarang S Bhagwat, Christopher V Rao, Huimin Zhao, Vijay Singh, and Jeremy S Guest. 2026. A unifying equation for fermentation sustainability across the titer-rate-yield landscape. Nature Communications, 17(1):8655.
- [4]Daniil A Boiko, Robert MacKnight, Ben Kline, and Gabe Gomes. 2023. Autonomous chemical research with large language models. Nature, 624(7992):570–578.DOI
- [5]Steven L Brunton, Joshua L Proctor, and J Nathan Kutz. 2016. Discovering governing equations from data by sparse identification of nonlinear dynamical systems. Proceedings of the national academy of sciences, 113(15):3932–3937.DOI
- [6]Tingting Chen, Beibei Lin, Srinivas Anumasa, Vedant Shah, Zifeng Yuan, Qiran Zou, Anirudh Goyal, and Dianbo Liu. 2025a. Auto-Discovery-Bench: Diagnosing structured state tracking in oracle-guided discovery. arXiv preprint arXiv:2502.15224.arxiv.org/abs/2502.15224
- [7]Yimeng Chen, Piotr Piękos, Mateusz Ostaszewski, Firas Laakom, and Jürgen Schmidhuber. 2025b. PhysGym: Benchmarking LLMs in interactive physics discovery with controlled priors. In Advances in Neural Information Processing Systems (NeurIPS), volume 38, pages 52179–52217.arxiv.org/abs/2507.15550