Skip to content

feat: model based theory combination for grind mbtc #8759

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Merged
leodemoura merged 2 commits into from
Jun 13, 2025
Merged

feat: model based theory combination for grind mbtc #8759

leodemoura merged 2 commits into from
Jun 13, 2025

Conversation

@leodemoura
Copy link
Member

@leodemoura leodemoura commented Jun 13, 2025

This PR implements model-based theory combination for grind linarith. Example:

example [CommRing α] [LinearOrder α] [Ring.IsOrdered α] (f : α → α → α) (x y z : α)
    : z ≤ x → x ≤ 1 → z = 1 → f x y = 2 → f 1 y = 2 := by
  grind

@leodemoura leodemoura added the changelog-language Language features and metaprograms label Jun 13, 2025
@leodemoura leodemoura enabled auto-merge June 13, 2025 00:59
@leodemoura leodemoura added this pull request to the merge queue Jun 13, 2025
@github-actions github-actions bot added the toolchain-available A toolchain is available for this PR, at leanprover/lean4-pr-releases:pr-release-NNNN label Jun 13, 2025
@leanprover-community-bot
Copy link
Collaborator

leanprover-community-bot commented Jun 13, 2025

Mathlib CI status (docs):

  • ❗ Batteries/Mathlib CI will not be attempted unless your PR branches off the nightly-with-mathlib branch. Try git rebase d4b17b9fd2ceac558dad498d978eb17d7d496484 --onto faffe863343211d03d07d4ef19d90a2aa9d6fc8c. You can force Mathlib CI using the force-mathlib-ci label. (2025-06-13 01:26:17)

auto-merge was automatically disabled June 13, 2025 01:30

Pull Request is not mergeable

Merged via the queue into master with commit 140a633 Jun 13, 2025
19 checks passed
algebraic-dev pushed a commit to algebraic-dev/lean4 that referenced this pull request Jun 18, 2025
@leodemoura @algebraic-dev
feat: model based theory combination for grind mbtc (leanprover#8759)
c8a4c7c 
This PR implements model-based theory combination for grind linarith.
Example:
```lean
example [CommRing α] [LinearOrder α] [Ring.IsOrdered α] (f : α → α → α) (x y z : α)
    : z ≤ x → x ≤ 1 → z = 1 → f x y = 2 → f 1 y = 2 := by
  grind
```
wkrozowski pushed a commit to wkrozowski/lean4 that referenced this pull request Jun 24, 2025
@leodemoura @wkrozowski
feat: model based theory combination for grind mbtc (leanprover#8759)
520daed 
This PR implements model-based theory combination for grind linarith.
Example:
```lean
example [CommRing α] [LinearOrder α] [Ring.IsOrdered α] (f : α → α → α) (x y z : α)
    : z ≤ x → x ≤ 1 → z = 1 → f x y = 2 → f 1 y = 2 := by
  grind
```
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

No reviews

Assignees

No one assigned

Labels

changelog-language Language features and metaprograms toolchain-available A toolchain is available for this PR, at leanprover/lean4-pr-releases:pr-release-NNNN

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

3 participants

@leodemoura @leanprover-community-bot