System-Intrinsic Instantiation

• System-intrinsic instantiation is a framework where instance generation stems from the inherent structure of a system, ensuring observer-independent operations.
• It employs internal architectures such as solver-native calculus, layered memory models, and proof-net geometry to derive instances efficiently.
• Applications include reference-based agent replication in AI, complete SMT quantifier instantiation, and atomization in System F, each reducing external preprocessing.

Searching arXiv for the cited works and the term to ground the article in the provided literature. arxiv_search(query="^^^^^^^^5\5 Instantiation^^^^^^^^5\5 OR ^^^^^^^^5\5 OR ^^^^^^^^5\5 Computational Functionalism^^^^^^^^5\5 OR ^^^^^^^^5\5 of SMT problems modulo Integers^^^^^^^^5\5 OR ^^^^^^^^5\5 Hard Mizar Problems with Instantiation and Strategy Invention^^^^^^^^5\5 max_results=^^^^5 OR \5\5^^^^) System-intrinsic instantiation is a family of technical ideas in which instantiation is determined by a system’s own internal organization rather than by external reconstruction, ad hoc preprocessing, or observer-imposed labeling. In contemporary literature, the term appears in several non-equivalent but structurally related settings: as solver-native instance generation in SMT and automated theorem proving, as internal atomization of universal instantiation in System F, as reference-based spawning of stateful AI agents, and as an observer-independence criterion for computational organization. Across these settings, the recurring issue is whether the instantiated entity, proof step, or computational property is fixed by the system’s calculus, proof geometry, shared substrate, or intervention-conditional dynamics, rather than by an external description (&&&^^^^5\5^^^^&&&, &&&^^^^5 OR \5^^^^&&&, &&&^^^^5 OR \5^^^^&&&, &&&^^^^5 OR \5^^^^&&&, &&&^^^^5 OR \5^^^^&&&, Ma et al., 4 Jun 2026).

^^^^5 OR \5^^^^. Conceptual profile

A central contrast in this literature is between instantiation as external assembly and instantiation as an operation intrinsic to an existing structure. In SMT modulo integers, instantiation is described as “not an external preprocessing hack” but as something derived from the structure of the solving calculus itself: arithmetic constraints determine which terms must be considered, and the background theory PRESERVED_PLACEHOLDER_^^^^5\5^^^^ is then handled by an instantiation scheme complete for PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^ (&&&^^^^5\5^^^^&&&). In the systems literature on stateful AI agents, the contrast is between “materialization-heavy instantiation,” which reloads and copies inherited role definition, tool bindings, memory, policy, and context, and “reference-based replication,” in which a new instance is a lightweight reference record over stable shared definitions and layered memory (&&&^^^^5 OR \5^^^^&&&). In the philosophy of computation, the contrast is between properties that depend on an observer’s labels and properties that are “specifiable without an observer’s labelling” and “invariant under structure-preserving relabellings of the system’s variables” (Ma et al., 4 Jun 2026).

The phrase therefore does not denote a single algorithm. It names a recurrent requirement: the instantiated object or property must be grounded in the system’s own organization. In one line of work that organization is a clause calculus; in another it is a proof-net geometry; in another it is a reference substrate and layered memory model; and in another it is a state-space structure under intervention. A common misconception is that these uses are merely terminological variants. The literature instead treats them as distinct formal programs linked by a shared rejection of externally imposed or materially duplicated instantiation.

^^^^5 OR \5^^^^. Reference-based agent instantiation

In stateful AI infrastructure, system-intrinsic instantiation is developed most explicitly by Aethon, which redefines instantiation as a “reference-based replication primitive” for stateful agents. Rather than rebuilding an agent as a standalone object, Aethon represents each instance as a compositional view over a stable definition, inherited memory layers, local instance memory, and contextual bindings: PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^ where PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^ is the canonical stable definition, PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^ the shared or inherited memory layers, $M_i$ the local instance memory, and $C_i$ the contextual bindings. On this account, instantiation is “identity creation plus reference registration,” not full reconstruction. The architecture is separated into a definition substrate, a reference substrate, and a resolution substrate. The definition substrate stores durable, versioned role identity, behavioral instructions, tool or capability declarations, policy constraints, interface contracts, and introspection metadata; the reference substrate stores the minimal executable identity, including a pointer or handle to the canonical definition, scope information, inherited memory references, local overlays or deltas, and lineage and version metadata; and the resolution substrate composes the effective execution view at run time by retrieving the relevant definition, composing inherited memory layers, applying overlays, and enforcing scope and access constraints. The memory model is layered rather than monolithic, with platform or organizational memory, lineage or family memory, user or account or session memory, and branch-local transient state, together with copy-on-write semantics so that duplication tracks actual divergence rather than the mere possibility of divergence. Under the assumption that inherited layers are not duplicated, instantiation is presented as $O(1)$ with respect to inherited structure, while memory growth is driven primarily by local overlays. The same design is used to motivate fan-out and fan-in workflows, task-specialized subagents, scoped permissions, lineage-aware debugging, reproducibility, rollback, policy enforcement, privacy boundaries, and versioned behavior; the claimed point is that reference-based instantiation is “not merely an optimization,” but a more appropriate abstraction for production-scale agentic software (&&&^^^^5 OR \5^^^^&&&).

^^^^5 OR \5^^^^. Solver-native quantifier instantiation

In SMT, system-intrinsic instantiation denotes a complete, theory-aware instantiation discipline internal to the solver architecture. The framework of “Instantiation of SMT problems modulo Integers” treats formulas over linear integer arithmetic and a background theory $T$ by a two-stage procedure. First, integer variables are instantiated using an arithmetic-aware scheme over $Z$-clauses PRESERVED_PLACEHOLDER_^^^^5 OR \5\5^^^^, where the arithmetic part is isolated and every integer term in the non-arithmetic part is a variable. Then the remaining non-arithmetic variables are instantiated using a scheme complete for PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^. The paper gives abstraction atoms of the form PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^, defines PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^-closed clauses, proves equivalence results for abstraction atoms, constructs bound sets PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^ for inequality formulas, and states completeness theorems showing that integer variables can be eliminated by instantiation with a finite set of ground terms. The main arithmetic result, Theorem ^^^^5 OR \55^^^^, yields equisatisfiability between the original set and a finitely instantiated one under preconstrainedness and boundedness conditions; Theorem ^^^^5 OR \5^^^^9 then justifies applying a second admissible PRESERVED_PLACEHOLDER_^^^^5 OR \55^^^^-instantiation scheme, provided it satisfies monotonicity and independence under adding unrelated equalities. The outcome is a ground problem equisatisfiable with the original, and the method is presented as generic, complete under suitable conditions, and often much smaller than generic full grounding (&&&^^^^5\5^^^^&&&).

In automated theorem proving, the same general idea appears as built-in quantifier reasoning in cvc5. A quantified formula PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^6 produces lemmas

PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^7

with existential quantifiers removed by Skolemization, and the solver alternates between checking a ground abstraction and adding instances suggested by the current model or ground state. The mechanism is explicitly described as “a direct application of Herbrand’s theorem” and contrasted with superposition-style saturation. The internal heuristics include e-matching, enumerative instantiation, conflict-based quantifier instantiation (CBQI), relational triggers, trigger selection policies, quantifier splitting, macro handling, and term database filtering. On the Mizar/MPTP benchmark family, this instantiation-based regime, combined with automated strategy invention via Grackle and alternative clausification, solved ^^^^5 OR \5\5 OR \5 OR \5^^^^ previously ATP-unproved hard problems, raising the ATP-proved share from 75.5% to 8^^^^5\5^^^^.7%; at 6^^^^5\5\5^^^^ seconds, the best invented strategy solved ^^^^5 OR \5 OR \5^^^^96 problems, compared with ^^^^5 OR \5\55^^^^9 for the best CASC baseline strategy, a ^^^^5 OR \5 OR \5^^^^.^^^^5 OR \5^^^^% improvement. The same study emphasizes that e-matching is incomplete and may return unknown, that success often depends on “a combination of enumerative instantiations with an appropriate trigger selection for e-matching,” and that clausification is part of the search space rather than a mere preprocessing detail (&&&^^^^5 OR \5^^^^&&&).

^^^^5 OR \5^^^^. Atomicity, atomization, and overflow in System F

In proof theory, system-intrinsic instantiation is analyzed through restrictions on universal elimination and internal conversions that recover stronger forms of instantiation from weaker ones. In System F, universal instantiation is given by

PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^8

whereas the fragment PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^9 allows only atomic instantiation,

PRESERVED_PLACEHOLDER_^^^^5 OR \5\5^^^^

“The Russell-Prawitz embedding and the atomization of universal instantiation” studies new atomization conversions that replace non-atomic instantiation by equivalent reductions toward atomic ones. For plain universal instantiation, the conversions include

PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^

with corresponding rules for terms arising from the Russell-Prawitz disjunction encoding. These conversions are used to explain why the Russell-Prawitz translation of intuitionistic propositional logic into System F strictly simulates proof reduction, while the direct translation into PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^ does not. The direct PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^ translation is instead the atomic normal form of the Russell-Prawitz translation under atomization, and atomization is shown to be contained in the equality generated by PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^, so it is not stronger than dinaturality (&&&^^^^5 OR \5^^^^&&&).

A related but distinct line concerns instantiation overflow. “Proof nets and the instantiation overflow property” studies types PRESERVED_PLACEHOLDER_^^^^5 OR \55^^^^ for which all instances of full comprehension can be deduced from atomic comprehension. A type has instantiation overflow when, for every type PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^6, there exists an expansion term

PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^7

typable in PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^8. For Russell-Prawitz types, the expansion terms are equivalent, modulo dinaturality, to direct full-instantiation terms, and proof nets are used to characterize when expansion is geometrically possible. The main characterization states that for simple PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^9,

PRESERVED_PLACEHOLDER_^^^^5 OR \5\5^^^^

The geometric analysis proceeds through pairings of occurrences of PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^, internal edges, interpolation, and collapse, with the upshot that the overflow property is controlled by the internal proof-net structure rather than by any external semantic stipulation (&&&^^^^5 OR \5^^^^&&&).

5. Observer-independence and intervention

In intrinsic computational functionalism, system-intrinsic instantiation is elevated from a proof-theoretic or systems-engineering device to a criterion for observer-independent computation. Criterion PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^ states that the relevant property must be “specifiable without an observer’s labelling” and “invariant under structure-preserving relabellings of the system’s variables.” A relabelling is a renaming or permutation that leaves the transition structure and intervention-conditional behavior unchanged. Criterion PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^ then requires “causal-dynamical organisation under intervention”: the property must be grounded in a state-space structure whose variables mutually constrain one another, and this organization must appear in counterfactual response under intervention. The framework is articulated through a three-tier decomposition of identification work: tier (i), interpreter-relative label selection; tier (ii), theoretically constrained partition selection; and tier (iii), dynamics-internal grain selection. Anti-computational arguments, including syntax-is-not-semantics, mapmaker, and observer-relativity objections, are taken to succeed against tier (i) views, but not automatically against tier (iii), where the relevant structure is fixed by intervention-conditional dynamics. The examples are chosen to mark the boundary sharply: a Hopfield attractor network satisfies PRESERVED_PLACEHOLDER_^^^^5 OR \5 OR \5^^^^ and PRESERVED_PLACEHOLDER_^^^^5 OR \55^^^^ in a minimal formal sense; a lookup table and a recorded trace fail PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^6 because they lack the required internal organization or counterfactual profile; and standard transformer inference is described as doubtful as a candidate for the kind of organized, temporally extended structure that PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^7 requires (Ma et al., 4 Jun 2026).

6. Terminological boundaries and related usage

A distinct use of instantiation occurs in computational linguistics, where it denotes the lexical relation between an entity-denoting expression and a category-denoting expression, formalized as set membership PRESERVED_PLACEHOLDER_^^^^5 OR \5^^^^8. On this usage, Marie Curie – scientist and Mumbai – city are instantiation pairs, whereas scientist – person is a case of hypernymy. The relation is studied as a binary classification problem over entity–category pairs, with a dataset containing 5,^^^^5 OR \5^^^^69 positive pairs, ^^^^5 OR \5^^^^,75^^^^5\5^^^^ unique entities, and 577 unique categories; the evaluation uses zero lexical overlap between train, validation, and test to avoid memorization, and compares concept-based category embeddings with centroid-based representations derived from the entities instantiating the category. The reported result is that entities belonging to one category form a region in distributional space, while the category word embedding often lies outside that region, so centroid-based category representations improve performance, especially on the hardest in-class confounders (&&&^^^^5 OR \55^^^^&&&).

This linguistic usage is conceptually separate from system-intrinsic instantiation in logic, AI systems, and computational functionalism. It concerns an entity–category semantic relation, not a system-native mechanism for producing instances. This suggests that the qualifier system-intrinsic performs an important disambiguating role: it marks those literatures in which the central question is not merely whether something is an instance, but whether the instantiation is fixed by the internal structure of the system itself.