miniCTX: Neural Theorem Proving with (Long-)Contexts
Paper • 2408.03350 • Published • 1
srcContext stringlengths 274 35.4k | theoremStatement stringlengths 62 1.08k | theoremName stringlengths 16 52 | fileCreated dict | theoremCreated dict | file stringlengths 26 42 | module stringlengths 15 31 | jsonFile stringlengths 21 37 | positionMetadata dict | dependencyMetadata dict | proofMetadata dict |
|---|---|---|---|---|---|---|---|---|---|---|
import ConNF.Model.RaiseStrong
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
open scoped Pointwise
namespace ConNF
variable [Params.{u}]
/-- A redefinition of the derivative of allowable permutations that is invarian... | theorem TSet.symmetric {α β : Λ} (x : TSet α) (hβ : (β : TypeIndex) < α) :
Symmetric {y : TSet β | y ∈[hβ] x} hβ | ConNF.TSet.symmetric | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "b0bc9d69a413800c2ef0d0e3495ee0e71dc3fea7",
"date": "2024-12-01T00:00:00"
} | ConNF/ConNF/Model/TTT.lean | ConNF.Model.TTT | ConNF.Model.TTT.jsonl | {
"lineInFile": 154,
"tokenPositionInFile": 5178,
"theoremPositionInFile": 12
} | {
"inFilePremises": true,
"numInFilePremises": 4,
"repositoryPremises": true,
"numRepositoryPremises": 39,
"numPremises": 84
} | {
"hasProof": true,
"proof": ":= by\n obtain ⟨S, hS⟩ := exists_support x\n use S\n intro ρ hρ\n conv_rhs => rw [← hS ρ hρ]\n simp only [← forget_mem_forget, smul_forget, StrSet.mem_smul_iff]\n ext y\n rw [Set.mem_smul_set_iff_inv_smul_mem, Set.mem_setOf_eq, Set.mem_setOf_eq,\n smul_forget, allPermForget_i... |
import ConNF.Background.Rel
import ConNF.Base.Small
/-!
# Enumerations
In this file, we define enumerations of a type.
## Main declarations
* `ConNF.Enumeration`: The type family of enumerations.
-/
universe u
open Cardinal
namespace ConNF
variable [Params.{u}] {X Y : Type u}
@[ext]
structure Enumeration (X : ... | @[simp]
theorem not_mem_empty (x : X) : x ∉ Enumeration.empty | ConNF.Enumeration.not_mem_empty | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Enumeration.lean | ConNF.ModelData.Enumeration | ConNF.ModelData.Enumeration.jsonl | {
"lineInFile": 66,
"tokenPositionInFile": 1348,
"theoremPositionInFile": 5
} | {
"inFilePremises": true,
"numInFilePremises": 4,
"repositoryPremises": true,
"numRepositoryPremises": 6,
"numPremises": 13
} | {
"hasProof": true,
"proof": ":= by\n rintro ⟨i, h⟩\n cases h",
"proofType": "tactic",
"proofLengthLines": 2,
"proofLengthTokens": 31
} |
import ConNF.Levels.Path
/-!
# Trees
In this file, we define the notion of a tree on a type.
## Main declarations
* `ConNF.Tree`: The type family of trees parametrised by a given type.
-/
universe u
open Cardinal
namespace ConNF
variable [Params.{u}] {X Y : Type _} {α β γ : TypeIndex}
/-- An `α`-tree of `X` as... | @[simp]
theorem mul_deriv [Group X] (T₁ T₂ : Tree X α) (A : α ↝ β) :
(T₁ * T₂) ⇘ A = T₁ ⇘ A * T₂ ⇘ A | ConNF.Tree.mul_deriv | {
"commit": "8896e416a16c39e1fe487b5fc7c78bc20c4e182b",
"date": "2024-12-03T00:00:00"
} | {
"commit": "012929981ca97cb4447881b386c61e3bac0c6b93",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Levels/Tree.lean | ConNF.Levels.Tree | ConNF.Levels.Tree.jsonl | {
"lineInFile": 102,
"tokenPositionInFile": 2187,
"theoremPositionInFile": 13
} | {
"inFilePremises": true,
"numInFilePremises": 3,
"repositoryPremises": true,
"numRepositoryPremises": 7,
"numPremises": 16
} | {
"hasProof": true,
"proof": ":=\n rfl",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 8
} |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem mem_codom_iff (r : TSet α) (x : TSet δ) :
x ∈' codom hβ hγ hδ r ↔ x ∈ (ExternalRel hβ hγ hδ r).codom | ConNF.mem_codom_iff | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 139,
"tokenPositionInFile": 4169,
"theoremPositionInFile": 23
} | {
"inFilePremises": true,
"numInFilePremises": 7,
"repositoryPremises": true,
"numRepositoryPremises": 22,
"numPremises": 57
} | {
"hasProof": true,
"proof": ":= by\n simp only [codom, mem_compl_iff, mem_typeLower_iff, not_forall, not_not]\n constructor\n · rintro ⟨y, hy⟩\n obtain ⟨a, b, rfl, hb⟩ := exists_of_mem_singletonImage lt_higherIndex hβ hγ hδ hy\n rw [singleton_inj] at hb\n subst hb\n rw [singletonImage_spec] at hy\n ... |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
theorem not_mem_scoderiv_botDeriv (S : Support... | theorem convAtoms_injective_of_fixes {S : Support α} {T : Support γ}
{ρ₁ ρ₂ : AllPerm β} {hγ : (γ : TypeIndex) < β}
(hρ₁ : ρ₁ᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim)
(hρ₂ : ρ₂ᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim)
(A : ↑α ↝ ⊥) :
(convAtoms
(S + (ρ₁ᵁ • ((T ↗ hγ).st... | ConNF.Support.convAtoms_injective_of_fixes | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 181,
"tokenPositionInFile": 7503,
"theoremPositionInFile": 5
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": true,
"numRepositoryPremises": 71,
"numPremises": 148
} | {
"hasProof": true,
"proof": ":= by\n rw [Support.smul_eq_iff] at hρ₁ hρ₂\n constructor\n rintro a₁ a₂ a₃ ⟨i, hi₁, hi₂⟩ ⟨j, hj₁, hj₂⟩\n simp only [add_derivBot, BaseSupport.add_atoms, Rel.inv_apply,\n Enumeration.rel_add_iff] at hi₁ hi₂ hj₁ hj₂\n obtain hi₁ | ⟨i, rfl, hi₁⟩ := hi₁\n · obtain hi₂ | ⟨i', rfl,... |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | theorem BaseSupport.le_add_left {S T : BaseSupport} :
S ≤ T + S | ConNF.BaseSupport.le_add_left | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "251ac752f844dfde539ac2bd3ff112305ad59139",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 487,
"tokenPositionInFile": 13576,
"theoremPositionInFile": 51
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 25
} | {
"hasProof": true,
"proof": ":= by\n constructor\n · intro a ha\n simp only [add_atoms, Enumeration.mem_add_iff]\n exact Or.inr ha\n · intro N hN\n simp only [add_nearLitters, Enumeration.mem_add_iff]\n exact Or.inr hN",
"proofType": "tactic",
"proofLengthLines": 7,
"proofLengthTokens": 197
} |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | theorem BaseSupport.le_add_right {S T : BaseSupport} :
S ≤ S + T | ConNF.BaseSupport.le_add_right | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "251ac752f844dfde539ac2bd3ff112305ad59139",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 477,
"tokenPositionInFile": 13240,
"theoremPositionInFile": 50
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 25
} | {
"hasProof": true,
"proof": ":= by\n constructor\n · intro a ha\n simp only [Support.add_derivBot, BaseSupport.add_atoms, Enumeration.mem_add_iff]\n exact Or.inl ha\n · intro N hN\n simp only [Support.add_derivBot, BaseSupport.add_nearLitters, Enumeration.mem_add_iff]\n exact Or.inl hN",
"proofTyp... |
import ConNF.External.Basic
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex)... | theorem Support.Supports.ofSingleton {S : Support α} {x : TSet β}
(h : S.Supports {x}') :
letI : Level := ⟨α⟩
letI : LeLevel α := ⟨le_rfl⟩
(S.strong ↘ hβ).Supports x | ConNF.Support.Supports.ofSingleton | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "1c08486feb882444888c228ce1501e92bb85e0e2",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/WellOrder.lean | ConNF.External.WellOrder | ConNF.External.WellOrder.jsonl | {
"lineInFile": 113,
"tokenPositionInFile": 3749,
"theoremPositionInFile": 6
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": true,
"numRepositoryPremises": 43,
"numPremises": 114
} | {
"hasProof": true,
"proof": ":= by\n refine ⟨?_, λ h ↦ by cases h⟩\n intro ρ hρ\n open scoped Pointwise in\n have := sUnion_singleton_symmetric_aux hγ hβ {y | y ∈' x} S ?_ ρ hρ\n · apply ConNF.ext hγ\n intro z\n simp only [Set.ext_iff, Set.mem_setOf_eq, Set.mem_smul_set_iff_inv_smul_mem] at this\n rw... |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | theorem Support.le_add_right {α : TypeIndex} {S T : Support α} :
S ≤ S + T | ConNF.Support.le_add_right | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "251ac752f844dfde539ac2bd3ff112305ad59139",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 532,
"tokenPositionInFile": 14912,
"theoremPositionInFile": 57
} | {
"inFilePremises": true,
"numInFilePremises": 9,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 23
} | {
"hasProof": true,
"proof": ":= by\n intro A\n rw [add_derivBot]\n exact BaseSupport.le_add_right",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 68
} |
import ConNF.Model.TTT
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) < γ) (hε : (ε :... | @[simp]
theorem singleton_eq_up_iff (x y z : TSet β) :
singleton hβ z = up hβ x y ↔ x = z ∧ y = z | ConNF.TSet.singleton_eq_up_iff | {
"commit": "f804f5c71cfaa98223fc227dd822801e8bf77004",
"date": "2024-03-30T00:00:00"
} | {
"commit": "79d0b7460f1a514629674a45c428d31c1a50bb03",
"date": "2024-12-01T00:00:00"
} | ConNF/ConNF/Model/Hailperin.lean | ConNF.Model.Hailperin | ConNF.Model.Hailperin.jsonl | {
"lineInFile": 114,
"tokenPositionInFile": 3103,
"theoremPositionInFile": 10
} | {
"inFilePremises": true,
"numInFilePremises": 2,
"repositoryPremises": true,
"numRepositoryPremises": 10,
"numPremises": 30
} | {
"hasProof": true,
"proof": ":= by\n rw [← up_eq_singleton_iff hβ x y z, eq_comm]",
"proofType": "tactic",
"proofLengthLines": 1,
"proofLengthTokens": 52
} |
import ConNF.Model.RunInduction
/-!
# Externalisation
In this file, we convert many of our *internal* results (i.e. inside the induction) to *external*
ones (i.e. defined using the global `TSet`/`AllPerm` definitions).
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Car... | theorem globalPreCoherentData_eq [Level] :
globalPreCoherentData = preCoherentData (λ β _ ↦ motive β) (λ β _ ↦ hypothesis β) | ConNF.globalPreCoherentData_eq | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "e409f3d0cd939e7218c3f39dcf3493c4b6e0b821",
"date": "2024-11-29T00:00:00"
} | ConNF/ConNF/Model/Externalise.lean | ConNF.Model.Externalise | ConNF.Model.Externalise.jsonl | {
"lineInFile": 99,
"tokenPositionInFile": 2555,
"theoremPositionInFile": 4
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 36,
"numPremises": 61
} | {
"hasProof": true,
"proof": ":= by\n have := globalLeData_eq\n rw [LeData.ext_iff] at this\n apply PreCoherentData.ext\n · exact this.1\n · exact this.2\n · unfold globalPreCoherentData\n apply heq_funext; intro β\n apply heq_funext; intro γ\n apply heq_funext; intro hβ\n apply heq_funext; intro ... |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
| theorem not_mem_scoderiv_botDeriv (S : Support γ) (N : NearLitter) :
N ∉ (S ↗ hγ ⇘. (Path.nil ↘.))ᴺ | ConNF.Support.not_mem_scoderiv_botDeriv | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "251ac752f844dfde539ac2bd3ff112305ad59139",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 24,
"tokenPositionInFile": 274,
"theoremPositionInFile": 0
} | {
"inFilePremises": false,
"numInFilePremises": 0,
"repositoryPremises": true,
"numRepositoryPremises": 32,
"numPremises": 71
} | {
"hasProof": true,
"proof": ":= by\n rintro ⟨i, ⟨A, N'⟩, h₁, h₂⟩\n simp only [Prod.mk.injEq] at h₂\n cases A\n case sderiv δ A hδ _ =>\n simp only [Path.deriv_sderiv] at h₂\n cases A\n case nil => cases h₂.1\n case sderiv ζ A hζ _ =>\n simp only [Path.deriv_sderiv] at h₂\n cases h₂.1",
... |
import ConNF.Model.RaiseStrong
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
open scoped Pointwise
namespace ConNF
variable [Params.{u}]
/-- A redefinition of the derivative of allowable permutations that is invarian... | theorem sUnion_singleton_symmetric_aux' {α β γ : Λ}
(hγ : (γ : TypeIndex) < β) (hβ : (β : TypeIndex) < α) (s : Set (TSet γ)) (S : Support α)
(hS : ∀ ρ : AllPerm α, ρᵁ • S = S → ρ ↘ hβ • singleton hγ '' s = singleton hγ '' s) :
letI : Level := ⟨α⟩
letI : LeLevel α := ⟨le_rfl⟩
∀ (ρ : AllPerm β), ρᵁ • ... | ConNF.sUnion_singleton_symmetric_aux' | {
"commit": "6fdc87c6b30b73931407a372f1430ecf0fef7601",
"date": "2024-12-03T00:00:00"
} | {
"commit": "1c08486feb882444888c228ce1501e92bb85e0e2",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/Model/TTT.lean | ConNF.Model.TTT | ConNF.Model.TTT.jsonl | {
"lineInFile": 216,
"tokenPositionInFile": 7508,
"theoremPositionInFile": 20
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 43,
"numPremises": 94
} | {
"hasProof": true,
"proof": ":= by\n letI : Level := ⟨α⟩\n letI : LeLevel α := ⟨le_rfl⟩\n letI : LtLevel β := ⟨hβ⟩\n rintro ρ hρ _ ⟨x, hx, rfl⟩\n obtain ⟨T, hT⟩ := exists_support x\n obtain ⟨ρ', hρ'₁, hρ'₂⟩ := Support.exists_allowable_of_fixes S.strong S.strong_strong T ρ hγ hρ\n have hρ's := hS ρ' (smul_eq... |
import ConNF.Background.Rel
import ConNF.Base.Small
/-!
# Enumerations
In this file, we define enumerations of a type.
## Main declarations
* `ConNF.Enumeration`: The type family of enumerations.
-/
universe u
open Cardinal
namespace ConNF
variable [Params.{u}] {X Y : Type u}
@[ext]
structure Enumeration (X : ... | theorem add_rel_dom {X : Type _} (E F : Enumeration X) :
(E + F).rel.dom = E.rel.dom ∪ (E.bound + ·) '' F.rel.dom | ConNF.Enumeration.add_rel_dom | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/ModelData/Enumeration.lean | ConNF.ModelData.Enumeration | ConNF.ModelData.Enumeration.jsonl | {
"lineInFile": 365,
"tokenPositionInFile": 10091,
"theoremPositionInFile": 31
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 9,
"numPremises": 49
} | {
"hasProof": true,
"proof": ":= by\n ext i\n simp only [Rel.dom, rel_add_iff, Set.mem_setOf_eq, Set.mem_union, Set.mem_image]\n aesop",
"proofType": "tactic",
"proofLengthLines": 3,
"proofLengthTokens": 104
} |
import ConNF.Model.Hailperin
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex... | @[simp]
theorem mem_typeLower_iff (x : TSet α) :
∀ a, a ∈' typeLower hβ hγ hδ hε x ↔ ∀ b, ⟨ b, {a}' ⟩' ∈' x | ConNF.mem_typeLower_iff | {
"commit": "b12701769822aaf5451982e26d7b7d1c2f21b137",
"date": "2024-04-11T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/Model/Result.lean | ConNF.Model.Result | ConNF.Model.Result.jsonl | {
"lineInFile": 109,
"tokenPositionInFile": 2983,
"theoremPositionInFile": 27
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 13,
"numPremises": 25
} | {
"hasProof": true,
"proof": ":=\n (TSet.exists_typeLower hβ hγ hδ hε x).choose_spec",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 54
} |
import ConNF.Base.TypeIndex
/-!
# Paths of type indices
In this file, we define the notion of a *path*, and the derivative and coderivative operations.
## Main declarations
* `ConNF.Path`: A path of type indices.
* `ConNF.Path.recSderiv`, `ConNF.Path.recSderivLe`, `ConNF.Path.recSderivGlobal`:
Downwards inducti... | @[simp]
theorem Path.scoderiv_left_inj {A B : β ↝ γ} {h : β < α} :
A ↗ h = B ↗ h ↔ A = B | ConNF.Path.scoderiv_left_inj | {
"commit": "8896e416a16c39e1fe487b5fc7c78bc20c4e182b",
"date": "2024-12-03T00:00:00"
} | {
"commit": "ce890707e37ede74a2fcd66134d3f403335c5cc1",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Levels/Path.lean | ConNF.Levels.Path | ConNF.Levels.Path.jsonl | {
"lineInFile": 337,
"tokenPositionInFile": 10251,
"theoremPositionInFile": 43
} | {
"inFilePremises": true,
"numInFilePremises": 6,
"repositoryPremises": true,
"numRepositoryPremises": 11,
"numPremises": 21
} | {
"hasProof": true,
"proof": ":=\n deriv_right_inj",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 20
} |
import ConNF.Model.Externalise
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal
namespace ConNF
variable [Params.{u}] {β γ : Λ} {hγ : (γ : TypeIndex) < β}
namespace Support
theorem not_mem_scoderiv_botDeriv (S : Support... | theorem spec_same_of_fixes (S : Support α) (hS : S.Strong) (T : Support γ) (ρ : AllPerm β)
(hρ : ρᵁ • (S ↘ LtLevel.elim : Support β) = S ↘ LtLevel.elim) :
(S + ((T ↗ hγ).strong +
(S ↘ LtLevel.elim + (T ↗ hγ).strong).interferenceSupport) ↗ LtLevel.elim).spec =
(S + (ρᵁ • ((T ↗ hγ).strong +
(S ↘ L... | ConNF.Support.spec_same_of_fixes | {
"commit": "abf71bc79c407ceb462cc2edd2d994cda9cdef05",
"date": "2024-04-04T00:00:00"
} | {
"commit": "6709914ae7f5cd3e2bb24b413e09aa844554d234",
"date": "2024-11-30T00:00:00"
} | ConNF/ConNF/Model/RaiseStrong.lean | ConNF.Model.RaiseStrong | ConNF.Model.RaiseStrong.jsonl | {
"lineInFile": 699,
"tokenPositionInFile": 34619,
"theoremPositionInFile": 13
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 46,
"numPremises": 83
} | {
"hasProof": true,
"proof": ":= by\n rw [Support.spec_eq_spec_iff]\n apply sameSpec_antisymm\n · have := sameSpecLe_of_fixes S hS T 1 ρ hγ ?_ hρ\n · simp only [allPermForget_one, one_smul, smul_add] at this\n exact this\n · simp only [allPermForget_one, one_smul]\n · have := sameSpecLe_of_fixes S hS... |
import ConNF.Model.Hailperin
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex... | @[simp]
theorem vCross_spec (x : TSet γ) :
∀ a, a ∈' vCross hβ hγ hδ x ↔ ∃ b c, a = ⟨b, c⟩' ∧ c ∈' x | ConNF.vCross_spec | {
"commit": "b12701769822aaf5451982e26d7b7d1c2f21b137",
"date": "2024-04-11T00:00:00"
} | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | ConNF/ConNF/Model/Result.lean | ConNF.Model.Result | ConNF.Model.Result.jsonl | {
"lineInFile": 101,
"tokenPositionInFile": 2742,
"theoremPositionInFile": 25
} | {
"inFilePremises": true,
"numInFilePremises": 1,
"repositoryPremises": true,
"numRepositoryPremises": 12,
"numPremises": 27
} | {
"hasProof": true,
"proof": ":=\n (TSet.exists_cross hβ hγ hδ x).choose_spec",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 47
} |
import ConNF.Model.Result
/-!
# New file
In this file...
## Main declarations
* `ConNF.foo`: Something new.
-/
noncomputable section
universe u
open Cardinal Ordinal ConNF.TSet
namespace ConNF
variable [Params.{u}] {α β γ δ ε ζ : Λ} (hβ : (β : TypeIndex) < α) (hγ : (γ : TypeIndex) < β)
(hδ : (δ : TypeIndex) <... | @[simp]
theorem membership_spec :
∀ a b, ⟨{a}', b⟩' ∈' membership hβ hγ hδ hε ↔ a ∈' b | ConNF.membership_spec | {
"commit": "66f4e3291020d4198ca6ede816acae5cee584a07",
"date": "2025-01-06T00:00:00"
} | {
"commit": "6dd8406a01cc28b071bb26965294469664a1b592",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/External/Basic.lean | ConNF.External.Basic | ConNF.External.Basic.jsonl | {
"lineInFile": 186,
"tokenPositionInFile": 5663,
"theoremPositionInFile": 31
} | {
"inFilePremises": true,
"numInFilePremises": 7,
"repositoryPremises": true,
"numRepositoryPremises": 26,
"numPremises": 64
} | {
"hasProof": true,
"proof": ":= by\n intro a b\n rw [membership, mem_inter_iff, subset_spec]\n simp only [mem_cross_iff, op_inj, mem_cardinalOne_iff, mem_univ_iff, and_true, exists_and_right,\n exists_and_left, exists_eq', exists_eq_left', singleton_inj]\n constructor\n · intro h\n exact h a ((typedMem_... |
import ConNF.ModelData.PathEnumeration
/-!
# Supports
In this file, we define the notion of a support.
## Main declarations
* `ConNF.BaseSupport`: The type of supports of atoms.
* `ConNF.Support`: The type of supports of objects of arbitrary type indices.
-/
universe u
open Cardinal
namespace ConNF
variable [Pa... | @[simp]
theorem derivBot_nearLitters {α : TypeIndex} (S : Support α) (A : α ↝ ⊥) :
Sᴺ ⇘. A = (S ⇘. A)ᴺ | ConNF.Support.derivBot_nearLitters | {
"commit": "39c33b4a743bea62dbcc549548b712ffd38ca65c",
"date": "2024-12-05T00:00:00"
} | {
"commit": "d9f28df240ac4df047c3af0d236aed2e437e571f",
"date": "2025-01-07T00:00:00"
} | ConNF/ConNF/ModelData/Support.lean | ConNF.ModelData.Support | ConNF.ModelData.Support.jsonl | {
"lineInFile": 258,
"tokenPositionInFile": 6529,
"theoremPositionInFile": 25
} | {
"inFilePremises": true,
"numInFilePremises": 5,
"repositoryPremises": true,
"numRepositoryPremises": 14,
"numPremises": 19
} | {
"hasProof": true,
"proof": ":=\n rfl",
"proofType": "term",
"proofLengthLines": 1,
"proofLengthTokens": 8
} |
miniCTX-v2 is a context-rich dataset for evaluation of neural theorem proving under a more realistic scenario. miniCTX-v2 is an updated version of miniCTX with new theorems extracted after a more recent cutoff date of November 28, 2024.
See our project page for more details.
An entry in the miniCTX dataset consists of the theorem statement, preceding file contents, and metadata information. For example, given the following theorem s_eq_pow_two in context:
import Mathlib.Data.Real.Basic
/-!
# Square function
We define the squaring function `s : ℝ → ℝ` to be `s x := x * x`.
-/
def s (x : ℝ) : ℝ := x * x
lemma s_eq_pow_two {x : ℝ} : s x = x ^ 2 := by
rw [s, pow_two]
The problem is formatted in JSON as follows:
{
# Preceding file content
"srcContext": "import Mathlib.Data.Real.Basic\n\n/-!\n# Square function\nWe define the squaring function `s : ℝ → ℝ` to be `s x := x * x`.\n-/\n\ndef s (x : ℝ) : ℝ := x * x\n\n",
# Theorem statement
"theoremStatement": "lemma s_eq_pow_two {x : ℝ} : s x = x ^ 2",
# Fully qualified theorem name
"theoremName": "s_eq_pow_two",
# Temporal metadata
"fileCreated": {"commit":"(git commit)", "date":"(date the commit is updated)"},
"theoremCreated": {"commit":"(git commit)", "date":"(date the commit is updated)"},
# Source metadata
"file": "MyProject/Square.lean",
"module": "MyProject.Square",
"positionMetadata": {
# Line number the theorem is on
"lineInFile": 10,
# Number of tokens before the theorem
"tokenPositionInFile": 152,
# Number of premises (definitions, theorems) before the theorem
"theoremPositionInFile": 1
},
# Dependency metadata
"dependencyMetadata": {
# Number of definitions or lemmas defined in this file that the theorem uses
"inFilePremises": true,
"numInFilePremises": 1,
# Number of definitions or lemmas defined in this repository that the theorem uses (including in-file ones)
"repositoryPremises": true
"numRepositoryPremises": 1,
# Number of total premises (in file, repository, or otherwise)
"numPremises": 2,
},
# Proof metadata
"proofMetadata": {
"hasProof": true,
"proof": "by\n rw [s, pow_two]",
"proofType": "tactic",
"proofLengthLines": 2,
"proofLengthTokens": 20
}
}
In addition to individual entries, we also provide the link and git commit version of each split for evaluation:
miniCTX-v2 uses Lean version v4.16.0.
Please cite:
@article{hu2024minictx,
title={miniCTX: Neural Theorem Proving with (Long-) Contexts},
author={Hu, Jiewen and Zhu, Thomas and Welleck, Sean},
journal={arXiv preprint arXiv:2408.03350},
year={2024}
}