Skip to content

feat: diseq splitting and non-chronological backtracking for linarith #8733

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 8 commits into from
Jun 12, 2025
Merged

feat: diseq splitting and non-chronological backtracking for linarith #8733

leodemoura merged 8 commits into from
Jun 12, 2025

Conversation

@leodemoura
Copy link
Member

@leodemoura leodemoura commented Jun 12, 2025

This PR implements disequality splitting and non-chronological backtracking for the grind linarith procedure.

example [IntModule α] [LinearOrder α] [IntModule.IsOrdered α] (a b c d : α)
    : a ≤ b → a - c ≥ 0 + d → d ≤ 0 → d ≥ 0 → b = c → a ≠ b → False := by
  grind

@leodemoura leodemoura added the changelog-language Language features and metaprograms label Jun 12, 2025
@leodemoura leodemoura enabled auto-merge June 12, 2025 02:12
@leodemoura leodemoura added this pull request to the merge queue Jun 12, 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 12, 2025
@leanprover-community-bot
Copy link
Collaborator

leanprover-community-bot commented Jun 12, 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 a7af9f7d5f6580071434d499e97ddbcccafb1a59 --onto 0a9c24649767dea857a388e5385b7ae94bfd0185. You can force Mathlib CI using the force-mathlib-ci label. (2025-06-12 02:56:11)

Merged via the queue into master with commit e7549b5 Jun 12, 2025
15 checks passed
algebraic-dev pushed a commit to algebraic-dev/lean4 that referenced this pull request Jun 18, 2025
@leodemoura @algebraic-dev
feat: diseq splitting and non-chronological backtracking for linarith (…
efe9956 
…leanprover#8733)

This PR implements disequality splitting and non-chronological
backtracking for the `grind` linarith procedure.
```lean
example [IntModule α] [LinearOrder α] [IntModule.IsOrdered α] (a b c d : α)
    : a ≤ b → a - c ≥ 0 + d → d ≤ 0 → d ≥ 0 → b = c → a ≠ b → False := by
  grind
```
wkrozowski pushed a commit to wkrozowski/lean4 that referenced this pull request Jun 24, 2025
@leodemoura @wkrozowski
feat: diseq splitting and non-chronological backtracking for linarith (…
c94d394 
…leanprover#8733)

This PR implements disequality splitting and non-chronological
backtracking for the `grind` linarith procedure.
```lean
example [IntModule α] [LinearOrder α] [IntModule.IsOrdered α] (a b c d : α)
    : a ≤ b → a - c ≥ 0 + d → d ≤ 0 → d ≥ 0 → b = c → a ≠ b → False := 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