Skip to content
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.

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

llvm: BitVec.xor_neg_one will enable ring_nf to be more powerful #308

Open
tobiasgrosser opened this issue May 15, 2024 · 3 comments
Open
Assignees
Labels

Comments

@tobiasgrosser
Copy link
Collaborator

tobiasgrosser commented May 15, 2024

The pattern a ^^^ (-1#w) = (-1#w) - a arises several times in AliveStatements. Proofing it will in certain cases enable ring to close goals, but it also breaks certain extensionality proofs. We may want to use it carefully (meaning, only after the ext proof in alive_auto has been executed).

This should resolve four theorems.

@bollu
Copy link
Collaborator

bollu commented May 15, 2024

Right. This is the type of thing that wants us to write an ad-hoc proof procedure, which tries multiple styles of proof, since there’s no good “normal form” for all cases we want to cover.

@tobiasgrosser
Copy link
Collaborator Author

This lemma appears in theorem bitvec_AddSub_1560 and might be a good next one for @eurquhart1.

@emmau678
Copy link
Contributor

Hi, I was just checking through and I see this was assigned to me and looks like it remains open (if so, I can try to complete it if it would still be useful?)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

4 participants