task_id stringlengths 21 23 | challenge_id stringlengths 16 16 | proof_assistant stringclasses 1
value | session stringclasses 1
value | repo stringclasses 57
values | revision stringclasses 57
values | file_path stringlengths 13 92 | theory stringlengths 1 48 | variant int64 0 132 | challenge_type stringclasses 1
value | difficulty null | count null | by_centrality bool 1
class | ablation_prob float64 0.5 0.5 | min_depth int64 1 1 | max_depth int64 1 1 | leaves_only bool 1
class | min_size int64 0 0 | max_size stringclasses 1
value | min_centrality int64 0 0 | max_centrality stringclasses 1
value | seed int64 42 42 | n_proofs int64 1 173 | n_ablated int64 1 60 | holes_filled listlengths 1 60 | deleted_lemmas listlengths 1 1 | corollaries listlengths 1 1 | closure_size int64 1 172 | challenge_file_content stringlengths 133 350k | solution_file_content stringlengths 394 351k | solution_diff stringlengths 243 134k | manifest dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ablate_2f17a1389c2e_2 | 34fe217e88653f48 | lean | lean | github.com/FormalizedFormalLogic/Foundation | 87d4dd68835a6c1eb8448b9c392d9ca51fe08d63 | Foundation/FirstOrder/Completeness/CanonicalModel.lean | CanonicalModel | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "dn_neg_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have := by simpa using (sound_minimal (Derivation.neg_doubleNegation φ) p)\n exact (this p (by simp)).symm",
"n_chars": 113... | [
{
"name": "sound_minimal",
"text": "lemma sound_minimal {φ : Propositionᵢ L} : 𝗠𝗶𝗻¹ ⊢ φ → ℙ⁻ ∀⊩ φ := by\n rintro ⟨d⟩ p; exact ⟨Forces.sound d p.val⟩\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 149,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
"n_automation": 0,
"n_r... | [
{
"name": "complete",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 499,
"n_subproofs": 4,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_nesting": 4
... | 1 | module
public import Foundation.FirstOrder.Hauptsatz
public import Foundation.Logic.ForcingRelation
@[expose] public section
/-!
# Canonical model for classical first-order logic
Main reference: Jeremy Avigad, Algebraic proofs of cut elimination [Avi01]
-/
namespace LO.FirstOrder.Derivation.Canonical
variable {L... | module
public import Foundation.FirstOrder.Hauptsatz
public import Foundation.Logic.ForcingRelation
@[expose] public section
/-!
# Canonical model for classical first-order logic
Main reference: Jeremy Avigad, Algebraic proofs of cut elimination [Avi01]
-/
namespace LO.FirstOrder.Derivation.Canonical
variable {L... | @@ -136,6 +136,9 @@
not _ := not
monotone hφ _ hpq := hφ.monotone hpq
+lemma sound_minimal {φ : Propositionᵢ L} : 𝗠𝗶𝗻¹ ⊢ φ → ℙ⁻ ∀⊩ φ := by
+ rintro ⟨d⟩ p; exact ⟨Forces.sound d p.val⟩
+
end IsForced
namespace IsWeaklyForced
@@ -144,7 +147,9 @@
lemma iff_isForced {φ : Proposition L} {p : ℙ⁻} : p ⊩ᶜ φ ... | {
"repo": "Foundation",
"git_repo": "github.com/FormalizedFormalLogic/Foundation",
"revision": "87d4dd68835a6c1eb8448b9c392d9ca51fe08d63",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--cor... |
ablate_105645285e26_0 | 8951986f90a24df9 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "d_ex",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases ∀ s : σ, cut s\n next h =>\n exists Sys.some\n constructor\n · intro; assumption\n · intro; exact h Sys.some\n ... | [
{
"name": "not_forall_eq_exists_not",
"text": "theorem not_forall_eq_exists_not (p : α → Prop) : (¬ ∀ x, p x) = ∃ x, ¬ p x := by\n apply propext\n constructor\n · intro h₁\n apply byContradiction\n intro h₂\n have := Iff.mp not_exists h₂\n simp only [Decidable.not_not] at this\n contradict... | [
{
"name": "d_ex",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 454,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 9,
"automation_only": false,
"max_nesting": 4
}
... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -26,6 +26,22 @@
----------------------------------------------------------------------
+theorem not_forall_eq_exists_not (p : α → Prop) : (¬ ∀ x, p x) = ∃ x, ¬ p x := by
+ apply propext
+ constructor
+ · intro h₁
+ apply byContradiction
+ intro h₂
+ have := Iff.mp not_exists h₂
+ simp only [Decid... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_1 | a2a4ad3e599c578c | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "d_ex",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases ∀ s : σ, cut s\n next h =>\n exists Sys.some\n constructor\n · intro; assumption\n · intro; exact h Sys.some\n ... | [
{
"name": "not_forall_eq_exists_not",
"text": "theorem not_forall_eq_exists_not (p : α → Prop) : (¬ ∀ x, p x) = ∃ x, ¬ p x := by\n apply propext\n constructor\n · intro h₁\n apply byContradiction\n intro h₂\n have := Iff.mp not_exists h₂\n simp only [Decidable.not_not] at this\n contradict... | [
{
"name": "d_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 95,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
}
] | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -26,6 +26,22 @@
----------------------------------------------------------------------
+theorem not_forall_eq_exists_not (p : α → Prop) : (¬ ∀ x, p x) = ∃ x, ¬ p x := by
+ apply propext
+ constructor
+ · intro h₁
+ apply byContradiction
+ intro h₂
+ have := Iff.mp not_exists h₂
+ simp only [Decid... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_2 | a3f23c9c4ac8becd | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "csteps_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [csteps_eq]\n simp only [↓reduceIte, h]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "csteps_eq",
"text": "theorem csteps_eq [Sys σ] [Spec' σ] (s : σ) (i : Nat)\n : csteps s i = if cut s then i\n else csteps (next s) (i + 1) := by\n unfold csteps\n conv => lhs; rw [iterate_eq]\n by_cases cut s <;> simp only [Bool.false_eq_true, ↓reduceIte, *]\n\n",
... | [
{
"name": "csteps_cut",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 143,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -52,6 +52,13 @@
noncomputable def csteps [Sys σ] [Spec' σ] (s : σ) (i : Nat) : Nat :=
iterate (fun (s, i) => if cut s then .inl i else .inr (next s, i + 1)) (s, i)
+theorem csteps_eq [Sys σ] [Spec' σ] (s : σ) (i : Nat)
+ : csteps s i = if cut s then i
+ else csteps (next s) (i + 1)... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_3 | ce14e7af950061da | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "csteps_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [csteps_eq]\n simp only [↓reduceIte, h]",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "csteps_eq",
"text": "theorem csteps_eq [Sys σ] [Spec' σ] (s : σ) (i : Nat)\n : csteps s i = if cut s then i\n else csteps (next s) (i + 1) := by\n unfold csteps\n conv => lhs; rw [iterate_eq]\n by_cases cut s <;> simp only [Bool.false_eq_true, ↓reduceIte, *]\n\n",
... | [
{
"name": "csteps_not_cut",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 214,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting"... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -52,6 +52,13 @@
noncomputable def csteps [Sys σ] [Spec' σ] (s : σ) (i : Nat) : Nat :=
iterate (fun (s, i) => if cut s then .inl i else .inr (next s, i + 1)) (s, i)
+theorem csteps_eq [Sys σ] [Spec' σ] (s : σ) (i : Nat)
+ : csteps s i = if cut s then i
+ else csteps (next s) (i + 1)... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_4 | 154ae80395ce928e | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "find_next_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n let rec loop (s' : σ) (i : Nat) (hle : i ≤ n) (heq : s' = run s i) :\n ∃ k : Nat, csteps s' i = k ∧ k ≤ n ∧ cut (run s k) :=... | [
{
"name": "csteps_cut",
"text": "theorem csteps_cut [Sys σ] [Spec' σ] {s : σ} (h : cut s) (i : Nat) :\n csteps s i = i := by\n rw [csteps_eq]\n simp only [↓reduceIte, h]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 143,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_auto... | [
{
"name": "find_next_cut",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 24,
"n_chars": 987,
"n_subproofs": 4,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -85,6 +85,11 @@
else
d
+theorem csteps_cut [Sys σ] [Spec' σ] {s : σ} (h : cut s) (i : Nat) :
+ csteps s i = i := by
+ rw [csteps_eq]
+ simp only [↓reduceIte, h]
+
theorem csteps_not_cut [Sys σ] [Spec' σ] {s : σ} (h₁ : ¬ cut s)
(h₂ : csteps (next s) (i+1) = j) : csteps s i = j := by
rw [csteps_eq]... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_5 | 268b9493992b307a | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "find_next_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n let rec loop (s' : σ) (i : Nat) (hle : i ≤ n) (heq : s' = run s i) :\n ∃ k : Nat, csteps s' i = k ∧ k ≤ n ∧ cut (run s k) :=... | [
{
"name": "csteps_cut",
"text": "theorem csteps_cut [Sys σ] [Spec' σ] {s : σ} (h : cut s) (i : Nat) :\n csteps s i = i := by\n rw [csteps_eq]\n simp only [↓reduceIte, h]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 143,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_auto... | [
{
"name": "partial_correctness_from_verification_conditions",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 67,
"n_chars": 2960,
"n_subproofs": 10,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 3,
"auto... | 4 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -85,6 +85,11 @@
else
d
+theorem csteps_cut [Sys σ] [Spec' σ] {s : σ} (h : cut s) (i : Nat) :
+ csteps s i = i := by
+ rw [csteps_eq]
+ simp only [↓reduceIte, h]
+
theorem csteps_not_cut [Sys σ] [Spec' σ] {s : σ} (h₁ : ¬ cut s)
(h₂ : csteps (next s) (i+1) = j) : csteps s i = j := by
rw [csteps_eq]... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_6 | 25a5b7fb481cb8a9 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "cassert_cut",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 225,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,9 +93,21 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp onl... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_7 | 5e5734fcc9a2fead | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "snd_cassert_of_cut",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 255,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,8 +93,19 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp onl... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_8 | d88fd535a31ba70f | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "snd_cassert_of_not_cut",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 285,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,9 +93,20 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp onl... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_9 | 302cb4ea35204260 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "cassert_not_cut",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 327,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,10 +93,23 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp on... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_10 | e0c7e5b532fc83f6 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "cassert_lower_bound",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 476,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,10 +93,33 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp on... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_11 | 0570ef6ac15435f9 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "cassert_upper_bound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 565,
"n_subproofs": 2,
"n_tactics": 16,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,9 +93,33 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp onl... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_12 | 6997ec8b17bb2826 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "find_next_cut_for_cassert",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 62,
"n_chars": 2585,
"n_subproofs": 17,
"n_tactics": 56,
"cyclomatic": 3,
"n_automation": 18,
"n_rewrites": 10,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,19 +93,49 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp on... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_13 | 320aac799dc376bb | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "partial_correctness_from_assertions",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 64,
"n_chars": 2755,
"n_subproofs": 10,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 5,
"n_structural": 2,
"automation_only":... | 5 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,19 +93,49 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp on... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_14 | c30d281a56fbbb57 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "cassert_when_cut_exists",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 1582,
"n_subproofs": 5,
"n_tactics": 31,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,10 +93,33 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp on... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_15 | e0f480cd5a4bc72a | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "term_helper_aux",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 64,
"n_chars": 2678,
"n_subproofs": 19,
"n_tactics": 57,
"cyclomatic": 2,
"n_automation": 21,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": false,
"max_ne... | 4 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,14 +93,52 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp on... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_16 | e0f9c320d9214035 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "term_helper",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 20,
"n_chars": 875,
"n_subproofs": 4,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_nesting":... | 5 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,14 +93,52 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp on... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_105645285e26_17 | 03231026c75d4b98 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Correctness.lean | Correctness | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 7 | [
{
"theorem_name": "cassert_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [cassert_eq]\n simp only [↓reduceIte, and_self, h]\n done",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "cassert_eq",
"text": "theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :\n cassert s0 si i\n = if cut si then (i, assert s0 si)\n else cassert s0 (next si) (i + 1) := by\n unfold cassert\n conv => lhs; rw [iterate_eq]\n by_cases cut si <;> simp only [Bool.false_eq_true, ↓... | [
{
"name": "termination_from_decreasing_rank",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 45,
"n_chars": 1964,
"n_subproofs": 4,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": fal... | 6 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura, Shilpi Goel, Siddharth Bhat
-/
/-
Lean4 Formalization of the ACL2 paper
"Verification Condition Generation via Theorem Proving"
(https://link.... | @@ -93,14 +93,52 @@
.inr (next si, i + 1))
(si, i)
+theorem cassert_eq [Sys σ] [Spec' σ] (s0 si : σ) (i : Nat) :
+ cassert s0 si i
+ = if cut si then (i, assert s0 si)
+ else cassert s0 (next si) (i + 1) := by
+ unfold cassert
+ conv => lhs; rw [iterate_eq]
+ by_cases cut si <;> simp on... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a00f09f0d6e2_0 | 16cc987dedf8c1ed | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Insts/DPSFP/Advanced_simd_two_reg_misc.lean | Advanced_simd_two_reg_misc | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "loose_bitvec2_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h : x.toNat < 4 := by exact Fin.isLt ..\n apply Nat_lt_of_le_of_le (BitVec.toNat x) 4 6 <;> trivial",
"n_char... | [
{
"name": "Nat_lt_of_le_of_le",
"text": "theorem Nat_lt_of_le_of_le (x y z : Nat) (h1 : x < y) (h2 : y <= z) : x <= z := by\n refine Nat.le_of_lt ?h\n exact Nat.lt_of_lt_of_le h1 h2\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 142,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "loose_bitvec2_bound",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 172,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
-- REV64/32/16
import Arm.Decode
import Arm.State
import Arm.Insts.Common
import Arm.BitVec
import Arm.Insts.CosimM
-----------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
-- REV64/32/16
import Arm.Decode
import Arm.State
import Arm.Insts.Common
import Arm.BitVec
import Arm.Insts.CosimM
-----------------------------... | @@ -22,6 +22,10 @@
exact Nat.le_of_lt h
simp
+theorem Nat_lt_of_le_of_le (x y z : Nat) (h1 : x < y) (h2 : y <= z) : x <= z := by
+ refine Nat.le_of_lt ?h
+ exact Nat.lt_of_lt_of_le h1 h2
+
theorem pow2_helper1 (i : Nat) : 8 * 2 ^ i = 2 ^ (3 + i) := by
have h : 8 = 2^3 := rfl
rw [h]
@@ -33,7 +37,9 @@
... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a00f09f0d6e2_1 | e6f517e559ca94a2 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Insts/DPSFP/Advanced_simd_two_reg_misc.lean | Advanced_simd_two_reg_misc | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "esize_dvd_container_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_all only [Nat.shiftLeft_eq, Nat.shiftRight_eq_div_pow]\n generalize h_yvar : BitVec.toNat y = yvar\n ... | [
{
"name": "pow2_helper2",
"text": "theorem pow2_helper2 (j : Nat) (h : j <= 6) : 64 / 2 ^ j = 2 ^ (6 - j) := by\n have h0 : 64 = 2^6 := rfl\n rw [h0]\n refine Nat.pow_div ?h ?hx\n repeat simp_all!\n\n",
"fan_in": 2,
"n_lines": 7,
"n_chars": 163,
"n_subproofs": 1,
"n_tactics": 5,
... | [
{
"name": "esize_dvd_container_size",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 14,
"n_chars": 527,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"... | 5 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
-- REV64/32/16
import Arm.Decode
import Arm.State
import Arm.Insts.Common
import Arm.BitVec
import Arm.Insts.CosimM
-----------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
-- REV64/32/16
import Arm.Decode
import Arm.State
import Arm.Insts.Common
import Arm.BitVec
import Arm.Insts.CosimM
-----------------------------... | @@ -31,13 +31,28 @@
rw [h]
exact (Nat.pow_add 2 3 i).symm
+theorem pow2_helper2 (j : Nat) (h : j <= 6) : 64 / 2 ^ j = 2 ^ (6 - j) := by
+ have h0 : 64 = 2^6 := rfl
+ rw [h0]
+ refine Nat.pow_div ?h ?hx
+ repeat simp_all!
+
theorem loose_bitvec2_bound (x : BitVec 2) : x.toNat <= 6 := by
have h : x.toNat ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a00f09f0d6e2_2 | 06cb3ee6609560b1 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Insts/DPSFP/Advanced_simd_two_reg_misc.lean | Advanced_simd_two_reg_misc | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "esize_dvd_container_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_all only [Nat.shiftLeft_eq, Nat.shiftRight_eq_div_pow]\n generalize h_yvar : BitVec.toNat y = yvar\n ... | [
{
"name": "loose_bitvec2_bound",
"text": "theorem loose_bitvec2_bound (x : BitVec 2) : x.toNat <= 6 := by\n have h : x.toNat < 4 := by exact Fin.isLt ..\n apply Nat_lt_of_le_of_le (BitVec.toNat x) 4 6 <;> trivial\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 172,
"n_subproofs": 1,
"n_tac... | [
{
"name": "container_size_dvd_datasize",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 423,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
-- REV64/32/16
import Arm.Decode
import Arm.State
import Arm.Insts.Common
import Arm.BitVec
import Arm.Insts.CosimM
-----------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
-- REV64/32/16
import Arm.Decode
import Arm.State
import Arm.Insts.Common
import Arm.BitVec
import Arm.Insts.CosimM
-----------------------------... | @@ -37,12 +37,17 @@
refine Nat.pow_div ?h ?hx
repeat simp_all!
+theorem loose_bitvec2_bound (x : BitVec 2) : x.toNat <= 6 := by
+ have h : x.toNat < 4 := by exact Fin.isLt ..
+ apply Nat_lt_of_le_of_le (BitVec.toNat x) 4 6 <;> trivial
+
theorem esize_dvd_container_size (x y : BitVec 2) :
(8 <<< x.toNat < ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9c67948188b5_0 | df1353b7271d6018 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Iterate.lean | Iterate | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "fuel_extra",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have : fuel ≠ 0 := fuel_ne_zero h\n have := iterate'_eq f a this\n have := iterate'_succ_eq f a fuel\n by_cases test f a <;>... | [
{
"name": "iterate'_next_ne_none",
"text": "theorem iterate'_next_ne_none (h : iterate' f a fuel ≠ none) (ht : ¬ test f a) : iterate' f (next f a ht) (fuel - 1) ≠ none := by\n have : fuel ≠ 0 := fuel_ne_zero h\n unfold iterate' at h\n simp [*] at h\n assumption\n\n",
"fan_in": 2,
"n_lines": 7,
... | [
{
"name": "fuel_extra",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 494,
"n_subproofs": 7,
"n_tactics": 15,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura
-/
namespace Iterate
/-
The purpose of Iterate is to implement partial tail recursion that is
available in ACL2 using `defpun`; see
https://www... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura
-/
namespace Iterate
/-
The purpose of Iterate is to implement partial tail recursion that is
available in ACL2 using `defpun`; see
https://www... | @@ -56,10 +56,42 @@
theorem fuel_ne_zero (h : iterate' f a fuel ≠ none) : fuel ≠ 0 := by
intro hn; simp [hn] at h; unfold iterate' at h; simp_arith at h
-theorem fuel_extra (h : iterate' f a fuel ≠ none) : iterate' f a (fuel + 1) = iterate' f a fuel := sorry
+theorem iterate'_next_ne_none (h : iterate' f a fuel ≠... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9c67948188b5_1 | e8e170d2763b9d2f | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Iterate.lean | Iterate | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "fuel_extra_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n if h : fuel₁ = fuel₂ then\n by simp [h] at h₂; simp [*]\n else\n have : fuel₁ ≠ 0 := fuel_ne_zero h₂\n have h₁' : fue... | [
{
"name": "fuel_extra",
"text": "theorem fuel_extra (h : iterate' f a fuel ≠ none) : iterate' f a (fuel + 1) = iterate' f a fuel := by\n have : fuel ≠ 0 := fuel_ne_zero h\n have := iterate'_eq f a this\n have := iterate'_succ_eq f a fuel\n by_cases test f a <;> simp [*]\n next ht =>\n have := iterat... | [
{
"name": "fuel_extra_ge",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 13,
"n_chars": 544,
"n_subproofs": 5,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 5 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura
-/
namespace Iterate
/-
The purpose of Iterate is to implement partial tail recursion that is
available in ACL2 using `defpun`; see
https://www... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura
-/
namespace Iterate
/-
The purpose of Iterate is to implement partial tail recursion that is
available in ACL2 using `defpun`; see
https://www... | @@ -62,6 +62,19 @@
simp [*] at h
assumption
+theorem fuel_extra (h : iterate' f a fuel ≠ none) : iterate' f a (fuel + 1) = iterate' f a fuel := by
+ have : fuel ≠ 0 := fuel_ne_zero h
+ have := iterate'_eq f a this
+ have := iterate'_succ_eq f a fuel
+ by_cases test f a <;> simp [*]
+ next ht =>
+ have :... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9c67948188b5_2 | 4a823a81a8028fc9 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Iterate.lean | Iterate | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "fuel_extra_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n if h : fuel₁ = fuel₂ then\n by simp [h] at h₂; simp [*]\n else\n have : fuel₁ ≠ 0 := fuel_ne_zero h₂\n have h₁' : fue... | [
{
"name": "fuel_extra'",
"text": "theorem fuel_extra' (h : iterate' f a fuel ≠ none) : iterate' f a (fuel + 1) ≠ none := by\n have : fuel ≠ 0 := fuel_ne_zero h\n have := iterate'_eq f a this\n have := iterate'_succ_eq f a fuel\n by_cases test f a\n next => simp_arith [*]\n next ht =>\n have := ite... | [
{
"name": "iterate'_det",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 7,
"n_chars": 282,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 6 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura
-/
namespace Iterate
/-
The purpose of Iterate is to implement partial tail recursion that is
available in ACL2 using `defpun`; see
https://www... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura
-/
namespace Iterate
/-
The purpose of Iterate is to implement partial tail recursion that is
available in ACL2 using `defpun`; see
https://www... | @@ -75,13 +75,30 @@
simp [hf₁] at ih
simp [ih]
+theorem fuel_extra' (h : iterate' f a fuel ≠ none) : iterate' f a (fuel + 1) ≠ none := by
+ have : fuel ≠ 0 := fuel_ne_zero h
+ have := iterate'_eq f a this
+ have := iterate'_succ_eq f a fuel
+ by_cases test f a
+ next => simp_arith [*]
+ next ht =>
+ ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9c67948188b5_3 | 3d57b51e27f03488 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Correctness/Iterate.lean | Iterate | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "fuel_nex",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h h₁\n have := fuel_ex ht h₁\n contradiction",
"n_chars": 60,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomati... | [
{
"name": "fuel_ex",
"text": "theorem fuel_ex (ht : ¬ test f a) : (∃ fuel, iterate' f (next f a ht) fuel ≠ none) → ∃ fuel, iterate' f a fuel ≠ none := by\n intro ⟨fuel, h⟩\n exists fuel+1\n unfold iterate'\n have : fuel + 1 ≠ 0 := by simp_arith\n have : fuel + 1 - 1 = fuel := Nat.pred_succ _\n simp [*... | [
{
"name": "fuel_nex",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 202,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura
-/
namespace Iterate
/-
The purpose of Iterate is to implement partial tail recursion that is
available in ACL2 using `defpun`; see
https://www... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Leonardo de Moura
-/
namespace Iterate
/-
The purpose of Iterate is to implement partial tail recursion that is
available in ACL2 using `defpun`; see
https://www... | @@ -139,8 +139,19 @@
rw [this] at hspec
contradiction
-theorem fuel_nex (ht : ¬ test f a) : (¬ ∃ fuel, iterate' f a fuel ≠ none) → (¬ ∃ fuel, iterate' f (next f a ht) fuel ≠ none) := sorry
+theorem fuel_ex (ht : ¬ test f a) : (∃ fuel, iterate' f (next f a ht) fuel ≠ none) → ∃ fuel, iterate' f a fuel ≠ none ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_f40019051af1_0 | 57c8f8f60a1a0205 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/Abs/AbsVCG.lean | AbsVCG | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "nextc_to_run_from_0x4005d0",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [abs_pre, state_simp_rules] at h\n obtain ⟨h_s0_pc, h_s0_program, h_s0_err, h_s0_sp_aligned⟩ := h\n ... | [
{
"name": "program.stepi_0x4005d8_cut",
"text": "theorem program.stepi_0x4005d8_cut (s sn : ArmState)\n (h_program : s.program = program)\n (h_pc : r StateField.PC s = 0x4005d8#64)\n (h_err : r StateField.ERR s = StateError.None)\n (h_sp_aligned : CheckSPAlignment s)\n (h_step : sn = run 1 s) :\n abs_... | [
{
"name": "nextc_to_run_from_0x4005d0",
"fan_in": 2,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 35,
"n_chars": 1207,
"n_subproofs": 6,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program implements
absolute value correctly. The objective of this exercise is to determi... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program implements
absolute value correctly. The objective of this exercise is to determi... | @@ -130,6 +130,23 @@
state_simp_rules, bitvec_rules, minimal_theory]
done
+theorem program.stepi_0x4005d8_cut (s sn : ArmState)
+ (h_program : s.program = program)
+ (h_pc : r StateField.PC s = 0x4005d8#64)
+ (h_err : r StateField.ERR s = StateError.None)
+ (h_sp_aligned : CheckSPAlignment s)... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_f40019051af1_1 | ec59b35e11ebe41b | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/Abs/AbsVCG.lean | AbsVCG | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "nextc_to_run_from_0x4005d0",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [abs_pre, state_simp_rules] at h\n obtain ⟨h_s0_pc, h_s0_program, h_s0_err, h_s0_sp_aligned⟩ := h\n ... | [
{
"name": "program.stepi_0x4005dc_cut",
"text": "theorem program.stepi_0x4005dc_cut (s sn : ArmState)\n (h_program : s.program = program)\n (h_pc : r StateField.PC s = 0x4005dc#64)\n (h_err : r StateField.ERR s = StateError.None)\n (h_sp_aligned : CheckSPAlignment s)\n (h_step : sn = run 1 s) :\n abs_... | [
{
"name": "effects_of_nextc_from_0x4005d0",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 27,
"n_chars": 1187,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,... | 6 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program implements
absolute value correctly. The objective of this exercise is to determi... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program implements
absolute value correctly. The objective of this exercise is to determi... | @@ -147,9 +147,57 @@
state_simp_rules, bitvec_rules, minimal_theory]
done
+theorem program.stepi_0x4005dc_cut (s sn : ArmState)
+ (h_program : s.program = program)
+ (h_pc : r StateField.PC s = 0x4005dc#64)
+ (h_err : r StateField.ERR s = StateError.None)
+ (h_sp_aligned : CheckSPAlignment s)
... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_f40019051af1_2 | 97503837024b67e3 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/Abs/AbsVCG.lean | AbsVCG | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "effects_of_nextc_from_0x4005d0",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [nextc_to_run_from_0x4005d0 h_pre] at h_run\n obtain ⟨h_pc, h_program, h_err, h_sp_aligned⟩ := h_pre\n ... | [
{
"name": "nextc_to_run_from_0x4005d0",
"text": "theorem nextc_to_run_from_0x4005d0 (h : abs_pre s0) :\n (Correctness.nextc (Sys.run s0 1)) = run 4 s0 := by\n simp only [abs_pre, state_simp_rules] at h\n obtain ⟨h_s0_pc, h_s0_program, h_s0_err, h_s0_sp_aligned⟩ := h\n simp only\n [Correctness.nextc, ... | [
{
"name": "partial_correctness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 40,
"n_chars": 1443,
"n_subproofs": 2,
"n_tactics": 37,
"cyclomatic": 2,
"n_automation": 17,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": false,
"max... | 7 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program implements
absolute value correctly. The objective of this exercise is to determi... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program implements
absolute value correctly. The objective of this exercise is to determi... | @@ -164,6 +164,40 @@
state_simp_rules, bitvec_rules, minimal_theory]
done
+theorem nextc_to_run_from_0x4005d0 (h : abs_pre s0) :
+ (Correctness.nextc (Sys.run s0 1)) = run 4 s0 := by
+ simp only [abs_pre, state_simp_rules] at h
+ obtain ⟨h_s0_pc, h_s0_program, h_s0_err, h_s0_sp_aligned⟩ := h
+... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_f40019051af1_3 | d3134d264d973395 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/Abs/AbsVCG.lean | AbsVCG | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "effects_of_nextc_from_0x4005d0",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [nextc_to_run_from_0x4005d0 h_pre] at h_run\n obtain ⟨h_pc, h_program, h_err, h_sp_aligned⟩ := h_pre\n ... | [
{
"name": "nextc_to_run_from_0x4005d0",
"text": "theorem nextc_to_run_from_0x4005d0 (h : abs_pre s0) :\n (Correctness.nextc (Sys.run s0 1)) = run 4 s0 := by\n simp only [abs_pre, state_simp_rules] at h\n obtain ⟨h_s0_pc, h_s0_program, h_s0_err, h_s0_sp_aligned⟩ := h\n simp only\n [Correctness.nextc, ... | [
{
"name": "termination",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 19,
"n_chars": 638,
"n_subproofs": 3,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting":... | 7 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program implements
absolute value correctly. The objective of this exercise is to determi... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program implements
absolute value correctly. The objective of this exercise is to determi... | @@ -164,6 +164,40 @@
state_simp_rules, bitvec_rules, minimal_theory]
done
+theorem nextc_to_run_from_0x4005d0 (h : abs_pre s0) :
+ (Correctness.nextc (Sys.run s0 1)) = run 4 s0 := by
+ simp only [abs_pre, state_simp_rules] at h
+ obtain ⟨h_s0_pc, h_s0_program, h_s0_err, h_s0_sp_aligned⟩ := h
+... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_5675bb632886_0 | 09a72322cfcd0b53 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/SeparateProofs.lean | SeparateProofs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "first_address_add_one_is_subset_of_region",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [mem_subset]\n apply first_address_add_one_is_subset_of_region_helper\n bv_omega_bench",
... | [
{
"name": "first_address_add_one_is_subset_of_region_helper",
"text": "private theorem first_address_add_one_is_subset_of_region_helper (n addr : BitVec 64)\n (_h_lb : 0#64 < n) :\n addr + n - addr = 18446744073709551615#64 ∨\n addr + 1#64 - addr ≤ addr + n - addr := by\n bv_check\n \"lrat_files/Sepa... | [
{
"name": "first_address_add_one_is_subset_of_region",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 310,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | @@ -20,9 +20,19 @@
----------------------------------------------------------------------
---- Some helpful bitvector lemmas ----
+private theorem first_address_add_one_is_subset_of_region_helper (n addr : BitVec 64)
+ (_h_lb : 0#64 < n) :
+ addr + n - addr = 18446744073709551615#64 ∨
+ addr + 1#64 - addr ≤ addr... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_5675bb632886_1 | 6c76820d5714a4f9 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/SeparateProofs.lean | SeparateProofs | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "first_addresses_add_one_is_subset_of_region_general",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- auto creates an uninterpreted function for the exponentiation, so\n -- we evaluate ... | [
{
"name": "first_addresses_add_one_is_subset_of_region_general_helper",
"text": "private theorem first_addresses_add_one_is_subset_of_region_general_helper\n (n m addr1 addr2 : BitVec 64) (h0 : 0#64 < m) :\n addr2 + n - addr2 = 18446744073709551615#64 ∨\n addr1 + m - addr2 ≤ addr2 + n - addr2 ∧ addr1 -... | [
{
"name": "first_addresses_add_one_is_subset_of_region_general",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 588,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | @@ -20,10 +20,27 @@
----------------------------------------------------------------------
---- Some helpful bitvector lemmas ----
+private theorem first_addresses_add_one_is_subset_of_region_general_helper
+ (n m addr1 addr2 : BitVec 64) (h0 : 0#64 < m) :
+ addr2 + n - addr2 = 18446744073709551615#64 ∨
+ addr... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_5675bb632886_2 | 190615ee60611134 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/SeparateProofs.lean | SeparateProofs | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "first_addresses_add_one_preserves_subset_same_addr",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [mem_subset]\n apply Or.inr\n apply And.intro\n case left =>\n rw [BitVec.ad... | [
{
"name": "BitVec.add_sub_add_left",
"text": "theorem BitVec.add_sub_add_left (a m n : BitVec 64) :\n a + m - (a + n) = m - n := by\n bv_omega_bench\n\n-- (FIXME) Prove for all bitvector widths, using general assoc/comm\n-- BitVec lemmas.\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 190,
"n_s... | [
{
"name": "first_addresses_add_one_preserves_subset_same_addr",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 45,
"n_chars": 1644,
"n_subproofs": 1,
"n_tactics": 40,
"cyclomatic": 2,
"n_automation": 12,
"n_rewrites": 14,
"n_structural": 8,
"a... | 4 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | @@ -25,6 +25,12 @@
bv_omega_bench
-- (FIXME) Prove for all bitvector widths.
+theorem BitVec.add_sub_add_left (a m n : BitVec 64) :
+ a + m - (a + n) = m - n := by
+ bv_omega_bench
+
+-- (FIXME) Prove for all bitvector widths, using general assoc/comm
+-- BitVec lemmas.
theorem nat_bitvec_sub1 (x y : BitVec 64... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_5675bb632886_3 | 20161dd8134f5ae2 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/SeparateProofs.lean | SeparateProofs | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "mem_subset_one_addr_region_lemma",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [mem_subset]\n have h0 := mem_subset_one_addr_region_lemma_helper (BitVec.ofNat 64 n1) addr1 addr2\n... | [
{
"name": "mem_subset_one_addr_region_lemma_helper",
"text": "private theorem mem_subset_one_addr_region_lemma_helper (n1 addr1 addr2 : BitVec 64) :\n addr1 + n1 - 1#64 - addr2 ≤ 0#64 ∧ addr1 - addr2 ≤ addr1 + n1 - 1#64 - addr2 →\n n1 = 1#64 ∧ addr1 = addr2 := by\n bv_check\n \"lrat_files/SeparateProo... | [
{
"name": "mem_subset_one_addr_region_lemma",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 583,
"n_subproofs": 3,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | @@ -20,8 +20,21 @@
----------------------------------------------------------------------
---- Some helpful bitvector lemmas ----
+private theorem mem_subset_one_addr_region_lemma_helper (n1 addr1 addr2 : BitVec 64) :
+ addr1 + n1 - 1#64 - addr2 ≤ 0#64 ∧ addr1 - addr2 ≤ addr1 + n1 - 1#64 - addr2 →
+ n1 = 1#64 ∧ a... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_5675bb632886_4 | a7b426da342d2dbf | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/SeparateProofs.lean | SeparateProofs | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "mem_separate_contiguous_regions_one_address",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [mem_separate, mem_overlap]\n have h' : (BitVec.ofNat 64 (n' - 1)) < 0xffffffffffffffff#6... | [
{
"name": "mem_separate_contiguous_regions_one_address_helper",
"text": "private theorem mem_separate_contiguous_regions_one_address_helper (n' addr : BitVec 64)\n (h : n' < 0xffffffffffffffff) :\n (0#64 < addr + 1#64 - addr ∧ 0#64 < addr + 1#64 + n' - addr)\n ∧ addr + 1#64 + n' - (addr + 1#64) < a... | [
{
"name": "mem_separate_contiguous_regions_one_address",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 486,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_o... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | @@ -20,8 +20,21 @@
----------------------------------------------------------------------
---- Some helpful bitvector lemmas ----
+private theorem mem_separate_contiguous_regions_one_address_helper (n' addr : BitVec 64)
+ (h : n' < 0xffffffffffffffff) :
+ (0#64 < addr + 1#64 - addr ∧ 0#64 < addr + 1#64 + n' -... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_5675bb632886_5 | ba624eed8701de28 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/SeparateProofs.lean | SeparateProofs | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "mem_separate_for_subset1",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_separate_commutative] at *\n rw [@mem_separate_for_subset2 b1 b2 a1 a2 c1 c2 h1 h2]",
"n_chars": 97,
... | [
{
"name": "mem_separate_for_subset2",
"text": "theorem mem_separate_for_subset2\n (h1 : mem_separate a1 a2 b1 b2) (h2 : mem_subset c1 c2 b1 b2) :\n mem_separate a1 a2 c1 c2 := by\n revert h1 h2\n simp [mem_subset, mem_separate, mem_overlap]\n bv_check \"lrat_files/SeparateProofs.lean-mem_separate_for_s... | [
{
"name": "mem_separate_for_subset1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 227,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"ma... | 2 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | @@ -25,9 +25,18 @@
simp [mem_separate, mem_overlap]
bv_check "lrat_files/SeparateProofs.lean-mem_separate_commutative-247-2.lrat"
+theorem mem_separate_for_subset2
+ (h1 : mem_separate a1 a2 b1 b2) (h2 : mem_subset c1 c2 b1 b2) :
+ mem_separate a1 a2 c1 c2 := by
+ revert h1 h2
+ simp [mem_subset, mem_separa... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_5675bb632886_6 | b50b47d6a8dfcb2f | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/SeparateProofs.lean | SeparateProofs | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "mem_separate_for_subset1",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_separate_commutative] at *\n rw [@mem_separate_for_subset2 b1 b2 a1 a2 c1 c2 h1 h2]",
"n_chars": 97,
... | [
{
"name": "mem_separate_for_subset2",
"text": "theorem mem_separate_for_subset2\n (h1 : mem_separate a1 a2 b1 b2) (h2 : mem_subset c1 c2 b1 b2) :\n mem_separate a1 a2 c1 c2 := by\n revert h1 h2\n simp [mem_subset, mem_separate, mem_overlap]\n bv_check \"lrat_files/SeparateProofs.lean-mem_separate_for_s... | [
{
"name": "mem_separate_for_subset_general",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 379,
"n_subproofs": 2,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.State
import Arm.Memory.Separate
import Std.Tactic.BVDecide
import Tactics.BvOmegaBench
-----------------------------------------------... | @@ -25,15 +25,27 @@
simp [mem_separate, mem_overlap]
bv_check "lrat_files/SeparateProofs.lean-mem_separate_commutative-247-2.lrat"
+theorem mem_separate_for_subset2
+ (h1 : mem_separate a1 a2 b1 b2) (h2 : mem_subset c1 c2 b1 b2) :
+ mem_separate a1 a2 c1 c2 := by
+ revert h1 h2
+ simp [mem_subset, mem_separ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a2d058322d59_0 | 44f82ad02150d18c | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/AddLoop/AddLoop.lean | AddLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "nextc_to_run_from_0x4005a4",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [pre, state_simp_rules] at h\n obtain ⟨h_s0_pc, h_s0_program, h_s0_err⟩ := h\n simp only\n [Corr... | [
{
"name": "program.stepi_0x4005b0_cut",
"text": "theorem program.stepi_0x4005b0_cut (s sn : ArmState)\n (h_program : s.program = program)\n (h_pc : r StateField.PC s = 0x4005b0#64)\n (h_err : r StateField.ERR s = StateError.None)\n (h_sp_aligned : CheckSPAlignment s)\n (h_step : sn = run 1 s) :\n cut ... | [
{
"name": "nextc_to_run_from_0x4005a4",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 23,
"n_chars": 743,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | @@ -160,9 +160,45 @@
state_simp_rules, bitvec_rules, minimal_theory]
done
+theorem program.stepi_0x4005b0_cut (s sn : ArmState)
+ (h_program : s.program = program)
+ (h_pc : r StateField.PC s = 0x4005b0#64)
+ (h_err : r StateField.ERR s = StateError.None)
+ (h_sp_aligned : CheckSPAlignment s)... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a2d058322d59_1 | 4c7f6049b063dd65 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/AddLoop/AddLoop.lean | AddLoop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "effects_of_nextc_from_0x4005a4",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Prelude\n rw [nextc_to_run_from_0x4005a4 h_pre] at h_run\n -- TODO: Tactic to \"explode\" conjunctions?... | [
{
"name": "AddWithCarry.all_ones_zero_flag_64",
"text": "private theorem AddWithCarry.all_ones_zero_flag_64 (x : BitVec 64) :\n ((AddWithCarry x 0xffffffffffffffff#64 0x1#1).snd.z = 1#1) ↔\n (x = 0#64) := by\n simp only [AddWithCarry, bitvec_rules, state_simp_rules]\n repeat split\n · bv_decide\n · bv... | [
{
"name": "effects_of_nextc_from_0x4005a4",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 25,
"n_chars": 905,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | @@ -177,6 +177,15 @@
done
-- Branch instruction!
+private theorem AddWithCarry.all_ones_zero_flag_64 (x : BitVec 64) :
+ ((AddWithCarry x 0xffffffffffffffff#64 0x1#1).snd.z = 1#1) ↔
+ (x = 0#64) := by
+ simp only [AddWithCarry, bitvec_rules, state_simp_rules]
+ repeat split
+ · bv_decide
+ · bv_decide
+ do... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a2d058322d59_2 | 8b61461694240080 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/AddLoop/AddLoop.lean | AddLoop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "nextc_to_run_from_0x4005a4",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [pre, state_simp_rules] at h\n obtain ⟨h_s0_pc, h_s0_program, h_s0_err⟩ := h\n simp only\n [Corr... | [
{
"name": "program.stepi_0x4005b0_cut",
"text": "theorem program.stepi_0x4005b0_cut (s sn : ArmState)\n (h_program : s.program = program)\n (h_pc : r StateField.PC s = 0x4005b0#64)\n (h_err : r StateField.ERR s = StateError.None)\n (h_sp_aligned : CheckSPAlignment s)\n (h_step : sn = run 1 s) :\n cut ... | [
{
"name": "nextc_to_run_from_0x4005b4_cond_holds_true",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 48,
"n_chars": 1833,
"n_subproofs": 6,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 12,
"n_rewrites": 4,
"n_structural": 1,
"automation... | 5 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | @@ -175,6 +175,23 @@
simp_all only [run, cut, this, state_simp_rules, bitvec_rules, minimal_theory]
done
+theorem program.stepi_0x4005b0_cut (s sn : ArmState)
+ (h_program : s.program = program)
+ (h_pc : r StateField.PC s = 0x4005b0#64)
+ (h_err : r StateField.ERR s = StateError.None)
+ (h_sp_aligned : Che... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a2d058322d59_3 | 4e72f1d3ea6fa068 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/AddLoop/AddLoop.lean | AddLoop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "nextc_to_run_from_0x4005b4_cond_holds_false",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [pre, loop_inv, state_simp_rules] at *\n obtain ⟨_h_inv_x0_le, h_inv_z, h_inv_x1, h... | [
{
"name": "non_zero_one_bit_is_one",
"text": "private theorem non_zero_one_bit_is_one (x : BitVec 1)\n (h : ¬ x = 0#1) :\n x = 1#1 := by\n bv_decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 105,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_re... | [
{
"name": "nextc_to_run_from_0x4005b4_cond_holds_false",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 22,
"n_chars": 832,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"automation_... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | @@ -167,12 +167,32 @@
simp_all only [state_simp_rules, minimal_theory]
done
+private theorem non_zero_one_bit_is_one (x : BitVec 1)
+ (h : ¬ x = 0#1) :
+ x = 1#1 := by
+ bv_decide
+
theorem nextc_to_run_from_0x4005b4_cond_holds_false (_h_pre : pre s0)
(h_pc : r StateField.PC si = 0x4005b4#64)
(h_c... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a2d058322d59_4 | 66057497b2de2c61 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/AddLoop/AddLoop.lean | AddLoop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "nextc_to_run_from_0x4005b4_cond_holds_true",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [pre, loop_inv, state_simp_rules] at *\n obtain ⟨_h_inv_x0_le, h_inv_z, h_inv_x1, h_... | [
{
"name": "program.stepi_0x4005b4_cut",
"text": "theorem program.stepi_0x4005b4_cut (s sn : ArmState)\n (h_program : s.program = program)\n (h_pc : r StateField.PC s = 0x4005b4#64)\n (h_err : r StateField.ERR s = StateError.None)\n (h_sp_aligned : CheckSPAlignment s)\n (h_step : sn = run 1 s) :\n cut ... | [
{
"name": "effects_of_nextc_from_0x4005b4_cond_holds_true",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 44,
"n_chars": 1742,
"n_subproofs": 1,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 1,
"automat... | 7 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | @@ -192,12 +192,77 @@
done
-- Branch instruction!
+theorem program.stepi_0x4005b4_cut (s sn : ArmState)
+ (h_program : s.program = program)
+ (h_pc : r StateField.PC s = 0x4005b4#64)
+ (h_err : r StateField.ERR s = StateError.None)
+ (h_sp_aligned : CheckSPAlignment s)
+ (h_step : sn = run 1 s) :
+ cut sn =... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a2d058322d59_5 | 84147c04b882169e | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/AddLoop/AddLoop.lean | AddLoop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "nextc_to_run_from_0x4005b4_cond_holds_false",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [pre, loop_inv, state_simp_rules] at *\n obtain ⟨_h_inv_x0_le, h_inv_z, h_inv_x1, h... | [
{
"name": "non_zero_one_bit_is_one",
"text": "private theorem non_zero_one_bit_is_one (x : BitVec 1)\n (h : ¬ x = 0#1) :\n x = 1#1 := by\n bv_decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 105,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_re... | [
{
"name": "effects_of_nextc_from_0x4005b4_cond_holds_false",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 41,
"n_chars": 1609,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 2,
"n_structural": 1,
"automa... | 4 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | @@ -167,12 +167,32 @@
simp_all only [state_simp_rules, minimal_theory]
done
+private theorem non_zero_one_bit_is_one (x : BitVec 1)
+ (h : ¬ x = 0#1) :
+ x = 1#1 := by
+ bv_decide
+
theorem nextc_to_run_from_0x4005b4_cond_holds_false (_h_pre : pre s0)
(h_pc : r StateField.PC si = 0x4005b4#64)
(h_c... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a2d058322d59_7 | bd6a6de6406a7b95 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/AddLoop/AddLoop.lean | AddLoop | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "nextc_to_run_from_0x4005b8",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [pre, loop_post, state_simp_rules] at *\n obtain ⟨_h_inv_x0, h_inv_err, h_inv_program, h_inv_sp_alig... | [
{
"name": "program.stepi_eq_0x4005b8_cut",
"text": "theorem program.stepi_eq_0x4005b8_cut (s sn : ArmState)\n (h_program : s.program = program)\n (h_pc : r StateField.PC s = 0x4005b8#64)\n (h_err : r StateField.ERR s = StateError.None)\n (h_sp_aligned : CheckSPAlignment s)\n (h_step : sn = run 1 s) :\n... | [
{
"name": "effects_of_nextc_from_0x4005b8",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 22,
"n_chars": 792,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | @@ -143,11 +143,46 @@
-- (FIXME) Obtain *_cut theorems for each instruction automatically.
+theorem program.stepi_eq_0x4005b8_cut (s sn : ArmState)
+ (h_program : s.program = program)
+ (h_pc : r StateField.PC s = 0x4005b8#64)
+ (h_err : r StateField.ERR s = StateError.None)
+ (h_sp_aligned : CheckSPAlignment ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_a2d058322d59_8 | b52573c5955ece9b | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/AddLoop/AddLoop.lean | AddLoop | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "effects_of_nextc_from_0x4005b4_cond_holds_true",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Prelude\n rw [nextc_to_run_from_0x4005b4_cond_holds_true\n h_pre h_pc h_cond_hold... | [
{
"name": "AddWithCarry.sub_one_64",
"text": "private theorem AddWithCarry.sub_one_64 (x : BitVec 64) :\n (AddWithCarry x 0xfffffffffffffffe#64 0x1#1).fst = x - 1#64 := by\n simp only [AddWithCarry]\n bv_decide\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 166,
"n_subproofs": 0,
"n_tact... | [
{
"name": "partial_correctness",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 20,
"n_lines": 79,
"n_chars": 3269,
"n_subproofs": 6,
"n_tactics": 73,
"cyclomatic": 2,
"n_automation": 18,
"n_rewrites": 2,
"n_structural": 11,
"automation_only": false,
"m... | 20 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | @@ -381,6 +381,11 @@
simp only [run, h_step_1, minimal_theory]
done
+private theorem AddWithCarry.sub_one_64 (x : BitVec 64) :
+ (AddWithCarry x 0xfffffffffffffffe#64 0x1#1).fst = x - 1#64 := by
+ simp only [AddWithCarry]
+ bv_decide
+
theorem effects_of_nextc_from_0x4005b4_cond_holds_true
(h_pre : pre s... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_0 | c6249fed3c09de84 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "Memory.read_write_bytes_different",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing mem addr1 addr2\n case zero => simp only [write_bytes]\n case succ n ih =>\n ... | [
{
"name": "read_write_different",
"text": "theorem read_write_different (h : addr1 ≠ addr2) :\n read addr1 (write addr2 v s) = read addr1 s := by\n simp [read, write, store_read_over_write_different (h := h)]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 171,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "Memory.read_write_bytes_different",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1207,
"n_subproofs": 4,
"n_tactics": 24,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": fa... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -23,6 +23,10 @@
read addr (write addr v mem) = v := by
simp [read, write, store_read_over_write_same]
+theorem read_write_different (h : addr1 ≠ addr2) :
+ read addr1 (write addr2 v s) = read addr1 s := by
+ simp [read, write, store_read_over_write_different (h := h)]
+
end Memory
-----------------... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_2 | 4cc0be499323513a | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "Memory.read_bytes_write_bytes_same",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing addr mem\n case zero =>\n simp [read_bytes, of_length_zero]\n case succ n... | [
{
"name": "read_write_same",
"text": "theorem read_write_same :\n read addr (write addr v mem) = v := by\n simp [read, write, store_read_over_write_same]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 119,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
... | [
{
"name": "Memory.read_bytes_write_bytes_same",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 876,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 11,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": f... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -19,6 +19,10 @@
/-! ## One byte read/write lemmas-/
namespace Memory
+theorem read_write_same :
+ read addr (write addr v mem) = v := by
+ simp [read, write, store_read_over_write_same]
+
theorem read_write_different (h : addr1 ≠ addr2) :
read addr1 (write addr2 v s) = read addr1 s := by
simp [read,... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_3 | f1fcfd7070b17ec2 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 2 | [
{
"theorem_name": "write_mem_of_write_mem_bytes_commute",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h : n = 0\n case pos => subst n; simp only [write_mem_bytes]\n case neg => -- n ≠ 0\n h... | [
{
"name": "write_mem_of_write_mem_commute",
"text": "theorem write_mem_of_write_mem_commute\n (h : mem_separate addr2 addr2 addr1 addr1) :\n write_mem addr2 val2 (write_mem addr1 val1 s) =\n write_mem addr1 val1 (write_mem addr2 val2 s) := by\n simp_all only [write_mem, ArmState.mk.injEq, BitVec.and_sel... | [
{
"name": "write_mem_of_write_mem_bytes_commute",
"fan_in": 5,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1307,
"n_subproofs": 1,
"n_tactics": 28,
"cyclomatic": 2,
"n_automation": 10,
"n_rewrites": 8,
"n_structural": 1,
"automation_only"... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -144,11 +144,48 @@
----------------------------------------------------------------------
-- Key theorem: write_mem_bytes_of_write_mem_bytes_commute
+theorem write_mem_of_write_mem_commute
+ (h : mem_separate addr2 addr2 addr1 addr1) :
+ write_mem addr2 val2 (write_mem addr1 val1 s) =
+ write_mem addr1 val1 (... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_4 | 487640d1f32782af | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 5 | [
{
"theorem_name": "write_mem_bytes_of_write_mem_bytes_commute",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_n1 : n1 = 0\n case pos => -- (n1 = 0)\n subst n1; simp only [write_mem_bytes]\n ... | [
{
"name": "write_mem_of_write_mem_bytes_commute",
"text": "theorem write_mem_of_write_mem_bytes_commute\n (h0 : n <= 2^64)\n (h1 : mem_separate addr2 addr2 addr1 (addr1 + (BitVec.ofNat 64 (n - 1)))) :\n write_mem addr2 val2 (write_mem_bytes n addr1 val1 s) =\n write_mem_bytes n addr1 val1 (write_mem add... | [
{
"name": "write_mem_bytes_of_write_mem_bytes_commute",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 40,
"n_chars": 1674,
"n_subproofs": 1,
"n_tactics": 33,
"cyclomatic": 2,
"n_automation": 11,
"n_rewrites": 8,
"n_structural": 4,
"automation... | 2 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -156,12 +156,71 @@
split <;> simp_all only [ite_false]
done
+theorem write_mem_of_write_mem_bytes_commute
+ (h0 : n <= 2^64)
+ (h1 : mem_separate addr2 addr2 addr1 (addr1 + (BitVec.ofNat 64 (n - 1)))) :
+ write_mem addr2 val2 (write_mem_bytes n addr1 val1 s) =
+ write_mem_bytes n addr1 val1 (write_mem ad... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_5 | 9518ec754b9208a6 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "read_mem_of_write_mem_bytes_subset_helper_4",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Nat.eq_of_testBit_eq; intro i\n simp only [Nat.testBit_mod_two_pow]\n by_cases h₀ : i ... | [
{
"name": "read_mem_of_write_mem_bytes_subset_helper_3",
"text": "private theorem read_mem_of_write_mem_bytes_subset_helper_3 (a : Nat) (h1 : 0 < a) (h2 : a < 2^64) :\n (a + (2 ^ 64 - 1)) % 2 ^ 64 = (a - 1) := by\n have l1 : a + (2^64 - 1) = a - 1 + 2^64 := by omega\n simp only [l1]\n have l2 : a - 1 < 2 ^ ... | [
{
"name": "read_mem_of_write_mem_bytes_subset_helper_4",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 32,
"n_chars": 1500,
"n_subproofs": 1,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 3,
"n_structural": 9,
"automation... | 2 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -563,9 +563,44 @@
simp only [Nat.add_mod_right, Nat.mod_eq_of_lt l2]
omega
+private theorem read_mem_of_write_mem_bytes_subset_helper_3 (a : Nat) (h1 : 0 < a) (h2 : a < 2^64) :
+ (a + (2 ^ 64 - 1)) % 2 ^ 64 = (a - 1) := by
+ have l1 : a + (2^64 - 1) = a - 1 + 2^64 := by omega
+ simp only [l1]
+ have l2 : a -... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_6 | 8b0fbc9f62b5d2ea | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "read_mem_of_write_mem_bytes_subset_helper_4",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Nat.eq_of_testBit_eq; intro i\n simp only [Nat.testBit_mod_two_pow]\n by_cases h₀ : i ... | [
{
"name": "read_mem_of_write_mem_bytes_subset_helper_1",
"text": "private theorem read_mem_of_write_mem_bytes_subset_helper_1\n (a i : Nat) (h1 : 0 < a) (h2 : a < 2^64) :\n (8 + ((a + (2 ^ 64 - 1)) % 2 ^ 64 * 8 + i)) = (a * 8 + i) := by\n have l1 : a + (2^64 - 1) = a - 1 + 2^64 := by omega\n simp only [... | [
{
"name": "read_mem_of_write_mem_bytes_subset",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 64,
"n_chars": 2915,
"n_subproofs": 6,
"n_tactics": 54,
"cyclomatic": 2,
"n_automation": 21,
"n_rewrites": 5,
"n_structural": 4,
"automation_only": ... | 8 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -554,6 +554,15 @@
· omega
done
+private theorem read_mem_of_write_mem_bytes_subset_helper_1
+ (a i : Nat) (h1 : 0 < a) (h2 : a < 2^64) :
+ (8 + ((a + (2 ^ 64 - 1)) % 2 ^ 64 * 8 + i)) = (a * 8 + i) := by
+ have l1 : a + (2^64 - 1) = a - 1 + 2^64 := by omega
+ simp only [l1]
+ have l2 : a - 1 < 2 ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_7 | c7c05ff052409c60 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "read_mem_bytes_of_write_mem_bytes_subset_helper2",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_a_size := (addr2 - addr1).isLt\n have h_v_size := val.isLt\n -- (FIXME) whnf tim... | [
{
"name": "read_mem_bytes_of_write_mem_bytes_subset_helper1",
"text": "theorem read_mem_bytes_of_write_mem_bytes_subset_helper1 (a i : Nat)\n (h1 : a < 2^64 - 1) (h2 : 8 <= i):\n ((a + 1) % 2 ^ 64 * 8 + (i - 8)) = (a * 8 + i) := by\n have h' : (a + 1) < 2^64 := by omega\n rw [Nat.mod_eq_of_lt h']\n ome... | [
{
"name": "read_mem_bytes_of_write_mem_bytes_subset_helper2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 52,
"n_chars": 2387,
"n_subproofs": 7,
"n_tactics": 41,
"cyclomatic": 2,
"n_automation": 21,
"n_rewrites": 2,
"n_structural": 2,
"auto... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -679,6 +679,13 @@
rw [mem_subset_one_addr_neq h₁ h2]
done
+theorem read_mem_bytes_of_write_mem_bytes_subset_helper1 (a i : Nat)
+ (h1 : a < 2^64 - 1) (h2 : 8 <= i):
+ ((a + 1) % 2 ^ 64 * 8 + (i - 8)) = (a * 8 + i) := by
+ have h' : (a + 1) < 2^64 := by omega
+ rw [Nat.mod_eq_of_lt h']
+ omega
... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_8 | 3d8fdfa0074847c5 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "read_mem_bytes_of_write_mem_bytes_subset_same_first_address",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have rm_lemma := @read_mem_of_write_mem_bytes_same_first_address n1 addr val s... | [
{
"name": "read_mem_of_write_mem_bytes_same_first_address",
"text": "theorem read_mem_of_write_mem_bytes_same_first_address\n (h0 : 0 < n) (h1 : n <= 2^64) (h : 7 - 0 + 1 = 8) :\n read_mem addr (write_mem_bytes n addr val s) =\n BitVec.cast h (extractLsb' 0 8 val) := by\n unfold write_mem_bytes; simp on... | [
{
"name": "read_mem_bytes_of_write_mem_bytes_subset_n2_lt",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 18,
"n_lines": 67,
"n_chars": 3368,
"n_subproofs": 8,
"n_tactics": 55,
"cyclomatic": 3,
"n_automation": 29,
"n_rewrites": 9,
"n_structural": 3,
"autom... | 18 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -469,6 +469,20 @@
----------------------------------------------------------------------
-- Key theorem: read_mem_bytes_of_write_mem_bytes_subset
+theorem read_mem_of_write_mem_bytes_same_first_address
+ (h0 : 0 < n) (h1 : n <= 2^64) (h : 7 - 0 + 1 = 8) :
+ read_mem addr (write_mem_bytes n addr val s) =
+ Bit... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_9 | ea0aa41f3695aa8f | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "read_mem_bytes_of_write_mem_bytes_subset_n2_eq_alt",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n subst n2\n have l0 := @entire_memory_subset_of_only_itself n1 addr2 addr1 h1 h4\n ... | [
{
"name": "entire_memory_subset_of_only_itself",
"text": "theorem entire_memory_subset_of_only_itself\n (h0 : n <= my_pow 2 64)\n (h1 : mem_subset addr2 (addr2 + (BitVec.ofNat 64 (my_pow 2 64 - 1))) addr1 (addr1 + (BitVec.ofNat 64 (n - 1)))) :\n n = my_pow 2 64 := by\n have : 2^64 = 18446744073709551616... | [
{
"name": "read_mem_bytes_of_write_mem_bytes_subset_n2_eq_alt",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 18,
"n_chars": 905,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 1,
"auto... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -825,6 +825,15 @@
@[irreducible]
def my_pow (base exp : Nat) : Nat := base ^ exp
+theorem entire_memory_subset_of_only_itself
+ (h0 : n <= my_pow 2 64)
+ (h1 : mem_subset addr2 (addr2 + (BitVec.ofNat 64 (my_pow 2 64 - 1))) addr1 (addr1 + (BitVec.ofNat 64 (n - 1)))) :
+ n = my_pow 2 64 := by
+ have : 2^64 = 1... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_10 | d3c80aa49fb77c51 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "read_mem_bytes_of_write_mem_bytes_subset_n2_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n2, h2 using Nat.le_induction generalizing addr1 addr2 val s\n case base =>\n ... | [
{
"name": "read_mem_bytes_of_write_mem_bytes_subset_same_first_address",
"text": "theorem read_mem_bytes_of_write_mem_bytes_subset_same_first_address\n (h0 : 0 < n1) (h1 : n1 <= 2^64) (h2 : 0 < n2) (h3 : n2 <= 2^64)\n (h4 : mem_subset addr (addr + (BitVec.ofNat 64 (n2 - 1))) addr (addr + (BitVec.ofNat 64 ... | [
{
"name": "read_mem_bytes_of_write_mem_bytes_subset",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 25,
"n_lines": 30,
"n_chars": 987,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 9,
"automation_on... | 23 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -489,6 +489,71 @@
subst_vars
simp only [Nat.sub_zero, BitVec.cast_eq]
+theorem read_mem_bytes_of_write_mem_bytes_subset_same_first_address
+ (h0 : 0 < n1) (h1 : n1 <= 2^64) (h2 : 0 < n2) (h3 : n2 <= 2^64)
+ (h4 : mem_subset addr (addr + (BitVec.ofNat 64 (n2 - 1))) addr (addr + (BitVec.ofNat 64 (n1 - 1)))):... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_11 | 6011b971e91f0d3a | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "write_mem_bytes_irrelevant_helper",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext\n simp [ushiftRight, ShiftRight.shiftRight, BitVec.toNat_ofNat]\n have h_x_size := (read_mem_bytes... | [
{
"name": "leftshift_n_or_rightshift_n",
"text": "theorem leftshift_n_or_rightshift_n (n x y : Nat) (h : y < 2^n) :\n (x <<< n ||| y) >>> n = x := by\n apply Nat.eq_of_testBit_eq; intro i\n simp only [Nat.testBit_shiftRight, Nat.testBit_or]\n have l0 : y < 2^(n + i) :=\n calc\n _ < 2^n := by ass... | [
{
"name": "write_mem_bytes_irrelevant_helper",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 679,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -890,10 +890,33 @@
----------------------------------------------------------------------
-- Key theorem : write_mem_bytes_irrelevant
+theorem leftshift_n_or_rightshift_n (n x y : Nat) (h : y < 2^n) :
+ (x <<< n ||| y) >>> n = x := by
+ apply Nat.eq_of_testBit_eq; intro i
+ simp only [Nat.testBit_shiftRight, ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7090ddaf2061_12 | 4f7d54868e3c6995 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/MemoryProofs.lean | MemoryProofs | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 31 | 1 | [
{
"theorem_name": "write_mem_bytes_irrelevant",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing addr s\n case zero => simp only [write_mem_bytes]\n case succ =>\n rename_i n n_i... | [
{
"name": "write_mem_bytes_irrelevant_helper",
"text": "private theorem write_mem_bytes_irrelevant_helper (h : n * 8 + 8 = (n + 1) * 8) :\n (setWidth (n * 8)\n ((BitVec.cast h (read_mem_bytes n (addr + 1#64) s ++ read_mem addr s)) >>> 8)) =\n read_mem_bytes n (addr + 1#64) s := by\n ext\n simp [ushif... | [
{
"name": "write_mem_bytes_irrelevant",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 32,
"n_chars": 981,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 3 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.FromMathlib
import Arm.State
import Arm.Memory.Separate
import Arm.Memory.SeparateProofs
import Tactics.BvOmegaBench
-- In this file, we... | @@ -902,6 +902,22 @@
simp only [Nat.testBit_shiftLeft, decide_True, Nat.add_sub_cancel_left,
Nat.le_add_right, Bool.true_and, Bool.or_false]
+private theorem write_mem_bytes_irrelevant_helper (h : n * 8 + 8 = (n + 1) * 8) :
+ (setWidth (n * 8)
+ ((BitVec.cast h (read_mem_bytes n (addr + 1#64) s +... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_0 | 2b0b71a21ffa6889 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "le_of_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [←nat_bitvec_le]\n exact Nat.le_of_eq (congrArg BitVec.toNat h)",
"n_chars": 76,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "nat_bitvec_le",
"text": "theorem nat_bitvec_le (x y : BitVec n) :\n (x.toNat <= y.toNat) ↔ (x <= y) := by rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 88,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural":... | [
{
"name": "le_of_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 147,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -433,8 +433,13 @@
idx1 = idx2 := by
ext; unfold BitVec.toNat at h0; assumption
+theorem nat_bitvec_le (x y : BitVec n) :
+ (x.toNat <= y.toNat) ↔ (x <= y) := by rfl
+
protected theorem le_of_eq (x y : BitVec n) (h : x = y) :
- x <= y := sorry
+ x <= y := by
+ simp [←nat_bitvec_le]
+ exact Nat.le_of... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_1 | 7fec5a839f3caf5f | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "val_nat_le",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.le_iff_val_le_val]\n simp [toNat_ofNat]\n rw [Nat.mod_eq_of_lt h1]\n rw [Nat.mod_eq_of_lt h2]\n trivial",
"n_... | [
{
"name": "le_iff_val_le_val",
"text": "protected theorem le_iff_val_le_val {a b : BitVec n} : a ≤ b ↔ a.toNat ≤ b.toNat :=\n Iff.rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 101,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"... | [
{
"name": "val_nat_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 326,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -433,6 +433,9 @@
idx1 = idx2 := by
ext; unfold BitVec.toNat at h0; assumption
+protected theorem le_iff_val_le_val {a b : BitVec n} : a ≤ b ↔ a.toNat ≤ b.toNat :=
+ Iff.rfl
+
@[simp]
protected theorem val_bitvec_lt {n : Nat} {a b : BitVec n} : a.toNat < b.toNat ↔ a < b :=
Iff.rfl
@@ -443,7 +446,12 ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_2 | a558020ba12c66e6 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "le_of_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [←nat_bitvec_le]\n exact Nat.le_of_eq (congrArg BitVec.toNat h)",
"n_chars": 76,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "nat_bitvec_le",
"text": "theorem nat_bitvec_le (x y : BitVec n) :\n (x.toNat <= y.toNat) ↔ (x <= y) := by rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 88,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural":... | [
{
"name": "zero_le_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 261,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -433,6 +433,9 @@
idx1 = idx2 := by
ext; unfold BitVec.toNat at h0; assumption
+theorem nat_bitvec_le (x y : BitVec n) :
+ (x.toNat <= y.toNat) ↔ (x <= y) := by rfl
+
@[simp]
protected theorem val_bitvec_lt {n : Nat} {a b : BitVec n} : a.toNat < b.toNat ↔ a < b :=
Iff.rfl
@@ -442,7 +445,9 @@
Iff.... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_3 | 20dd253a5aff9003 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "setWidth_zero_width",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold setWidth\n split <;> simp [bitvec_zero_is_unique]",
"n_chars": 62,
"n_subproofs": 0,
"n_tactics": 4... | [
{
"name": "bitvec_zero_is_unique",
"text": "theorem bitvec_zero_is_unique (x : BitVec 0) :\n x = 0#0 := by\n apply BitVec.extensionality_fin\n apply Fin.ext\n have h := x.toFin.isLt\n refine Nat.eq_of_le_of_lt_succ ?_ h\n simp only [Nat.pow_zero, Fin.fin_one_eq_zero, Nat.le_refl]\n\n",
"fan_in": 1... | [
{
"name": "setWidth_zero_width",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 508,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_ne... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -420,6 +420,14 @@
ext
exact congrArg Fin.val h0
+theorem bitvec_zero_is_unique (x : BitVec 0) :
+ x = 0#0 := by
+ apply BitVec.extensionality_fin
+ apply Fin.ext
+ have h := x.toFin.isLt
+ refine Nat.eq_of_le_of_lt_succ ?_ h
+ simp only [Nat.pow_zero, Fin.fin_one_eq_zero, Nat.le_refl]
+
@[ext] pro... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_4 | 2aa42ba15c64ba5c | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "extractLsb'_append_right_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have len'_eq : min len (m - start) = len := by omega\n simp only [extractLsb'_append]\n apply cast_eq_of_h... | [
{
"name": "cast_eq_of_heq",
"text": "theorem cast_eq_of_heq (x : BitVec n) (y : BitVec m) (h : n = m) :\n HEq x y → x.cast h = y := by\n cases h; simp\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 119,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
"n_automation": 1,
"n... | [
{
"name": "extractLsb'_append_right_of_le",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 364,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -522,13 +522,22 @@
have h₅ : start - m + (↑i - (m - start)) = start + ↑i - m := by omega
simp [h₂, h₃, h₄, h₅]
+theorem cast_eq_of_heq (x : BitVec n) (y : BitVec m) (h : n = m) :
+ HEq x y → x.cast h = y := by
+ cases h; simp
+
theorem cast_heq_iff (x : BitVec n) (y : BitVec m) (h : n = n') :
... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_5 | d9cfe5d87466d402 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "extractLsb'_append_right_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have len'_eq : min len (m - start) = len := by omega\n simp only [extractLsb'_append]\n apply cast_eq_of_h... | [
{
"name": "cast_heq_iff",
"text": "theorem cast_heq_iff (x : BitVec n) (y : BitVec m) (h : n = n') :\n HEq (x.cast h) y ↔ HEq x y := by\n cases h; simp\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 122,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
"n_automation": 1,
"... | [
{
"name": "extractLsb'_append_right",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 6,
"n_chars": 186,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 4 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -526,9 +526,18 @@
HEq x y → x.cast h = y := by
cases h; simp
+theorem cast_heq_iff (x : BitVec n) (y : BitVec m) (h : n = n') :
+ HEq (x.cast h) y ↔ HEq x y := by
+ cases h; simp
+
theorem extractLsb'_append_right_of_le (h : start + len ≤ m)
(x : BitVec n) (y : BitVec m) :
- (x ++ y).extractLs... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_6 | fb8fc6b25cfe0bcb | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "empty_bitvector_append_left_triangle",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h1 := empty_bitvector_append_left x h\n have h2 := @my_bv_cast_eq_cast\n unfold my_bv_cast at h... | [
{
"name": "my_bv_cast_eq_cast",
"text": "theorem my_bv_cast_eq_cast (x : BitVec n) (h : n = m) :\n my_bv_cast h x = BitVec.cast h x := by\n subst_vars\n simp only [my_bv_cast, BitVec.cast_eq]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 152,
"n_subproofs": 0,
"n_tactics": 3,
"cyclo... | [
{
"name": "empty_bitvector_append_left_triangle",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 236,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": f... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -578,9 +578,19 @@
-- like in empty_bitvector_append_left_triangle below.
def my_bv_cast (h : n = m) (x : BitVec n) : BitVec m := h ▸ x
+theorem my_bv_cast_eq_cast (x : BitVec n) (h : n = m) :
+ my_bv_cast h x = BitVec.cast h x := by
+ subst_vars
+ simp only [my_bv_cast, BitVec.cast_eq]
+
theorem empty_bitvec... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_7 | b69c91a809dbd886 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "append_of_extract",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext\n subst high\n have vlt := v.isLt\n have := append_of_extract_general_nat (n - low) low n (BitVec.toNat v) vlt\n ... | [
{
"name": "append_of_extract_general_nat",
"text": "theorem append_of_extract_general_nat (high low n vn : Nat) (h : vn < 2 ^ n) :\n ((((vn >>> low) % 2 ^ n) % 2 ^ high) <<< low) ||| (vn % 2 ^ low) =\n (vn % 2 ^ (high + low)) := by\n apply Nat.eq_of_testBit_eq\n intro i\n simp only [Nat.testBit_or, Nat... | [
{
"name": "append_of_extract",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 548,
"n_subproofs": 3,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -578,14 +578,74 @@
-- like in empty_bitvector_append_left_triangle below.
def my_bv_cast (h : n = m) (x : BitVec n) : BitVec m := h ▸ x
+theorem append_of_extract_general_nat (high low n vn : Nat) (h : vn < 2 ^ n) :
+ ((((vn >>> low) % 2 ^ n) % 2 ^ high) <<< low) ||| (vn % 2 ^ low) =
+ (vn % 2 ^ (high + low)) ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_8 | a3d631e8a8aec8b3 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "append_of_extract",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext\n subst high\n have vlt := v.isLt\n have := append_of_extract_general_nat (n - low) low n (BitVec.toNat v) vlt\n ... | [
{
"name": "append_of_extract_general_nat",
"text": "theorem append_of_extract_general_nat (high low n vn : Nat) (h : vn < 2 ^ n) :\n ((((vn >>> low) % 2 ^ n) % 2 ^ high) <<< low) ||| (vn % 2 ^ low) =\n (vn % 2 ^ (high + low)) := by\n apply Nat.eq_of_testBit_eq\n intro i\n simp only [Nat.testBit_or, Nat... | [
{
"name": "append_of_extract_general",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 544,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -578,10 +578,59 @@
-- like in empty_bitvector_append_left_triangle below.
def my_bv_cast (h : n = m) (x : BitVec n) : BitVec m := h ▸ x
+theorem append_of_extract_general_nat (high low n vn : Nat) (h : vn < 2 ^ n) :
+ ((((vn >>> low) % 2 ^ n) % 2 ^ high) <<< low) ||| (vn % 2 ^ low) =
+ (vn % 2 ^ (high + low)) ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_9 | 3ed657d1dbba859d | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "toNat_sub_eq_toNat_sub_toNat_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [toNat_sub]\n rw [BitVec.le_def] at h\n by_cases h' : x.toNat = y.toNat\n · rw [h', Nat.sub... | [
{
"name": "Nat.sub_add_eq_add_sub_of_le_of_le",
"text": "private theorem Nat.sub_add_eq_add_sub_of_le_of_le {a b c : Nat} (hab : b ≤ a) (hbc : b ≤ c) :\n a - b + c = a + (c - b) := by\n omega\n\n/- TODO: upstream. -/\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 164,
"n_subproofs": 0,
"n... | [
{
"name": "toNat_sub_eq_toNat_sub_toNat_of_le",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 494,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": fal... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -641,6 +641,11 @@
---------------------------- Negate Lemmas ---------------------------
+private theorem Nat.sub_add_eq_add_sub_of_le_of_le {a b c : Nat} (hab : b ≤ a) (hbc : b ≤ c) :
+ a - b + c = a + (c - b) := by
+ omega
+
+/- TODO: upstream. -/
theorem toNat_sub_eq_toNat_sub_toNat_of_le {x y : BitVec ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_10 | 625f03954087c6fd | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "le_add_self_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.le_def]\n rw [BitVec.toNat_add_eq_toNat_add_toNat (by omega)]\n omega",
"n_chars": 86,
"n_subproofs"... | [
{
"name": "toNat_add_eq_toNat_add_toNat",
"text": "/-- adding bitvectors when there is no overflow. -/\ntheorem toNat_add_eq_toNat_add_toNat {x y : BitVec w} (h : x.toNat + y.toNat < 2^w) :\n (x + y).toNat = x.toNat + y.toNat := by\n rw [BitVec.toNat_add, Nat.mod_eq_of_lt h]\n\n",
"fan_in": 3,
"... | [
{
"name": "le_add_self_of_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 188,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -641,8 +641,16 @@
---------------------------- Negate Lemmas ---------------------------
+/-- adding bitvectors when there is no overflow. -/
+theorem toNat_add_eq_toNat_add_toNat {x y : BitVec w} (h : x.toNat + y.toNat < 2^w) :
+ (x + y).toNat = x.toNat + y.toNat := by
+ rw [BitVec.toNat_add, Nat.mod_eq_of... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_11 | 3e4cd1ca2d97ed3c | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "le_add_self_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.le_def]\n rw [BitVec.toNat_add_eq_toNat_add_toNat (by omega)]\n omega",
"n_chars": 86,
"n_subproofs"... | [
{
"name": "toNat_add_eq_toNat_add_toNat",
"text": "/-- adding bitvectors when there is no overflow. -/\ntheorem toNat_add_eq_toNat_add_toNat {x y : BitVec w} (h : x.toNat + y.toNat < 2^w) :\n (x + y).toNat = x.toNat + y.toNat := by\n rw [BitVec.toNat_add, Nat.mod_eq_of_lt h]\n\n",
"fan_in": 3,
"... | [
{
"name": "add_sub_cancel_left",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 304,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_ne... | 4 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -657,14 +657,23 @@
Nat.mod_self, Nat.zero_add, Nat.mod_mod, Nat.mod_eq_of_lt (by omega)]
/- Subtracting bitvectors when there is overflow. -/
+/-- adding bitvectors when there is no overflow. -/
+theorem toNat_add_eq_toNat_add_toNat {x y : BitVec w} (h : x.toNat + y.toNat < 2^w) :
+ (x + y).toNat = x.to... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_12 | 530ab1baafb76bfe | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "le_add_self_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.le_def]\n rw [BitVec.toNat_add_eq_toNat_add_toNat (by omega)]\n omega",
"n_chars": 86,
"n_subproofs"... | [
{
"name": "toNat_add_eq_toNat_add_toNat",
"text": "/-- adding bitvectors when there is no overflow. -/\ntheorem toNat_add_eq_toNat_add_toNat {x y : BitVec w} (h : x.toNat + y.toNat < 2^w) :\n (x + y).toNat = x.toNat + y.toNat := by\n rw [BitVec.toNat_add, Nat.mod_eq_of_lt h]\n\n",
"fan_in": 3,
"... | [
{
"name": "le_add_iff_sub_le",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 321,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 3 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -657,9 +657,18 @@
Nat.mod_self, Nat.zero_add, Nat.mod_mod, Nat.mod_eq_of_lt (by omega)]
/- Subtracting bitvectors when there is overflow. -/
+/-- adding bitvectors when there is no overflow. -/
+theorem toNat_add_eq_toNat_add_toNat {x y : BitVec w} (h : x.toNat + y.toNat < 2^w) :
+ (x + y).toNat = x.toN... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_13 | 4174ca6048704f53 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "add_sub_cancel_left",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [BitVec.toNat_sub_eq_toNat_sub_toNat_of_le]\n · rw [BitVec.toNat_add_eq_toNat_add_to... | [
{
"name": "toNat_sub_eq_toNat_sub_toNat_of_le",
"text": "theorem toNat_sub_eq_toNat_sub_toNat_of_le {x y : BitVec w} (h : y ≤ x) :\n (x - y).toNat = x.toNat - y.toNat := by\n simp only [toNat_sub]\n rw [BitVec.le_def] at h\n by_cases h' : x.toNat = y.toNat\n · rw [h', Nat.sub_self]\n rw [Nat.sub_a... | [
{
"name": "sub_le_sub_iff_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 361,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"max_n... | 2 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -646,8 +646,23 @@
omega
/- TODO: upstream. -/
+theorem toNat_sub_eq_toNat_sub_toNat_of_le {x y : BitVec w} (h : y ≤ x) :
+ (x - y).toNat = x.toNat - y.toNat := by
+ simp only [toNat_sub]
+ rw [BitVec.le_def] at h
+ by_cases h' : x.toNat = y.toNat
+ · rw [h', Nat.sub_self]
+ rw [Nat.sub_add_cancel (by... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_14 | 42c398397984676f | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "extractLsByte_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [extractLsByte, BitVec.extractLsb'_ofNat, Nat.zero_mod, Nat.zero_shiftRight, cast_ofNat]",
"n_chars": 104,... | [
{
"name": "extractLsb'_ofNat",
"text": "protected theorem extractLsb'_ofNat (x n : Nat) (l lo : Nat) :\n extractLsb' lo l (BitVec.ofNat n x) = .ofNat l ((x % 2^n) >>> lo) := by\n apply eq_of_getLsbD_eq\n intro ⟨i, _lt⟩\n simp [BitVec.ofNat]\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 208,
... | [
{
"name": "extractLsByte_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 175,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -490,6 +490,12 @@
unfold extractLsb'
simp only [Nat.shiftRight_zero, ofNat_toNat, setWidth_eq]
+protected theorem extractLsb'_ofNat (x n : Nat) (l lo : Nat) :
+ extractLsb' lo l (BitVec.ofNat n x) = .ofNat l ((x % 2^n) >>> lo) := by
+ apply eq_of_getLsbD_eq
+ intro ⟨i, _lt⟩
+ simp [BitVec.ofNat]
+
@[b... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9451b0875f25_15 | 3eeacf710ba0aad3 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/BitVec.lean | BitVec | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "extractLsByte_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_getLsbD_eq\n intros i\n simp only [getLsbD_zero, extractLsByte_def,\n getLsbD_cast, getLsbD_extrac... | [
{
"name": "extractLsByte_def",
"text": "theorem extractLsByte_def (val : BitVec w₁) (n : Nat) :\n val.extractLsByte n = val.extractLsb' (n * 8) 8 := rfl\n\n-- TODO: upstream\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 136,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "extractLsByte_ge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 372,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesti... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat, Alex Keizer
-/
/- Kitchen sink file for bitvector theorems -/
---------------------------------------------------------------------... | @@ -648,8 +648,19 @@
def extractLsByte (val : BitVec w₁) (n : Nat) : BitVec 8 :=
val.extractLsb' (n * 8) 8
+theorem extractLsByte_def (val : BitVec w₁) (n : Nat) :
+ val.extractLsByte n = val.extractLsb' (n * 8) 8 := rfl
+
+-- TODO: upstream
theorem extractLsByte_ge (h : 8 * a ≥ w₁) (x : BitVec w₁) :
- x.ext... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7b58a9453ef4_0 | 13a9d7a80a2eb907 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/AddressNormalization.lean | AddressNormalization | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "BitVec.mul_ofNat_eq_ofNat_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.mul_comm\n\nsimproc [address_normalization] constFoldAdd ((_ + _ : BitVec _)) :=\n canonicalize... | [
{
"name": "BitVec.add_ofNat_eq_ofNat_add",
"text": "theorem BitVec.add_ofNat_eq_ofNat_add {w n} (x : BitVec w) :\n x + BitVec.ofNat w n = BitVec.ofNat w n + x := by\n apply BitVec.add_comm\n\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 2,
"cyclo... | [
{
"name": "BitVec.mul_ofNat_eq_ofNat_mul",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 454,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Siddharth Bhat, Tobias Grosser
-/
/-
This file implements bitvector expression simplification simprocs.
We perform the following additional changes:
1. Canonicali... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Siddharth Bhat, Tobias Grosser
-/
/-
This file implements bitvector expression simplification simprocs.
We perform the following additional changes:
1. Canonicali... | @@ -166,9 +166,20 @@
/- Change `100` to `100#64` so we can pattern match to `BitVec.ofNat` -/
attribute [address_normalization] BitVec.ofNat_eq_ofNat
+theorem BitVec.add_ofNat_eq_ofNat_add {w n} (x : BitVec w) :
+ x + BitVec.ofNat w n = BitVec.ofNat w n + x := by
+ apply BitVec.add_comm
+
theorem BitVec.mul_of... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_0 | 563b5d45fd8cceb0 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "r_of_write_mem_bytes",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing addr s\n case succ =>\n rename_i n n_ih\n unfold write_mem_bytes; simp only\n rw [n... | [
{
"name": "r_of_write_mem",
"text": "theorem r_of_write_mem : r fld (write_mem addr val s) = r fld s := by\n unfold r\n unfold read_base_gpr read_base_sfp read_base_pc\n unfold read_base_flag read_base_error\n unfold write_mem\n split <;> simp\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 208... | [
{
"name": "r_of_write_mem_bytes",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 270,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -679,9 +679,23 @@
/-! ### RoW/WoW lemmas about memory and other fields -/
+theorem r_of_write_mem : r fld (write_mem addr val s) = r fld s := by
+ unfold r
+ unfold read_base_gpr read_base_sfp read_base_pc
+ unfold read_base_flag read_base_error
+ unfold write_mem
+ split <;> simp
+
@[state_simp_rules]
t... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_1 | b20a57d386706a0f | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "fetch_inst_of_write_mem_bytes",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing addr2 s\n case zero => rfl\n case succ =>\n rename_i n n_ih\n unfold write_m... | [
{
"name": "fetch_inst_of_write_mem",
"text": "theorem fetch_inst_of_write_mem :\n fetch_inst addr1 (write_mem addr2 val s) = fetch_inst addr1 s := by\n unfold fetch_inst write_mem\n simp\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 142,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic... | [
{
"name": "fetch_inst_of_write_mem_bytes",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 312,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -697,9 +697,21 @@
case zero => rfl
done
+theorem fetch_inst_of_write_mem :
+ fetch_inst addr1 (write_mem addr2 val s) = fetch_inst addr1 s := by
+ unfold fetch_inst write_mem
+ simp
+
@[state_simp_rules]
theorem fetch_inst_of_write_mem_bytes :
- fetch_inst addr1 (write_mem_bytes n addr2 val s) = fetch_... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_2 | 09a0ddd5ddf1f89f | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "read_mem_bytes_of_w",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing addr s\n case zero => rfl\n case succ =>\n rename_i n n_ih\n unfold read_mem_bytes; si... | [
{
"name": "read_mem_of_w",
"text": "theorem read_mem_of_w :\n read_mem addr (w fld v s) = read_mem addr s := by\n unfold read_mem\n unfold w write_base_gpr write_base_sfp\n unfold write_base_pc write_base_flag write_base_error\n split <;> simp\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 209... | [
{
"name": "read_mem_bytes_of_w",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 281,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_ne... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -713,9 +713,23 @@
rw [n_ih, fetch_inst_of_write_mem]
done
+theorem read_mem_of_w :
+ read_mem addr (w fld v s) = read_mem addr s := by
+ unfold read_mem
+ unfold w write_base_gpr write_base_sfp
+ unfold write_base_pc write_base_flag write_base_error
+ split <;> simp
+
@[state_simp_rules]
theorem rea... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_3 | 8830fb599e06cf6b | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "State.read_mem_bytes_eq_mem_read_bytes",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing addr s\n case zero => simp [read_mem_bytes, read_bytes]\n case succ n' ih... | [
{
"name": "ArmState.read_mem_eq_mem_read",
"text": "theorem ArmState.read_mem_eq_mem_read : read_mem addr s = s.mem.read addr := rfl\n\n",
"fan_in": 2,
"n_lines": 3,
"n_chars": 82,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_s... | [
{
"name": "State.read_mem_bytes_eq_mem_read_bytes",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 318,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": ... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -782,6 +782,8 @@
def Memory.read (addr : BitVec 64) (m : Memory) : BitVec 8 :=
read_store addr m
+theorem ArmState.read_mem_eq_mem_read : read_mem addr s = s.mem.read addr := rfl
+
/-- `w` does not affect memory. -/
@[memory_rules, state_simp_rules]
theorem ArmState.mem_w_eq_mem (fld : StateField) (v : stat... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_4 | 24f217bce6da03f0 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "getLsbD_read_bytes",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing i addr m\n case zero =>\n simp only [Nat.reduceMul, Nat.zero_le, BitVec.getLsbD_ge, Nat.ze... | [
{
"name": "getLsbD_read",
"text": "theorem getLsbD_read (mem : Memory) : (mem.read addr).getLsbD i = (mem addr).getLsbD i := rfl\n\n",
"fan_in": 1,
"n_lines": 3,
"n_chars": 95,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_struc... | [
{
"name": "getLsbD_read_bytes",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 40,
"n_chars": 1592,
"n_subproofs": 4,
"n_tactics": 36,
"cyclomatic": 2,
"n_automation": 14,
"n_rewrites": 7,
"n_structural": 5,
"automation_only": false,
"max_... | 2 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -807,6 +807,8 @@
namespace Memory
+theorem getLsbD_read (mem : Memory) : (mem.read addr).getLsbD i = (mem addr).getLsbD i := rfl
+
def read_bytes (n : Nat) (addr : BitVec 64) (m : Memory) : BitVec (n * 8) :=
match n with
| 0 => 0#0
@@ -844,7 +846,42 @@
theorem getLsbD_read_bytes {n i : Nat} {addr : Bi... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_5 | a4f8a14e01d48c44 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "write_of_eq'",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " write_of_eq rfl",
"n_chars": 16,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_re... | [
{
"name": "write_of_eq",
"text": "/--\nThis is a low level theorem.\nPrefer using theorems from `Arm.Separate` that provide higher level theorems\nin terms of memory (non)-interference.\n-/\ntheorem write_of_eq {m : Memory} (hix : ix = addr) : m.write addr val ix = val := by\n simp only [write]\n subst ix... | [
{
"name": "write_of_eq'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 96,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 1
... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -919,8 +919,18 @@
· simp only [h, ↓reduceIte, ite_eq_right_iff]
omega
+/--
+This is a low level theorem.
+Prefer using theorems from `Arm.Separate` that provide higher level theorems
+in terms of memory (non)-interference.
+-/
+theorem write_of_eq {m : Memory} (hix : ix = addr) : m.write addr val ix = val ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_6 | 4c4a74e5083eb4ad | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "write_bytes_eq_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing base mem ix\n case zero => simp only [write_bytes]\n case succ n ih =>\n simp only [wri... | [
{
"name": "write_of_neq",
"text": "/--\nThis is a low level theorem.\nPrefer using theorems from `Arm.Separate` that provide higher level theorems\nin terms of memory (non)-interference.\n-/\ntheorem write_of_neq {m : Memory} (hix : ix ≠ addr) : m.write addr val ix = m ix := by\n simp only [write]\n apply... | [
{
"name": "write_bytes_eq_of_le",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 839,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 3,
"n_automation": 10,
"n_rewrites": 4,
"n_structural": 4,
"automation_only": false,
"max... | 2 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -932,6 +932,16 @@
@[memory_rules]
theorem write_of_eq' {m : Memory} : m.write ix val ix = val := write_of_eq rfl
+/--
+This is a low level theorem.
+Prefer using theorems from `Arm.Separate` that provide higher level theorems
+in terms of memory (non)-interference.
+-/
+theorem write_of_neq {m : Memory} (hix : i... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_7 | a7f22ce60861cca1 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "write_bytes_eq_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing base mem ix\n case zero => simp only [write_bytes]\n case succ n ih =>\n simp only [wri... | [
{
"name": "write_of_neq",
"text": "/--\nThis is a low level theorem.\nPrefer using theorems from `Arm.Separate` that provide higher level theorems\nin terms of memory (non)-interference.\n-/\ntheorem write_of_neq {m : Memory} (hix : ix ≠ addr) : m.write addr val ix = m ix := by\n simp only [write]\n apply... | [
{
"name": "write_bytes_eq_of_ge",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 920,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 12,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
"max... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -932,6 +932,16 @@
@[memory_rules]
theorem write_of_eq' {m : Memory} : m.write ix val ix = val := write_of_eq rfl
+/--
+This is a low level theorem.
+Prefer using theorems from `Arm.Separate` that provide higher level theorems
+in terms of memory (non)-interference.
+-/
+theorem write_of_neq {m : Memory} (hix : i... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_8 | 5e39c4384467f746 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "write_of_eq'",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " write_of_eq rfl",
"n_chars": 16,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_re... | [
{
"name": "write_of_eq",
"text": "/--\nThis is a low level theorem.\nPrefer using theorems from `Arm.Separate` that provide higher level theorems\nin terms of memory (non)-interference.\n-/\ntheorem write_of_eq {m : Memory} (hix : ix = addr) : m.write addr val ix = val := by\n simp only [write]\n subst ix... | [
{
"name": "write_bytes_eq_extractLsByte",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 33,
"n_chars": 1505,
"n_subproofs": 1,
"n_tactics": 25,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 11,
"n_structural": 5,
"automation_only": false... | 5 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -919,8 +919,18 @@
· simp only [h, ↓reduceIte, ite_eq_right_iff]
omega
+/--
+This is a low level theorem.
+Prefer using theorems from `Arm.Separate` that provide higher level theorems
+in terms of memory (non)-interference.
+-/
+theorem write_of_eq {m : Memory} (hix : ix = addr) : m.write addr val ix = val ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_9 | 30a1e819e3ead043 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "write_of_eq'",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " write_of_eq rfl",
"n_chars": 16,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_re... | [
{
"name": "write_of_eq",
"text": "/--\nThis is a low level theorem.\nPrefer using theorems from `Arm.Separate` that provide higher level theorems\nin terms of memory (non)-interference.\n-/\ntheorem write_of_eq {m : Memory} (hix : ix = addr) : m.write addr val ix = val := by\n simp only [write]\n subst ix... | [
{
"name": "write_bytes_eq",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 27,
"n_chars": 894,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nestin... | 7 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -919,8 +919,18 @@
· simp only [h, ↓reduceIte, ite_eq_right_iff]
omega
+/--
+This is a low level theorem.
+Prefer using theorems from `Arm.Separate` that provide higher level theorems
+in terms of memory (non)-interference.
+-/
+theorem write_of_eq {m : Memory} (hix : ix = addr) : m.write addr val ix = val ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_10 | 02c58b2084e8e02b | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 2 | [
{
"theorem_name": "write_of_eq'",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " write_of_eq rfl",
"n_chars": 16,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_re... | [
{
"name": "write_of_eq",
"text": "/--\nThis is a low level theorem.\nPrefer using theorems from `Arm.Separate` that provide higher level theorems\nin terms of memory (non)-interference.\n-/\ntheorem write_of_eq {m : Memory} (hix : ix = addr) : m.write addr val ix = val := by\n simp only [write]\n subst ix... | [
{
"name": "getLsbD_write_bytes",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 20,
"n_chars": 774,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 8 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -919,8 +919,18 @@
· simp only [h, ↓reduceIte, ite_eq_right_iff]
omega
+/--
+This is a low level theorem.
+Prefer using theorems from `Arm.Separate` that provide higher level theorems
+in terms of memory (non)-interference.
+-/
+theorem write_of_eq {m : Memory} (hix : ix = addr) : m.write addr val ix = val ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_11 | 667acefcbbc555a8 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "Memory.mem_eq_iff_read_mem_bytes_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [memory_rules]\n constructor\n · intro h _ _; rw[h]\n · exact Memory.eq_of_read_mem_bytes_... | [
{
"name": "Memory.eq_of_read_mem_bytes_eq",
"text": "theorem Memory.eq_of_read_mem_bytes_eq {m₁ m₂ : Memory}\n (h : ∀ n addr, m₁.read_bytes n addr = m₂.read_bytes n addr) :\n m₁ = m₂ := by\n funext i\n specialize (h 1 i)\n simp only [Nat.reduceMul, read_bytes, Nat.reduceAdd, read, read_store,\n ... | [
{
"name": "Memory.mem_eq_iff_read_mem_bytes_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 283,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": fal... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -965,13 +965,23 @@
/- Helper lemma for `AxEffects` -/
+theorem Memory.eq_of_read_mem_bytes_eq {m₁ m₂ : Memory}
+ (h : ∀ n addr, m₁.read_bytes n addr = m₂.read_bytes n addr) :
+ m₁ = m₂ := by
+ funext i
+ specialize (h 1 i)
+ simp only [Nat.reduceMul, read_bytes, Nat.reduceAdd, read, read_store,
+ Bi... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_12 | cdf9eb6207f15f4b | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "read_mem_bytes_equal_implies_mem_equal",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n funext i\n rw [read_mem_equal_implies_mem_equal]\n intro addr\n rwa [read_mem_bytes_equal_implies... | [
{
"name": "read_mem_equal_implies_mem_equal",
"text": "private theorem read_mem_equal_implies_mem_equal (s1 s2 : ArmState)\n (h_mem : ∀ (addr : BitVec 64), read_mem addr s1 = read_mem addr s2) :\n s1.mem = s2.mem := by\n funext i\n simpa only [read_mem, read_store] using h_mem i\n\n",
"fan_in": 1,
... | [
{
"name": "read_mem_bytes_equal_implies_mem_equal",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 329,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only":... | 2 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -965,6 +965,12 @@
/- Helper lemma for `AxEffects` -/
+private theorem read_mem_equal_implies_mem_equal (s1 s2 : ArmState)
+ (h_mem : ∀ (addr : BitVec 64), read_mem addr s1 = read_mem addr s2) :
+ s1.mem = s2.mem := by
+ funext i
+ simpa only [read_mem, read_store] using h_mem i
+
private theorem read_mem_b... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_9bd6bb7ff35a_13 | bec0ecb19cceaabf | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/State.lean | State | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 25 | 1 | [
{
"theorem_name": "state_eq_iff_components_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n case mp =>\n intro h\n subst_vars\n simp only [implies_true, and_self]\n case mpr =>\n... | [
{
"name": "reads_equal_implies_gpr_equal",
"text": "private theorem reads_equal_implies_gpr_equal (s1 s2 : ArmState)\n (h : ∀ (f : StateField), r f s1 = r f s2) :\n ArmState.gpr s1 = ArmState.gpr s2 := by\n funext i\n simpa only [r, read_base_gpr, read_store] using h (.GPR i)\n\n",
"fan_in": 1,
... | [
{
"name": "state_eq_iff_components_eq",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 29,
"n_chars": 925,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
... | 8 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Lean.Data.Format
import Arm.BitVec
import Arm.Map
import Arm.Attr
import Arm.MinTheory
------------------------------------... | @@ -965,6 +965,12 @@
/- Helper lemma for `AxEffects` -/
+private theorem reads_equal_implies_gpr_equal (s1 s2 : ArmState)
+ (h : ∀ (f : StateField), r f s1 = r f s2) :
+ ArmState.gpr s1 = ArmState.gpr s2 := by
+ funext i
+ simpa only [r, read_base_gpr, read_store] using h (.GPR i)
+
private theorem reads_equa... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_75c5ae4e61c4_0 | dd148b7f29ee16f7 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/Separate.lean | Separate | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "mem_separate_iff_lt_or_gt_of_mem_legal_of_mem_legal",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intros h\n apply mem_separate_of_lt_or_gt_of_mem_legal_of_mem_legal... | [
{
"name": "lt_or_gt_of_mem_separate_of_mem_legal_of_mem_legal",
"text": "theorem lt_or_gt_of_mem_separate_of_mem_legal_of_mem_legal (h : mem_separate a1 a2 b1 b2)\n (ha : mem_legal a1 a2) (hb : mem_legal b1 b2) :\n a2 < b1 ∨ a1 > b2 := by\n unfold mem_separate mem_overlap at h\n obtain ⟨⟨⟨h₁, h₂⟩, h... | [
{
"name": "mem_separate_iff_lt_or_gt_of_mem_legal_of_mem_legal",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 600,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 5,
"auto... | 2 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Arm.State
import Arm.BitVec
import Tactics.BvOmegaBench
section Separate
open BitVec
-------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Arm.State
import Arm.BitVec
import Tactics.BvOmegaBench
section Separate
open BitVec
-------------------------------------... | @@ -122,6 +122,23 @@
- the first one ends before the second one starts (`a2 < b1`),
- or, the first one starts after the second one ends `(a1 > b2)`,
-/
+theorem lt_or_gt_of_mem_separate_of_mem_legal_of_mem_legal (h : mem_separate a1 a2 b1 b2)
+ (ha : mem_legal a1 a2) (hb : mem_legal b1 b2) :
+ a2 < b1 ∨ a... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_75c5ae4e61c4_1 | be2132f513c0fe88 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/Separate.lean | Separate | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "toNat_add_distrib_of_mem_legal_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [add_def, toNat_ofNat, Nat.reducePow]\n rw [Nat.mod_eq_of_lt]\n apply add_lt_of_mem_legal_... | [
{
"name": "add_lt_of_mem_legal_of_lt",
"text": "/--\nIf we express a memory region as `[a..(a+n)]` for `(n : Nat)`,\nand this memory region is legal, then we could not have had any wraparound.\nThus, it must be the case that (a + n).toNat = a.toNat + n\n-/\ntheorem add_lt_of_mem_legal_of_lt\n (h : mem_le... | [
{
"name": "toNat_add_distrib_of_mem_legal_of_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 437,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": f... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Arm.State
import Arm.BitVec
import Tactics.BvOmegaBench
section Separate
open BitVec
-------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Arm.State
import Arm.BitVec
import Tactics.BvOmegaBench
section Separate
open BitVec
-------------------------------------... | @@ -127,9 +127,27 @@
and this memory region is legal, then we could not have had any wraparound.
Thus, it must be the case that (a + n).toNat = a.toNat + n
-/
+theorem add_lt_of_mem_legal_of_lt
+ (h : mem_legal a (a + n)) :
+ a.toNat + n.toNat < 2^64 := by
+ simp only [mem_legal, decide_eq_true_eq,
+ le_de... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_75c5ae4e61c4_2 | 2a058f0139f7fed8 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/Separate.lean | Separate | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "mem_subset'_of_length_le",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply mem_subset'_of_le_of_le h\n · simp only [Nat.le_refl]\n · omega",
"n_chars": 77,
"n_subproofs": 0,... | [
{
"name": "mem_subset'_of_le_of_le",
"text": "/--\nIf `[a'..a'+an')` begins at least where `[a..an)` begins,\nand ends before `[a..an)` ends, and if `[a..an)` is a subset of `[b..bn)`,\nthen `[a'..a'+an')` is a subset of `[b..bn)`.\n-/\ntheorem mem_subset'_of_le_of_le {a' : BitVec 64} (h : mem_subset' a an ... | [
{
"name": "mem_subset'_of_length_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"m... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Arm.State
import Arm.BitVec
import Tactics.BvOmegaBench
section Separate
open BitVec
-------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Arm.State
import Arm.BitVec
import Tactics.BvOmegaBench
section Separate
open BitVec
-------------------------------------... | @@ -253,11 +253,39 @@
isFalse (fun h' => h ⟨h'.ha.omega_def, h'.hb.omega_def, h'.hstart, h'.hend⟩)
/--
+If `[a'..a'+an')` begins at least where `[a..an)` begins,
+and ends before `[a..an)` ends, and if `[a..an)` is a subset of `[b..bn)`,
+then `[a'..a'+an')` is a subset of `[b..bn)`.
+-/
+theorem mem_subset'_of... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_75c5ae4e61c4_3 | c1169e9404592a13 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Memory/Separate.lean | Separate | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "Memory.read_bytes_write_bytes_eq_of_mem_subset'",
"depth": 1,
"n_commands": 0,
"n_lines": 61,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_getLsbD_eq\n intros i\n obtain ⟨hx, hy, hstart, hend⟩ := hsep\n\n ob... | [
{
"name": "mem_legal'_def",
"text": "/--\n@bollu: have proof automation exploit this.\nEquation lemma for `mem_legal'`.\n-/\ntheorem mem_legal'_def (h : mem_legal' a n) : a.toNat + n ≤ 2^64 := h\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 157,
"n_subproofs": 0,
"n_tactics": 1,
"cyclo... | [
{
"name": "Memory.read_bytes_write_bytes_eq_of_mem_subset'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 68,
"n_chars": 2573,
"n_subproofs": 8,
"n_tactics": 55,
"cyclomatic": 1,
"n_automation": 25,
"n_rewrites": 19,
"n_structural": 7,
"auto... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Arm.State
import Arm.BitVec
import Tactics.BvOmegaBench
section Separate
open BitVec
-------------------------------------... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Siddharth Bhat
-/
import Arm.State
import Arm.BitVec
import Tactics.BvOmegaBench
section Separate
open BitVec
-------------------------------------... | @@ -160,6 +160,12 @@
isFalse (fun h' => h h')
/--
+@bollu: have proof automation exploit this.
+Equation lemma for `mem_legal'`.
+-/
+theorem mem_legal'_def (h : mem_legal' a n) : a.toNat + n ≤ 2^64 := h
+
+/--
The maximum size of the range we can choose to allocate is 2^64.
@bollu: have proof automation expl... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7a87ad9bc590_0 | f4596d6aa9ba36b5 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Exec.lean | Exec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "run_plus",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n1 generalizing s with\n | zero => simp only [run_opener_zero, minimal_theory]\n | succ n n_ih =>\n simp [run_open... | [
{
"name": "run_opener_general",
"text": "theorem run_opener_general\n (n : Nat) (s : ArmState) :\n run (n + 1) s = run n (stepi s) := by\n conv =>\n lhs\n unfold run\n simp\n\n",
"fan_in": 1,
"n_lines": 9,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,... | [
{
"name": "run_plus",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 393,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_nesting": 6
... | 2 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.BitVec
import Arm.Decode
import Arm.Insts
def exec_inst (ai : ArmInst) (s : ArmState) : ArmState :=
open ArmInst in
match ai with
... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.BitVec
import Arm.Decode
import Arm.Insts
def exec_inst (ai : ArmInst) (s : ArmState) : ArmState :=
open ArmInst in
match ai with
... | @@ -133,10 +133,28 @@
theorem run_opener_zero (s : ArmState) :
run 0 s = s := rfl
+theorem run_opener_general
+ (n : Nat) (s : ArmState) :
+ run (n + 1) s = run n (stepi s) := by
+ conv =>
+ lhs
+ unfold run
+ simp
+
theorem run_plus (n1 : Nat) (n2 : Nat) (s : ArmState) :
run (n1 + n2) s = run n2 ... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_7a87ad9bc590_1 | 87b16aba0270093e | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Exec.lean | Exec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "run_oneblock",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [run_plus, exists_eq_left', imp_self]",
"n_chars": 53,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic... | [
{
"name": "run_plus",
"text": "theorem run_plus (n1 : Nat) (n2 : Nat) (s : ArmState) :\n run (n1 + n2) s = run n2 (run n1 s) := by\n induction n1 generalizing s with\n | zero => simp only [run_opener_zero, minimal_theory]\n | succ n n_ih =>\n simp [run_opener_general]\n conv =>\n lhs\n p... | [
{
"name": "run_oneblock",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 187,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2... | 3 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.BitVec
import Arm.Decode
import Arm.Insts
def exec_inst (ai : ArmInst) (s : ArmState) : ArmState :=
open ArmInst in
match ai with
... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.BitVec
import Arm.Decode
import Arm.Insts
def exec_inst (ai : ArmInst) (s : ArmState) : ArmState :=
open ArmInst in
match ai with
... | @@ -141,8 +141,25 @@
unfold run
simp
+theorem run_plus (n1 : Nat) (n2 : Nat) (s : ArmState) :
+ run (n1 + n2) s = run n2 (run n1 s) := by
+ induction n1 generalizing s with
+ | zero => simp only [run_opener_zero, minimal_theory]
+ | succ n n_ih =>
+ simp [run_opener_general]
+ conv =>
+ lhs
+... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_04018115630f_0 | d11c47c49a1b22eb | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Insts/Common.lean | Common | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "CheckSPAlignment_AddWithCarry_64_4",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_all only [CheckSPAlignment, read_gpr, setWidth_eq, Nat.sub_zero, add_eq,\n Aligned_AddWithCarry_... | [
{
"name": "Aligned_AddWithCarry_64_4",
"text": "theorem Aligned_AddWithCarry_64_4 (x : BitVec 64) (y : BitVec 64) (carry_in : BitVec 1)\n (x_aligned : Aligned x 4)\n (y_carry_in_aligned : Aligned (BitVec.add (extractLsb' 0 4 y) (setWidth 4 carry_in)) 4)\n : Aligned (AddWithCarry x y carry_in).fst 4 := by... | [
{
"name": "CheckSPAlignment_AddWithCarry_64_4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 434,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Yan Peng, Nathan Wetzler
-/
import Std.Tactic.BVDecide
import Arm.BitVec
import Arm.State
import Arm.Insts.CosimM
section Common
open BitVec
----... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Yan Peng, Nathan Wetzler
-/
import Std.Tactic.BVDecide
import Arm.BitVec
import Arm.State
import Arm.Insts.CosimM
section Common
open BitVec
----... | @@ -134,6 +134,14 @@
instance : Decidable (Aligned x a) := by
cases a <;> simp only [Aligned] <;> infer_instance
+theorem Aligned_AddWithCarry_64_4 (x : BitVec 64) (y : BitVec 64) (carry_in : BitVec 1)
+ (x_aligned : Aligned x 4)
+ (y_carry_in_aligned : Aligned (BitVec.add (extractLsb' 0 4 y) (setWidth 4 carry_... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_04018115630f_1 | 3139ddc4309b8417 | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Insts/Common.lean | Common | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "shift_right_common_aux_64_2_tff",
"depth": 1,
"n_commands": 0,
"n_lines": 59,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold shift_right_common_aux\n simp only [minimal_theory, bitvec_rules]\n unfold shift_right_common_aux... | [
{
"name": "shift_le",
"text": "theorem shift_le (x : Nat) (shift :Nat) :\n x >>> shift ≤ x := by\n simp only [Nat.shiftRight_eq_div_pow]\n exact Nat.div_le_self x (2 ^ shift)\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 147,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n... | [
{
"name": "shift_right_common_aux_64_2_tff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 70,
"n_chars": 2574,
"n_subproofs": 4,
"n_tactics": 53,
"cyclomatic": 1,
"n_automation": 13,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": fal... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Yan Peng, Nathan Wetzler
-/
import Std.Tactic.BVDecide
import Arm.BitVec
import Arm.State
import Arm.Insts.CosimM
section Common
open BitVec
----... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Yan Peng, Nathan Wetzler
-/
import Std.Tactic.BVDecide
import Arm.BitVec
import Arm.State
import Arm.Insts.CosimM
section Common
open BitVec
----... | @@ -589,6 +589,11 @@
termination_by (info.elements - e)
-- FIXME: should this be upstreamed?
+theorem shift_le (x : Nat) (shift :Nat) :
+ x >>> shift ≤ x := by
+ simp only [Nat.shiftRight_eq_div_pow]
+ exact Nat.div_le_self x (2 ^ shift)
+
set_option bv.ac_nf false
@[state_simp_rules]
@@ -648,7 +653,7 @@
... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_04018115630f_2 | 16c1df8e5cdb634c | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Arm/Insts/Common.lean | Common | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "shift_right_common_aux_32_4_fff",
"depth": 1,
"n_commands": 0,
"n_lines": 77,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold shift_right_common_aux\n simp only [minimal_theory, bitvec_rules]\n unfold shift_right_common_aux... | [
{
"name": "ofInt_eq_signExtend",
"text": "theorem ofInt_eq_signExtend (x : BitVec 32) :\n BitVec.ofInt 33 x.toInt = signExtend 33 x := by\n exact rfl\n\n-- FIXME: where to put this?\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "shift_right_common_aux_32_4_fff",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 88,
"n_chars": 3429,
"n_subproofs": 2,
"n_tactics": 75,
"cyclomatic": 2,
"n_automation": 26,
"n_rewrites": 10,
"n_structural": 5,
"automation_only": fa... | 2 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Yan Peng, Nathan Wetzler
-/
import Std.Tactic.BVDecide
import Arm.BitVec
import Arm.State
import Arm.Insts.CosimM
section Common
open BitVec
----... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel, Yan Peng, Nathan Wetzler
-/
import Std.Tactic.BVDecide
import Arm.BitVec
import Arm.State
import Arm.Insts.CosimM
section Common
open BitVec
----... | @@ -665,6 +665,11 @@
bv_decide
-- FIXME: where to put this?
+theorem ofInt_eq_signExtend (x : BitVec 32) :
+ BitVec.ofInt 33 x.toInt = signExtend 33 x := by
+ exact rfl
+
+-- FIXME: where to put this?
theorem msb_signExtend (x : BitVec n) (hw: n < n'):
(signExtend n' x).msb = x.msb := by
rcases n' wi... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_119ae17ed448_0 | 575225ac7a27577b | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/SHA512/SHA512_block_armv8_rules.lean | SHA512_block_armv8_rules | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "sha512h_rule_1",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_all! only [Nat.sub_zero];\n repeat (unfold binary_vector_op_aux elem_set elem_get; simp)\n unfold BitVec.partInstall... | [
{
"name": "and_nop_lemma",
"text": "private theorem and_nop_lemma (x : BitVec 64) :\n (setWidth 128 x) &&& 0xffffffffffffffff#128 = (setWidth 128 x) := by\n bv_decide\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 132,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automati... | [
{
"name": "sha512h_rule_1",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 45,
"n_chars": 2077,
"n_subproofs": 0,
"n_tactics": 26,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 3 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.Insts.DPSFP.Insts
import Specs.SHA512
import Std.Tactic.BVDecide
set_option sat.timeout 60
-- See https://github.com/leanprover/lean4/i... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.Insts.DPSFP.Insts
import Specs.SHA512
import Std.Tactic.BVDecide
set_option sat.timeout 60
-- See https://github.com/leanprover/lean4/i... | @@ -19,6 +19,10 @@
open DPSFP
open SHA2
+private theorem and_nop_lemma (x : BitVec 64) :
+ (setWidth 128 x) &&& 0xffffffffffffffff#128 = (setWidth 128 x) := by
+ bv_decide
+
private theorem extractLsb'_low_64_from_setWidth_128_or (x y : BitVec 64) :
extractLsb' 0 64 ((setWidth 128 x) ||| (setWidth 128 y <<< 6... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_119ae17ed448_1 | 9508b3d372ec71ea | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/SHA512/SHA512_block_armv8_rules.lean | SHA512_block_armv8_rules | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "sha512h_and_sha512h2_rule",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [sha512h2_rule, sha512h]\n generalize extractLsb' 0 64 x = x0\n -- generalize extractLsb' 64 64 x = x1\n... | [
{
"name": "sha512h2_rule",
"text": "theorem sha512h2_rule (a b c : BitVec 128) :\n sha512h2 a b c =\n let a0 := extractLsb' 0 64 a\n let b1 := extractLsb' 64 64 b\n let b0 := extractLsb' 0 64 b\n let c0 := extractLsb' 0 64 c\n let c1 := extractLsb' 64 64 c\n ((compression_update_t2 b0 a0 b1) + c1)... | [
{
"name": "sha512h_and_sha512h2_rule",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 74,
"n_chars": 2952,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.Insts.DPSFP.Insts
import Specs.SHA512
import Std.Tactic.BVDecide
set_option sat.timeout 60
-- See https://github.com/leanprover/lean4/i... | /-
Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
-/
import Arm.Insts.DPSFP.Insts
import Specs.SHA512
import Std.Tactic.BVDecide
set_option sat.timeout 60
-- See https://github.com/leanprover/lean4/i... | @@ -19,6 +19,18 @@
open DPSFP
open SHA2
+theorem sha512h2_rule (a b c : BitVec 128) :
+ sha512h2 a b c =
+ let a0 := extractLsb' 0 64 a
+ let b1 := extractLsb' 64 64 b
+ let b0 := extractLsb' 0 64 b
+ let c0 := extractLsb' 0 64 c
+ let c1 := extractLsb' 64 64 c
+ ((compression_update_t2 b0 a0 b1) + c1) ++... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
ablate_5f4f6362d3fc_2 | 6f67cbaa92ebf00d | lean | lean | github.com/leanprover/LNSym | 5c05220ff970e3bdd7813ad0c9ef3741522c8b92 | Proofs/Experiments/AddLoop/AddLoopTandem.lean | AddLoopTandem | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "program.stepi_0x4005b0_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have := program.stepi_eq_0x4005b0 h_program h_pc h_err\n simp only [minimal_theory] at this\n simp_all (config... | [
{
"name": "AddWithCarry.all_ones_zero_flag_64",
"text": "private theorem AddWithCarry.all_ones_zero_flag_64 (x : BitVec 64) :\n ((AddWithCarry x 0xffffffffffffffff#64 0x1#1).snd.z = 1#1) ↔\n (x = 0#64) := by\n simp only [AddWithCarry, bitvec_rules, state_simp_rules]\n repeat split\n · bv_decide\n · bv... | [
{
"name": "program.stepi_0x4005b0_cut",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 932,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | /-
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Shilpi Goel
Experimental: Use the Correctness module to prove that this program computes the
following via a naive loop that iterates over `x0`:
`x0 := x0 + x1`
... | @@ -121,6 +121,21 @@
-------------------------------------------------------------------------------
-- Generating the program effects and non-effects
+private theorem AddWithCarry.all_ones_zero_flag_64 (x : BitVec 64) :
+ ((AddWithCarry x 0xffffffffffffffff#64 0x1#1).snd.z = 1#1) ↔
+ (x = 0#64) := by
+ simp onl... | {
"repo": "LNSym",
"git_repo": "github.com/leanprover/LNSym",
"revision": "5c05220ff970e3bdd7813ad0c9ef3741522c8b92",
"lean_toolchain": "leanprover/lean4:nightly-2024-10-07",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-del... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.