Repository navigation
Prefer relevant evidence induction in search - #6
Merged
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Search can spend its budget on data induction before trying induction on a relevant hypothesis. Prefer evidence induction when the head predicate of the hypothesis occurs in the target.
This adds a small
InductionPlan.evidenceFirstadapter over the existingHooks.orderinterface and applies it to search mode. It stably partitions each candidate batch after the existing ordering. Every alternative remains available, and order within each partition is preserved. Batches without evidence induction take the original path. Committed mode, inference operations, effort accounting, and the trial schedule are unchanged.The relevance test uses the weak-head-normalized hypothesis type and syntactic constants in the target. The source comment describes its limitations: hidden predicates can be missed and incidental occurrences can be preferred. There are no theorem-specific rules or numeric thresholds.
Validation
kj(lake test, 60 targets, exit 0). GitHub CI passed, including the Lean 4.30.0 / 4.33.1 matrix and website checks.Those timings are single observations of the equivalent ordering prototype on the PR #5 base with premise retrieval off, not a repeated speedup estimate or a new measurement of this clean integration. This PR is independently based on main and includes neither premise selection nor the unsuccessful bounded-contour experiments.