Dataset Viewer
Auto-converted to Parquet Duplicate
dataset
stringclasses
1 value
split
stringclasses
1 value
row_index
int64
0
4.5k
theorem
stringlengths
7
81
file_path
stringclasses
723 values
repo_url
stringclasses
1 value
repo_commit
stringclasses
1 value
tactic
stringlengths
3
2.13k
text_state
stringlengths
7
2.31k
text_target_state
stringlengths
0
4.07k
raw_goal_sexp
stringlengths
10
11.8M
raw_hyp_sexps
stringlengths
2
15.6M
model_goal_sexp
stringlengths
10
2.68M
model_hyp_sexps
stringlengths
2
3.62M
source_syntax
stringlengths
179
164k
syntax_args
stringclasses
256 values
term_ranges
stringlengths
2
6.01k
local_context
stringlengths
2
10.3k
unit_index
int64
3
1.26k
invocation_index
int64
0
357
alignment_kind
stringclasses
2 values
target_state_matches_invocation
bool
2 classes
pending_goal_count
int64
1
1
hypothesis_count
int64
0
77
hypothesis_names_match
bool
2 classes
raw_schema_version
int64
4
4
raw_extractor_version
stringclasses
1 value
model_schema_version
int64
2
2
model_normalization
stringclasses
1 value
trace_schema_version
int64
3
3
trace_extractor_version
stringclasses
1 value
pantograph_commit
stringclasses
1 value
model_pantograph_commit
stringclasses
1 value
raw_record_sha256
stringlengths
64
64
state_sha256
stringlengths
64
64
tactic_sha256
stringlengths
64
64
target_state_sha256
stringlengths
64
64
cat-searcher/leandojo-benchmark-4-random
test
0
CategoryTheory.Equivalence.invFunIdAssoc_hom_app
Mathlib/CategoryTheory/Equivalence.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
dsimp [<a>CategoryTheory.Equivalence.invFunIdAssoc</a>]
C : Type u₁ inst✝² : Category.{v₁, u₁} C D : Type u₂ inst✝¹ : Category.{v₂, u₂} D E : Type u₃ inst✝ : Category.{v₃, u₃} E e : C ≌ D F : D ⥤ E X : D ⊢ (e.invFunIdAssoc F).hom.app X = F.map (e.counit.app X)
C : Type u₁ inst✝² : Category.{v₁, u₁} C D : Type u₂ inst✝¹ : Category.{v₂, u₂} D E : Type u₃ inst✝ : Category.{v₃, u₃} E e : C ≌ D F : D ⥤ E X : D ⊢ 𝟙 (F.obj (e.functor.obj (e.inverse.obj X))) ≫ F.map (e.counitIso.hom.app X) ≫ 𝟙 (F.obj X) = F.map (e.counit.app X)
((:c Eq) ((:c Quiver.Hom) (:fv _uniq.43465) ((:c CategoryTheory.CategoryStruct.toQuiver) (:fv _uniq.43465) ((:c CategoryTheory.Category.toCategoryStruct) (:fv _uniq.43465) (:fv _uniq.43468))) ((:c Prefunctor.obj) (:fv _uniq.43460) ((:c CategoryTheory.CategoryStruct.toQuiver) (:fv _uniq.43460) ((:c CategoryTheory.Catego...
[{"name":"C","sexp":"(:sort (+ u₁ 1))"},{"name":"inst✝²","sexp":"((:c CategoryTheory.Category) (:fv _uniq.43455))"},{"name":"D","sexp":"(:sort (+ u₂ 1))"},{"name":"inst✝¹","sexp":"((:c CategoryTheory.Category) (:fv _uniq.43460))"},{"name":"E","sexp":"(:sort (+ u₃ 1))"},{"name":"inst✝","sexp":"((:c CategoryTheory.Catego...
(:app (:c Eq) (:arg :implicit-type 0 (:app (:c Quiver.Hom) (:arg :implicit-type 0 (:fv FV4)) (:arg :instance 1 (:instance-of (:app (:c Quiver) (:arg :explicit 0 (:fv FV4))))) (:arg :explicit 2 (:app (:c Prefunctor.obj) (:arg :implicit-type 0 (:fv FV2)) (:arg :instance 1 (:instance-of (:app (:c Quiver) (:arg :explicit 0...
[{"binder_role":":implicit","context_index":0,"internal_name":"_uniq.43455","is_instance":false,"is_let":false,"name":"C","sexp":"(:sort Type)"},{"binder_role":":instance-implicit","context_index":1,"internal_name":"_uniq.43458","is_instance":true,"is_let":false,"name":"inst✝²","sexp":"(:app (:c CategoryTheory.Category...
{"children":[{"source":"dsimp","sourceEnd":16885,"sourceStart":16880,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[{"source":"[","sourceEnd":16887,"sourceStart":16886,"tag":"...
[]
[{"source":"invFunIdAssoc","source_end":16900,"source_start":16887,"syntax_kind":"ident"}]
[{"binder_role":":implicit","context_index":0,"internal_name":"_uniq.43455","is_instance":false,"is_let":false,"user_name":"C"},{"binder_role":":instance-implicit","context_index":1,"internal_name":"_uniq.43458","is_instance":true,"is_let":false,"user_name":"inst✝²"},{"binder_role":":implicit","context_index":2,"intern...
74
4
exact
true
1
9
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
9a86119d5b3d68553b0b51edbf0b89dea380546714a6ccdbed70228f33e95bd1
dffd9e5f7277e3dd5f5c2b05fd9444fd40fb1096625378a428c0f4d27d25be5c
df424000f0610cd99fec8deefafb9c31a53914a9990d9d19565999e3581fc1de
3f169408f4ae7788f16cd4417946ed197cdbd999c61cd92b3bbc4da17e7cff89
cat-searcher/leandojo-benchmark-4-random
test
1
CategoryTheory.Equivalence.invFunIdAssoc_hom_app
Mathlib/CategoryTheory/Equivalence.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
aesop_cat
C : Type u₁ inst✝² : Category.{v₁, u₁} C D : Type u₂ inst✝¹ : Category.{v₂, u₂} D E : Type u₃ inst✝ : Category.{v₃, u₃} E e : C ≌ D F : D ⥤ E X : D ⊢ 𝟙 (F.obj (e.functor.obj (e.inverse.obj X))) ≫ F.map (e.counitIso.hom.app X) ≫ 𝟙 (F.obj X) = F.map (e.counit.app X)
((:c Eq) ((:c Quiver.Hom) (:fv _uniq.43465) ((:c CategoryTheory.CategoryStruct.toQuiver) (:fv _uniq.43465) ((:c CategoryTheory.Category.toCategoryStruct) (:fv _uniq.43465) (:fv _uniq.43468))) ((:c Prefunctor.obj) (:fv _uniq.43460) ((:c CategoryTheory.CategoryStruct.toQuiver) (:fv _uniq.43460) ((:c CategoryTheory.Catego...
[{"name":"C","sexp":"(:sort (+ u₁ 1))"},{"name":"inst✝²","sexp":"((:c CategoryTheory.Category) (:fv _uniq.43455))"},{"name":"D","sexp":"(:sort (+ u₂ 1))"},{"name":"inst✝¹","sexp":"((:c CategoryTheory.Category) (:fv _uniq.43460))"},{"name":"E","sexp":"(:sort (+ u₃ 1))"},{"name":"inst✝","sexp":"((:c CategoryTheory.Catego...
(:app (:c Eq) (:arg :implicit-type 0 (:app (:c Quiver.Hom) (:arg :implicit-type 0 (:fv FV4)) (:arg :instance 1 (:instance-of (:app (:c Quiver) (:arg :explicit 0 (:fv FV4))))) (:arg :explicit 2 (:app (:c Prefunctor.obj) (:arg :implicit-type 0 (:fv FV2)) (:arg :instance 1 (:instance-of (:app (:c Quiver) (:arg :explicit 0...
[{"binder_role":":implicit","context_index":0,"internal_name":"_uniq.43455","is_instance":false,"is_let":false,"name":"C","sexp":"(:sort Type)"},{"binder_role":":instance-implicit","context_index":1,"internal_name":"_uniq.43458","is_instance":true,"is_let":false,"name":"inst✝²","sexp":"(:app (:c CategoryTheory.Category...
{"children":[{"source":"aesop_cat","sourceEnd":16913,"sourceStart":16904,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"}],"kind":"CategoryTheory.aesop_cat","source":"aesop_cat","sourceEnd":16913,"sourceStart":16904,"tag":"node"}
[]
[]
[{"binder_role":":implicit","context_index":0,"internal_name":"_uniq.43455","is_instance":false,"is_let":false,"user_name":"C"},{"binder_role":":instance-implicit","context_index":1,"internal_name":"_uniq.43458","is_instance":true,"is_let":false,"user_name":"inst✝²"},{"binder_role":":implicit","context_index":2,"intern...
74
5
exact
true
1
9
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
a1464b656f8b6903ba9259174c4aee8821e88dcec6cce325f6e4f1fabe716ea0
3f169408f4ae7788f16cd4417946ed197cdbd999c61cd92b3bbc4da17e7cff89
5121c016cd001463f39ee8c4444b84a277d6f4c7f9897d838d825f1c14f96636
d7064e63adc3d44cf9cf59b8d4bc453382f705da6e9d1ad9cc82503563a0a981
cat-searcher/leandojo-benchmark-4-random
test
2
ENNReal.le_rpow_one_div_iff
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
nth_rw 1 [← <a>ENNReal.rpow_one</a> x]
x y : ℝ≥0∞ z : ℝ hz : 0 < z ⊢ x ≤ y ^ (1 / z) ↔ x ^ z ≤ y
x y : ℝ≥0∞ z : ℝ hz : 0 < z ⊢ x ^ 1 ≤ y ^ (1 / z) ↔ x ^ z ≤ y
((:c Iff) ((:c LE.le) (:c ENNReal) ((:c Preorder.toLE) (:c ENNReal) ((:c PartialOrder.toPreorder) (:c ENNReal) ((:c OmegaCompletePartialOrder.toPartialOrder) (:c ENNReal) ((:c CompleteLattice.instOmegaCompletePartialOrder) (:c ENNReal) ((:c CompletelyDistribLattice.toCompleteLattice) (:c ENNReal) ((:c CompleteLinearOrd...
[{"name":"x","sexp":"(:c ENNReal)"},{"name":"y","sexp":"(:c ENNReal)"},{"name":"z","sexp":"(:c Real)"},{"name":"hz","sexp":"((:c LT.lt) (:c Real) (:c Real.instLT) ((:c OfNat.ofNat) (:c Real) (:lit 0) ((:c Zero.toOfNat0) (:c Real) (:c Real.instZero))) (:fv _uniq.147588))"}]
(:app (:c Iff) (:arg :explicit 0 (:app (:c LE.le) (:arg :implicit-type 0 (:c ENNReal)) (:arg :instance 1 (:instance-of (:app (:c LE) (:arg :explicit 0 (:c ENNReal))))) (:arg :explicit 2 (:fv FV1)) (:arg :explicit 3 (:app (:c HPow.hPow) (:arg :implicit-type 0 (:c ENNReal)) (:arg :implicit-type 1 (:c Real)) (:arg :implic...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.147586","is_instance":false,"is_let":false,"name":"x","sexp":"(:c ENNReal)"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.147587","is_instance":false,"is_let":false,"name":"y","sexp":"(:c ENNReal)"},{"binder_role":":implicit","c...
{"children":[{"source":"nth_rw","sourceEnd":31945,"sourceStart":31939,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[],"kind":"group","source":"","tag":"node"},{"children":[{"source":"1","sourceEnd":31947,"sourceStart":31946,"tag":"atom"}],"kind":"num","source":"1","sourceEnd":31947,"...
[]
[{"source":"rpow_one x","source_end":31963,"source_start":31953,"syntax_kind":"Lean.Parser.Term.app"}]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.147586","is_instance":false,"is_let":false,"user_name":"x"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.147587","is_instance":false,"is_let":false,"user_name":"y"},{"binder_role":":implicit","context_index":3,"internal_name":"_...
234
4
exact
true
1
4
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
ef6fd48c85e99347641466cb8d615d9c7eaea980031e82a548a282d921a31f34
7259f8b186f55c724a2937abefb3b54b5c4888a7d9da11b2e88fa932b843a186
5e83fe96ed12ab903e4d32d0a33ea3dbc91fa9778c53c010dadc8e299424f126
5cf6b4b917cf658d7dbea03acbaf5bcb5e0e83d72e4e8e72ddc096da2a93f886
cat-searcher/leandojo-benchmark-4-random
test
3
ENNReal.le_rpow_one_div_iff
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
nth_rw 1 [← @<a>mul_inv_cancel</a> _ _ z hz.ne']
x y : ℝ≥0∞ z : ℝ hz : 0 < z ⊢ x ^ 1 ≤ y ^ (1 / z) ↔ x ^ z ≤ y
x y : ℝ≥0∞ z : ℝ hz : 0 < z ⊢ x ^ (z * z⁻¹) ≤ y ^ (1 / z) ↔ x ^ z ≤ y
((:c Iff) ((:c LE.le) (:c ENNReal) ((:c Preorder.toLE) (:c ENNReal) ((:c PartialOrder.toPreorder) (:c ENNReal) ((:c OmegaCompletePartialOrder.toPartialOrder) (:c ENNReal) ((:c CompleteLattice.instOmegaCompletePartialOrder) (:c ENNReal) ((:c CompletelyDistribLattice.toCompleteLattice) (:c ENNReal) ((:c CompleteLinearOrd...
[{"name":"x","sexp":"(:c ENNReal)"},{"name":"y","sexp":"(:c ENNReal)"},{"name":"z","sexp":"(:c Real)"},{"name":"hz","sexp":"((:c LT.lt) (:c Real) (:c Real.instLT) ((:c OfNat.ofNat) (:c Real) (:lit 0) ((:c Zero.toOfNat0) (:c Real) (:c Real.instZero))) (:fv _uniq.147588))"}]
(:app (:c Iff) (:arg :explicit 0 (:app (:c LE.le) (:arg :implicit-type 0 (:c ENNReal)) (:arg :instance 1 (:instance-of (:app (:c LE) (:arg :explicit 0 (:c ENNReal))))) (:arg :explicit 2 (:app (:c HPow.hPow) (:arg :implicit-type 0 (:c ENNReal)) (:arg :implicit-type 1 (:c Real)) (:arg :implicit-type 2 (:c ENNReal)) (:arg...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.147586","is_instance":false,"is_let":false,"name":"x","sexp":"(:c ENNReal)"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.147587","is_instance":false,"is_let":false,"name":"y","sexp":"(:c ENNReal)"},{"binder_role":":implicit","c...
{"children":[{"source":"nth_rw","sourceEnd":31973,"sourceStart":31967,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[],"kind":"group","source":"","tag":"node"},{"children":[{"source":"1","sourceEnd":31975,"sourceStart":31974,"tag":"atom"}],"kind":"num","source":"1","sourceEnd":31975,"...
[]
[{"source":"@_root_.mul_inv_cancel _ _ z hz.ne'","source_end":32016,"source_start":31981,"syntax_kind":"Lean.Parser.Term.app"}]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.147586","is_instance":false,"is_let":false,"user_name":"x"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.147587","is_instance":false,"is_let":false,"user_name":"y"},{"binder_role":":implicit","context_index":3,"internal_name":"_...
234
7
exact
true
1
4
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
f2aa74f55aab5ca970713f36e9b4b6354b93941a6362dfb796e4b9c2e9edfa9e
5cf6b4b917cf658d7dbea03acbaf5bcb5e0e83d72e4e8e72ddc096da2a93f886
f47e3dd1adf0c55ad4278f7450f5053d6467e3e4a88362b2206ae19e23a8b880
a67623c6140f80c71152dd2161fb11d53293002679fbcafdeb4ec052353cc0b5
cat-searcher/leandojo-benchmark-4-random
test
4
ENNReal.le_rpow_one_div_iff
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
rw [<a>ENNReal.rpow_mul</a>, ← <a>one_div</a>, @<a>ENNReal.rpow_le_rpow_iff</a> _ _ (1 / z) (by simp [hz])]
x y : ℝ≥0∞ z : ℝ hz : 0 < z ⊢ x ^ (z * z⁻¹) ≤ y ^ (1 / z) ↔ x ^ z ≤ y
((:c Iff) ((:c LE.le) (:c ENNReal) ((:c Preorder.toLE) (:c ENNReal) ((:c PartialOrder.toPreorder) (:c ENNReal) ((:c OmegaCompletePartialOrder.toPartialOrder) (:c ENNReal) ((:c CompleteLattice.instOmegaCompletePartialOrder) (:c ENNReal) ((:c CompletelyDistribLattice.toCompleteLattice) (:c ENNReal) ((:c CompleteLinearOrd...
[{"name":"x","sexp":"(:c ENNReal)"},{"name":"y","sexp":"(:c ENNReal)"},{"name":"z","sexp":"(:c Real)"},{"name":"hz","sexp":"((:c LT.lt) (:c Real) (:c Real.instLT) ((:c OfNat.ofNat) (:c Real) (:lit 0) ((:c Zero.toOfNat0) (:c Real) (:c Real.instZero))) (:fv _uniq.147588))"}]
(:app (:c Iff) (:arg :explicit 0 (:app (:c LE.le) (:arg :implicit-type 0 (:c ENNReal)) (:arg :instance 1 (:instance-of (:app (:c LE) (:arg :explicit 0 (:c ENNReal))))) (:arg :explicit 2 (:app (:c HPow.hPow) (:arg :implicit-type 0 (:c ENNReal)) (:arg :implicit-type 1 (:c Real)) (:arg :implicit-type 2 (:c ENNReal)) (:arg...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.147586","is_instance":false,"is_let":false,"name":"x","sexp":"(:c ENNReal)"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.147587","is_instance":false,"is_let":false,"name":"y","sexp":"(:c ENNReal)"},{"binder_role":":implicit","c...
{"children":[{"source":"rw","sourceEnd":32022,"sourceStart":32020,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[{"source":"[","sourceEnd":32024,"sourceStart":32023,"tag":"atom"},{"children":[{"children":[{"children":[],"kind":"null","source":"","tag":"node"},{"name":"ENNReal.rpow_mul...
[]
[{"source":"rpow_mul","source_end":32032,"source_start":32024,"syntax_kind":"ident"},{"source":"one_div","source_end":32045,"source_start":32038,"syntax_kind":"ident"},{"source":"@rpow_le_rpow_iff _ _ (1 / z) (by simp [hz])","source_end":32091,"source_start":32047,"syntax_kind":"Lean.Parser.Term.app"}]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.147586","is_instance":false,"is_let":false,"user_name":"x"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.147587","is_instance":false,"is_let":false,"user_name":"y"},{"binder_role":":implicit","context_index":3,"internal_name":"_...
234
10
exact
true
1
4
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
b1ab5c90aa6a82f9602da8a8e3060fe97320376a4fd06dd8729a3e4db30958da
a67623c6140f80c71152dd2161fb11d53293002679fbcafdeb4ec052353cc0b5
7785f40295153fbee4fc131e674c273c0b8f183026ec0918f28e26d90df9ba9a
d7064e63adc3d44cf9cf59b8d4bc453382f705da6e9d1ad9cc82503563a0a981
cat-searcher/leandojo-benchmark-4-random
test
5
ENNReal.le_rpow_one_div_iff
Mathlib/Analysis/SpecialFunctions/Pow/NNReal.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
simp [hz]
x y : ℝ≥0∞ z : ℝ hz : 0 < z ⊢ 0 < 1 / z
((:c LT.lt) (:c Real) (:c Real.instLT) ((:c OfNat.ofNat) (:c Real) (:lit 0) ((:c Zero.toOfNat0) (:c Real) (:c Real.instZero))) ((:c HDiv.hDiv) (:c Real) (:c Real) (:c Real) ((:c instHDiv) (:c Real) ((:c LinearOrderedField.toDiv) (:c Real) (:c Real.instLinearOrderedField))) ((:c OfNat.ofNat) (:c Real) (:lit 1) ((:c One....
[{"name":"x","sexp":"(:c ENNReal)"},{"name":"y","sexp":"(:c ENNReal)"},{"name":"z","sexp":"(:c Real)"},{"name":"hz","sexp":"((:c LT.lt) (:c Real) (:c Real.instLT) ((:c OfNat.ofNat) (:c Real) (:lit 0) ((:c Zero.toOfNat0) (:c Real) (:c Real.instZero))) (:fv _uniq.147588))"}]
(:app (:c LT.lt) (:arg :implicit-type 0 (:c Real)) (:arg :instance 1 (:instance-of (:app (:c LT) (:arg :explicit 0 (:c Real))))) (:arg :explicit 2 (:app (:c OfNat.ofNat) (:arg :implicit-type 0 (:c Real)) (:arg :explicit 1 (:lit 0)) (:arg :instance 2 (:instance-of (:app (:c OfNat) (:arg :explicit 0 (:c Real)) (:arg :exp...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.147586","is_instance":false,"is_let":false,"name":"x","sexp":"(:c ENNReal)"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.147587","is_instance":false,"is_let":false,"name":"y","sexp":"(:c ENNReal)"},{"binder_role":":implicit","c...
{"children":[{"children":[{"children":[{"children":[{"source":"simp","sourceEnd":32085,"sourceStart":32081,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[{"source":"[","source...
[]
[{"source":"hz","source_end":32089,"source_start":32087,"syntax_kind":"ident"}]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.147586","is_instance":false,"is_let":false,"user_name":"x"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.147587","is_instance":false,"is_let":false,"user_name":"y"},{"binder_role":":implicit","context_index":3,"internal_name":"_...
234
16
exact
true
1
4
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
318332db8cc40212d3ff81569b471d07207b454ca7a47c91196cfd3a9384f2d5
40d7cdce76d6793c6f30c77d254346ba894274e7a82b56d575dc473ecadb7de5
199d5d52adca245380d9314e9608af40c4fb728e85bf299c4c3d783f9a3759fc
d7064e63adc3d44cf9cf59b8d4bc453382f705da6e9d1ad9cc82503563a0a981
cat-searcher/leandojo-benchmark-4-random
test
6
Combinatorics.Line.apply_of_ne_none
Mathlib/Combinatorics/HalesJewett.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
rw [l.apply, <a>Option.getD_of_ne_none</a> h]
α : Type u_1 ι : Type u_2 l : Line α ι x : α i : ι h : l.idxFun i ≠ none ⊢ some ((fun x i => (l.idxFun i).getD x) x i) = l.idxFun i
((:c Eq) ((:c Option) (:fv _uniq.4270)) ((:c Option.some) (:fv _uniq.4270) ((:lambda x (:fv _uniq.4270) (:lambda i (:fv _uniq.4271) ((:c Option.getD) (:fv _uniq.4270) ((:c Combinatorics.Line.idxFun) (:fv _uniq.4270) (:fv _uniq.4271) (:fv _uniq.4272) 0) 1))) (:fv _uniq.4273) (:fv _uniq.4274))) ((:c Combinatorics.Line.id...
[{"name":"α","sexp":"(:sort (+ u_1 1))"},{"name":"ι","sexp":"(:sort (+ u_2 1))"},{"name":"l","sexp":"((:c Combinatorics.Line) (:fv _uniq.4270) (:fv _uniq.4271))"},{"name":"x","sexp":"(:fv _uniq.4270)"},{"name":"i","sexp":"(:fv _uniq.4271)"},{"name":"h","sexp":"((:c Ne) ((:c Option) (:fv _uniq.4270)) ((:c Combinatorics....
(:app (:c Eq) (:arg :implicit-type 0 (:app (:c Option) (:arg :explicit 0 (:fv FV1)))) (:arg :explicit 1 (:app (:c Option.some) (:arg :implicit-type 0 (:fv FV1)) (:arg :explicit 1 (:app (:lambda x :explicit (:fv FV1) (:lambda i :explicit (:fv FV2) (:app (:c Option.getD) (:arg :implicit-type 0 (:fv FV1)) (:arg :explicit ...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.4270","is_instance":false,"is_let":false,"name":"α","sexp":"(:sort Type)"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.4271","is_instance":false,"is_let":false,"name":"ι","sexp":"(:sort Type)"},{"binder_role":":explicit","conte...
{"children":[{"children":[{"children":[{"children":[{"source":"rw","sourceEnd":8656,"sourceStart":8654,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[{"source":"[","sourceEnd":8658,"sourceStart":8657,"tag":"atom"},{"children":[{"children":[{"children":[],"kind":"null","source":"","tag...
[]
[{"source":"l.apply","source_end":8665,"source_start":8658,"syntax_kind":"ident"},{"source":"Option.getD_of_ne_none h","source_end":8691,"source_start":8667,"syntax_kind":"Lean.Parser.Term.app"}]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.4270","is_instance":false,"is_let":false,"user_name":"α"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.4271","is_instance":false,"is_let":false,"user_name":"ι"},{"binder_role":":explicit","context_index":3,"internal_name":"_uniq...
32
2
exact
true
1
6
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
a002f917036656451958d52b461b3dfe1ceb53ac2a18288733b7e0c4d655400b
12a9c80c6151abb9c89290622abad9c872d32cd53d1fab96abf5d208c6d3eea6
2490bddaa1a84e666fe917714eb5504d2ac934777568fd84bec76a1313c1d864
d7064e63adc3d44cf9cf59b8d4bc453382f705da6e9d1ad9cc82503563a0a981
cat-searcher/leandojo-benchmark-4-random
test
7
CancelDenoms.cancel_factors_lt
Mathlib/Tactic/CancelDenoms/Core.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
rw [<a>mul_lt_mul_left</a>, ← ha, ← hb, ← <a>mul_assoc</a>, ← <a>mul_assoc</a>, <a>mul_comm</a> bd, <a>mul_lt_mul_left</a>]
α : Type u_1 inst✝ : LinearOrderedField α a b ad bd a' b' gcd : α ha : ad * a = a' hb : bd * b = b' had : 0 < ad hbd : 0 < bd hgcd : 0 < gcd ⊢ (a < b) = (1 / gcd * (bd * a') < 1 / gcd * (ad * b'))
α : Type u_1 inst✝ : LinearOrderedField α a b ad bd a' b' gcd : α ha : ad * a = a' hb : bd * b = b' had : 0 < ad hbd : 0 < bd hgcd : 0 < gcd ⊢ 0 < ad * bd α : Type u_1 inst✝ : LinearOrderedField α a b ad bd a' b' gcd : α ha : ad * a = a' hb : bd * b = b' had : 0 < ad hbd : 0 < bd hgcd : 0 < gcd ⊢ 0 < 1 / gcd
((:c Eq) (:sort 0) ((:c LT.lt) (:fv _uniq.7565) ((:c Preorder.toLT) (:fv _uniq.7565) ((:c PartialOrder.toPreorder) (:fv _uniq.7565) ((:c StrictOrderedRing.toPartialOrder) (:fv _uniq.7565) ((:c LinearOrderedRing.toStrictOrderedRing) (:fv _uniq.7565) ((:c LinearOrderedCommRing.toLinearOrderedRing) (:fv _uniq.7565) ((:c L...
[{"name":"α","sexp":"(:sort (+ u_1 1))"},{"name":"inst✝","sexp":"((:c LinearOrderedField) (:fv _uniq.7565))"},{"name":"a","sexp":"(:fv _uniq.7565)"},{"name":"b","sexp":"(:fv _uniq.7565)"},{"name":"ad","sexp":"(:fv _uniq.7565)"},{"name":"bd","sexp":"(:fv _uniq.7565)"},{"name":"a'","sexp":"(:fv _uniq.7565)"},{"name":"b'"...
(:app (:c Eq) (:arg :implicit-type 0 (:sort Prop)) (:arg :explicit 1 (:app (:c LT.lt) (:arg :implicit-type 0 (:fv FV1)) (:arg :instance 1 (:instance-of (:app (:c LT) (:arg :explicit 0 (:fv FV1))))) (:arg :explicit 2 (:fv FV3)) (:arg :explicit 3 (:fv FV4)))) (:arg :explicit 2 (:app (:c LT.lt) (:arg :implicit-type 0 (:fv...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.7565","is_instance":false,"is_let":false,"name":"α","sexp":"(:sort Type)"},{"binder_role":":instance-implicit","context_index":2,"internal_name":"_uniq.7566","is_instance":true,"is_let":false,"name":"inst✝","sexp":"(:app (:c LinearOrderedField) (:arg ...
{"children":[{"source":"rw","sourceEnd":3198,"sourceStart":3196,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[{"source":"[","sourceEnd":3200,"sourceStart":3199,"tag":"atom"},{"children":[{"children":[{"children":[],"kind":"null","source":"","tag":"node"},{"name":"mul_lt_mul_left","se...
[]
[{"source":"mul_lt_mul_left","source_end":3215,"source_start":3200,"syntax_kind":"ident"},{"source":"ha","source_end":3223,"source_start":3221,"syntax_kind":"ident"},{"source":"hb","source_end":3231,"source_start":3229,"syntax_kind":"ident"},{"source":"mul_assoc","source_end":3246,"source_start":3237,"syntax_kind":"ide...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.7565","is_instance":false,"is_let":false,"user_name":"α"},{"binder_role":":instance-implicit","context_index":2,"internal_name":"_uniq.7566","is_instance":true,"is_let":false,"user_name":"inst✝"},{"binder_role":":implicit","context_index":3,"internal_...
19
4
exact
true
1
14
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
5dae85750679fad4d5b7fcbf7363aec54616c83482a6f7e4ed174f5b33aebb30
dd901e805a6af48b79ef1187f060cb8d0e3622d4407db53f4aa953cd74cb3315
885ae8a5abeb74c2a76430a80a9c6564bcbcf926d9eafbb3e3d406a7472d3ff8
06e24609dca3c6571a94ce73574648a010e34f4ddc62c9506cd10e38b7f65b2f
cat-searcher/leandojo-benchmark-4-random
test
8
CancelDenoms.cancel_factors_lt
Mathlib/Tactic/CancelDenoms/Core.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
exact <a>mul_pos</a> had hbd
α : Type u_1 inst✝ : LinearOrderedField α a b ad bd a' b' gcd : α ha : ad * a = a' hb : bd * b = b' had : 0 < ad hbd : 0 < bd hgcd : 0 < gcd ⊢ 0 < ad * bd
((:c LT.lt) (:fv _uniq.7565) ((:c Preorder.toLT) (:fv _uniq.7565) ((:c PartialOrder.toPreorder) (:fv _uniq.7565) ((:c StrictOrderedRing.toPartialOrder) (:fv _uniq.7565) ((:c LinearOrderedRing.toStrictOrderedRing) (:fv _uniq.7565) ((:c LinearOrderedCommRing.toLinearOrderedRing) (:fv _uniq.7565) ((:c LinearOrderedField.t...
[{"name":"α","sexp":"(:sort (+ u_1 1))"},{"name":"inst✝","sexp":"((:c LinearOrderedField) (:fv _uniq.7565))"},{"name":"a","sexp":"(:fv _uniq.7565)"},{"name":"b","sexp":"(:fv _uniq.7565)"},{"name":"ad","sexp":"(:fv _uniq.7565)"},{"name":"bd","sexp":"(:fv _uniq.7565)"},{"name":"a'","sexp":"(:fv _uniq.7565)"},{"name":"b'"...
(:app (:c LT.lt) (:arg :implicit-type 0 (:fv FV1)) (:arg :instance 1 (:instance-of (:app (:c LT) (:arg :explicit 0 (:fv FV1))))) (:arg :explicit 2 (:app (:c OfNat.ofNat) (:arg :implicit-type 0 (:fv FV1)) (:arg :explicit 1 (:lit 0)) (:arg :instance 2 (:instance-of (:app (:c OfNat) (:arg :explicit 0 (:fv FV1)) (:arg :exp...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.7565","is_instance":false,"is_let":false,"name":"α","sexp":"(:sort Type)"},{"binder_role":":instance-implicit","context_index":2,"internal_name":"_uniq.7566","is_instance":true,"is_let":false,"name":"inst✝","sexp":"(:app (:c LinearOrderedField) (:arg ...
{"children":[{"children":[{"children":[{"children":[{"source":"exact","sourceEnd":3303,"sourceStart":3298,"tag":"atom"},{"children":[{"name":"mul_pos","semanticRole":"global","source":"mul_pos","sourceEnd":3311,"sourceStart":3304,"tag":"identifier"},{"children":[{"contextIndex":12,"semanticRole":"local","source":"had",...
[]
[{"source":"mul_pos had hbd","source_end":3319,"source_start":3304,"syntax_kind":"Lean.Parser.Term.app"}]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.7565","is_instance":false,"is_let":false,"user_name":"α"},{"binder_role":":instance-implicit","context_index":2,"internal_name":"_uniq.7566","is_instance":true,"is_let":false,"user_name":"inst✝"},{"binder_role":":implicit","context_index":3,"internal_...
19
15
exact
true
1
14
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
7e3d99f2f2c3d19573cf8ca867e3fcf6aafe7627b8b1d2dbed31b766aa19ea7d
3380636c3e642d0fe5bebfa1baae256c9cc972d10db439561eb9c84b3765fbe9
3aa627d27ef3b53e0c1b1a402cd3d9bc7f803bb554a29ac098eb43b8d5fc1698
d7064e63adc3d44cf9cf59b8d4bc453382f705da6e9d1ad9cc82503563a0a981
cat-searcher/leandojo-benchmark-4-random
test
9
CancelDenoms.cancel_factors_lt
Mathlib/Tactic/CancelDenoms/Core.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
exact <a>one_div_pos</a>.2 hgcd
α : Type u_1 inst✝ : LinearOrderedField α a b ad bd a' b' gcd : α ha : ad * a = a' hb : bd * b = b' had : 0 < ad hbd : 0 < bd hgcd : 0 < gcd ⊢ 0 < 1 / gcd
((:c LT.lt) (:fv _uniq.7565) ((:c Preorder.toLT) (:fv _uniq.7565) ((:c PartialOrder.toPreorder) (:fv _uniq.7565) ((:c StrictOrderedRing.toPartialOrder) (:fv _uniq.7565) ((:c LinearOrderedRing.toStrictOrderedRing) (:fv _uniq.7565) ((:c LinearOrderedCommRing.toLinearOrderedRing) (:fv _uniq.7565) ((:c LinearOrderedField.t...
[{"name":"α","sexp":"(:sort (+ u_1 1))"},{"name":"inst✝","sexp":"((:c LinearOrderedField) (:fv _uniq.7565))"},{"name":"a","sexp":"(:fv _uniq.7565)"},{"name":"b","sexp":"(:fv _uniq.7565)"},{"name":"ad","sexp":"(:fv _uniq.7565)"},{"name":"bd","sexp":"(:fv _uniq.7565)"},{"name":"a'","sexp":"(:fv _uniq.7565)"},{"name":"b'"...
(:app (:c LT.lt) (:arg :implicit-type 0 (:fv FV1)) (:arg :instance 1 (:instance-of (:app (:c LT) (:arg :explicit 0 (:fv FV1))))) (:arg :explicit 2 (:app (:c OfNat.ofNat) (:arg :implicit-type 0 (:fv FV1)) (:arg :explicit 1 (:lit 0)) (:arg :instance 2 (:instance-of (:app (:c OfNat) (:arg :explicit 0 (:fv FV1)) (:arg :exp...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.7565","is_instance":false,"is_let":false,"name":"α","sexp":"(:sort Type)"},{"binder_role":":instance-implicit","context_index":2,"internal_name":"_uniq.7566","is_instance":true,"is_let":false,"name":"inst✝","sexp":"(:app (:c LinearOrderedField) (:arg ...
{"children":[{"children":[{"children":[{"children":[{"source":"exact","sourceEnd":3330,"sourceStart":3325,"tag":"atom"},{"children":[{"children":[{"name":"one_div_pos","semanticRole":"global","source":"one_div_pos","sourceEnd":3342,"sourceStart":3331,"tag":"identifier"},{"source":".","sourceEnd":3343,"sourceStart":3342...
[]
[{"source":"one_div_pos.2 hgcd","source_end":3349,"source_start":3331,"syntax_kind":"Lean.Parser.Term.app"}]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.7565","is_instance":false,"is_let":false,"user_name":"α"},{"binder_role":":instance-implicit","context_index":2,"internal_name":"_uniq.7566","is_instance":true,"is_let":false,"user_name":"inst✝"},{"binder_role":":implicit","context_index":3,"internal_...
19
20
exact
true
1
14
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
362a4d791f57bd638fd99572d205002beebd549ac145bef666dadca4936ce51c
09963411d67a0f53f3027fb8bfb00f37fbf612c46d17423d4f1bfab7e12e369d
a7eec638dae8a1d3577cd0a4b5fdf4013f4573fa66da97598568edaf164d5703
d7064e63adc3d44cf9cf59b8d4bc453382f705da6e9d1ad9cc82503563a0a981
cat-searcher/leandojo-benchmark-4-random
test
10
Batteries.BinomialHeap.Imp.Heap.WF.tail?
.lake/packages/batteries/Batteries/Data/BinomialHeap/Basic.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
simp only [<a>Batteries.BinomialHeap.Imp.Heap.tail?</a>]
α : Type u_1 s : Heap α le : α → α → Bool n : Nat tl : Heap α hwf : WF le n s ⊢ Heap.tail? le s = some tl → WF le 0 tl
α : Type u_1 s : Heap α le : α → α → Bool n : Nat tl : Heap α hwf : WF le n s ⊢ Option.map (fun x => x.snd) (Heap.deleteMin le s) = some tl → WF le 0 tl
(:forall _ ((:c Eq) ((:c Option) ((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163398))) ((:c Batteries.BinomialHeap.Imp.Heap.tail?) (:fv _uniq.163398) (:fv _uniq.163400) (:fv _uniq.163399)) ((:c Option.some) ((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163398)) (:fv _uniq.163402))) ((:c Batteries.BinomialHeap.I...
[{"name":"α","sexp":"(:sort (+ u_1 1))"},{"name":"s","sexp":"((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163398))"},{"name":"le","sexp":"(:forall _ (:fv _uniq.163398) (:forall _ (:fv _uniq.163398) (:c Bool)))"},{"name":"n","sexp":"(:c Nat)"},{"name":"tl","sexp":"((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163...
(:forall _ :explicit (:app (:c Eq) (:arg :implicit-type 0 (:app (:c Option) (:arg :explicit 0 (:app (:c Batteries.BinomialHeap.Imp.Heap) (:arg :explicit 0 (:fv FV1)))))) (:arg :explicit 1 (:app (:c Batteries.BinomialHeap.Imp.Heap.tail?) (:arg :implicit-type 0 (:fv FV1)) (:arg :explicit 1 (:fv FV3)) (:arg :explicit 2 (:...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.163398","is_instance":false,"is_let":false,"name":"α","sexp":"(:sort Type)"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.163399","is_instance":false,"is_let":false,"name":"s","sexp":"(:app (:c Batteries.BinomialHeap.Imp.Heap) (...
{"children":[{"source":"simp","sourceEnd":19669,"sourceStart":19665,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[{"source":"only","sourceEnd":19674,"sourceStart":19670,"tag":"atom"}],"kind":"null","source":"only","sourceEnd":196...
[]
[{"source":"Heap.tail?","source_end":19686,"source_start":19676,"syntax_kind":"ident"}]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.163398","is_instance":false,"is_let":false,"user_name":"α"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.163399","is_instance":false,"is_let":false,"user_name":"s"},{"binder_role":":implicit","context_index":3,"internal_name":"_...
61
4
exact
true
1
6
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
4f6ac670b68eecd8f3323ed78501f2c2f041bdea67448a3a0006aa197aa43d07
80a1848c1697a9998cef39dc0e85fabb01a2c48f5fd17d27e383e733b05bb526
995935239fec8ef60364f459de87d711c0ca2ab781571616fe99b415998a2017
8e365bf5d2527779ca0da8583cc83bd07cb6b8a55e1b2d8153177a80288dd8e0
cat-searcher/leandojo-benchmark-4-random
test
11
Batteries.BinomialHeap.Imp.Heap.WF.tail?
.lake/packages/batteries/Batteries/Data/BinomialHeap/Basic.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
intro eq
α : Type u_1 s : Heap α le : α → α → Bool n : Nat tl : Heap α hwf : WF le n s ⊢ Option.map (fun x => x.snd) (Heap.deleteMin le s) = some tl → WF le 0 tl
α : Type u_1 s : Heap α le : α → α → Bool n : Nat tl : Heap α hwf : WF le n s eq : Option.map (fun x => x.snd) (Heap.deleteMin le s) = some tl ⊢ WF le 0 tl
(:forall _ ((:c Eq) ((:c Option) ((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163398))) ((:c Option.map) ((:c Prod) (:fv _uniq.163398) ((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163398))) ((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163398)) (:lambda _ ((:c Prod) (:fv _uniq.163398) ((:c Batteries.Binomial...
[{"name":"α","sexp":"(:sort (+ u_1 1))"},{"name":"s","sexp":"((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163398))"},{"name":"le","sexp":"(:forall _ (:fv _uniq.163398) (:forall _ (:fv _uniq.163398) (:c Bool)))"},{"name":"n","sexp":"(:c Nat)"},{"name":"tl","sexp":"((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163...
(:forall _ :explicit (:app (:c Eq) (:arg :implicit-type 0 (:app (:c Option) (:arg :explicit 0 (:app (:c Batteries.BinomialHeap.Imp.Heap) (:arg :explicit 0 (:fv FV1)))))) (:arg :explicit 1 (:app (:c Option.map) (:arg :implicit-type 0 (:app (:c Prod) (:arg :explicit 0 (:fv FV1)) (:arg :explicit 1 (:app (:c Batteries.Bino...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.163398","is_instance":false,"is_let":false,"name":"α","sexp":"(:sort Type)"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.163399","is_instance":false,"is_let":false,"name":"s","sexp":"(:app (:c Batteries.BinomialHeap.Imp.Heap) (...
{"children":[{"source":"intro","sourceEnd":19694,"sourceStart":19689,"tag":"atom"},{"children":[{"semanticRole":"scoped_local","source":"eq","sourceEnd":19697,"sourceStart":19695,"tag":"identifier"}],"kind":"null","source":"eq","sourceEnd":19697,"sourceStart":19695,"tag":"node"}],"kind":"Lean.Parser.Tactic.intro","sour...
[{"role":"fresh_name","source":"eq","source_end":19697,"source_start":19695,"syntax_kind":"ident"}]
[]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.163398","is_instance":false,"is_let":false,"user_name":"α"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.163399","is_instance":false,"is_let":false,"user_name":"s"},{"binder_role":":implicit","context_index":3,"internal_name":"_...
61
6
exact
true
1
6
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
1ebfdc2c2cfbd48fabccb6e653106e278d000966bf64c5a261f79fe7470fd61b
8e365bf5d2527779ca0da8583cc83bd07cb6b8a55e1b2d8153177a80288dd8e0
da30e2c904567f38c67db957e122f05e7f1935f4a389b4c677b35caa879cab97
c8fae2d7ba2e32d150eb1c39e207ff5484f79971204489523f9aa71f215e6840
cat-searcher/leandojo-benchmark-4-random
test
12
Batteries.BinomialHeap.Imp.Heap.WF.tail?
.lake/packages/batteries/Batteries/Data/BinomialHeap/Basic.lean
https://github.com/leanprover-community/mathlib4
29dcec074de168ac2bf835a77ef68bbe069194c5
match eq₂ : s.deleteMin le, eq with | <a>Option.some</a> (a, tl), <a>rfl</a> => exact hwf.deleteMin eq₂
α : Type u_1 s : Heap α le : α → α → Bool n : Nat tl : Heap α hwf : WF le n s eq : Option.map (fun x => x.snd) (Heap.deleteMin le s) = some tl ⊢ WF le 0 tl
((:c Batteries.BinomialHeap.Imp.Heap.WF) (:fv _uniq.163398) (:fv _uniq.163400) ((:c OfNat.ofNat) (:c Nat) (:lit 0) ((:c instOfNatNat) (:lit 0))) (:fv _uniq.163402))
[{"name":"α","sexp":"(:sort (+ u_1 1))"},{"name":"s","sexp":"((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163398))"},{"name":"le","sexp":"(:forall _ (:fv _uniq.163398) (:forall _ (:fv _uniq.163398) (:c Bool)))"},{"name":"n","sexp":"(:c Nat)"},{"name":"tl","sexp":"((:c Batteries.BinomialHeap.Imp.Heap) (:fv _uniq.163...
(:app (:c Batteries.BinomialHeap.Imp.Heap.WF) (:arg :implicit-type 0 (:fv FV1)) (:arg :explicit 1 (:fv FV3)) (:arg :explicit 2 (:app (:c OfNat.ofNat) (:arg :implicit-type 0 (:c Nat)) (:arg :explicit 1 (:lit 0)) (:arg :instance 2 (:instance-of (:app (:c OfNat) (:arg :explicit 0 (:c Nat)) (:arg :explicit 1 (:lit 0)))))))...
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.163398","is_instance":false,"is_let":false,"name":"α","sexp":"(:sort Type)"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.163399","is_instance":false,"is_let":false,"name":"s","sexp":"(:app (:c Batteries.BinomialHeap.Imp.Heap) (...
{"children":[{"source":"match","sourceEnd":19705,"sourceStart":19700,"tag":"atom"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[],"kind":"null","source":"","tag":"node"},{"children":[{"children":[{"children":[{"semanticRole":"scoped_local","source":"eq₂","sourceEnd":19711,"sourceStart":19706,"tag...
[]
[{"source":"match eq₂ : s.deleteMin le, eq with\n | some (a, tl), rfl => ? rhs","source_end":19788,"source_start":19700,"syntax_kind":"Lean.Parser.Term.match"}]
[{"binder_role":":implicit","context_index":1,"internal_name":"_uniq.163398","is_instance":false,"is_let":false,"user_name":"α"},{"binder_role":":implicit","context_index":2,"internal_name":"_uniq.163399","is_instance":false,"is_let":false,"user_name":"s"},{"binder_role":":implicit","context_index":3,"internal_name":"_...
61
7
exact
true
1
7
true
4
source-invocation-v4
2
lean-model-sexp-v2
3
lean-action-trace-v3
73781c2d58456e4bf369dadd4a501e1b78a0b177
73781c2d58456e4bf369dadd4a501e1b78a0b177
9b8e1490a97cd2ccb2387740512f5d62d7b2e3abeb4fda4d3b58a8410b4e0a43
c8fae2d7ba2e32d150eb1c39e207ff5484f79971204489523f9aa71f215e6840
b35f73d05bbecd327ec25f679aab5d80e3201f5eeaae3810d5794d81d9d59497
d7064e63adc3d44cf9cf59b8d4bc453382f705da6e9d1ad9cc82503563a0a981
End of preview. Expand in Data Studio

Mathlib Normalized S-Expressions

Lean 4 proof states from Mathlib, paired with the tactic applied at each step, in three representations extracted directly from the Lean kernel:

  1. Source-faithful S-expressions of the goal and every hypothesis, as Lean elaborated them.
  2. Normalized S-expressions of the same state, with stable local-context indices suitable for model input.
  3. Annotated tactic syntax -- the original tactic's syntax tree with identifier leaves resolved to the constants and hypotheses they refer to.

Row identity follows cat-searcher/leandojo-benchmark-4-random, so split and row_index join directly against it and the val/test splits remain comparable to published results on that benchmark.

Unlike pretty-printed proof states, S-expressions carry the elaborated term structure: implicit arguments, instance resolution, and binder structure are all explicit, which is what makes graph- and pointer-based models possible.

Loading

from datasets import load_dataset
import json

ds = load_dataset("jajostrains/Mathlib-Normalized-Sexpr", split="train")
row = ds[0]
print(row["model_goal_sexp"])

# Nested payloads are JSON strings; see the schema note below.
syntax_tree = json.loads(row["source_syntax"])
context = json.loads(row["local_context"])

Coverage

Read this before training on the train split.

split rows published upstream rows coverage
test 4,392 4,506 97.47%
train 218,727 250,814 87.21%
val 4,157 4,260 97.58%
total 227,276 259,580 87.56%

A row is published only when all three representations were extracted and validated for it. Rows are missing for two distinct reasons, and the difference matters:

  • Environment limits -- a source file that did not elaborate within the timeout. These rows are absent for incidental reasons and are, in principle, recoverable. Their absence is close to random.
  • Extractor limits and row data -- most importantly goal_cardinality: this extractor records states with exactly one pending goal, so every tactic invoked against multiple goals is excluded. Their absence is systematic.

Known bias

The train split is not a uniform random subsample of its upstream split. Because multi-goal invocations are excluded by construction, single-goal proof states are over-represented relative to the full benchmark, as are the tactics that tend to be applied to them. Any comparison against a model trained on all upstream rows should account for this.

The val and test splits are near-complete, so evaluation numbers computed on them remain comparable with published results.

Per-split failure taxonomy

test -- 114 rows not published

phase rows kind reason
file_compile 59 environment Lean could not elaborate the source file within the timeout, or the REPL exited while compiling it. Retryable.
goal_cardinality 25 extractor limit The tactic was invoked against multiple pending goals. This extractor records single-goal states only, so these rows are absent by design.
invocation_alignment 24 row data The dataset's tactic text could not be matched to any invocation recorded by Lean in that file.
ambiguous_invocation 6 row data The tactic text matched more than one invocation, so the proof state could not be attributed unambiguously.

train -- per-phase breakdown unavailable

This split was extracted over several runs, and the manifest left on disk covers only 3,000 of its 250,814 rows. Rather than report phase counts measured on that fraction as if they described the split, they are omitted. The aggregate coverage above is measured from the published rows themselves and is exact; the causes listed under Coverage all apply here, goal_cardinality and file_compile foremost, but their relative sizes for this split are not established.

val -- 103 rows not published

phase rows kind reason
file_compile 53 environment Lean could not elaborate the source file within the timeout, or the REPL exited while compiling it. Retryable.
goal_cardinality 24 extractor limit The tactic was invoked against multiple pending goals. This extractor records single-goal states only, so these rows are absent by design.
invocation_alignment 18 row data The dataset's tactic text could not be matched to any invocation recorded by Lean in that file.
ambiguous_invocation 4 row data The tactic text matched more than one invocation, so the proof state could not be attributed unambiguously.
theorem_identity 4 environment The theorem's compilation unit could not be identified in the file. Retryable.

Schema

All three representations for a row ship in that same row, so nothing needs to be joined across files. Recursive payloads (source_syntax, local_context, the hypothesis lists) are stored as JSON strings: their shape varies per tactic, and a typed nested column would force either schema inference failures or a lowest-common-denominator union. Call json.loads on them.

column description
dataset Upstream dataset name the row came from.
split Upstream split: train, val, or test.
row_index Row index within the upstream split. Stable join key.
theorem Fully qualified Mathlib theorem name.
file_path Mathlib source path, relative to the repository root.
repo_url Mathlib repository URL.
repo_commit Mathlib commit the state was extracted at.
tactic The tactic text applied at this step.
text_state Pretty-printed goal before the tactic, as Lean printed it.
text_target_state Pretty-printed goal after the tactic.
raw_goal_sexp Source-faithful S-expression of the goal type.
raw_hyp_sexps JSON string: list of {name, sexp} for each hypothesis, source-faithful.
model_goal_sexp Normalized S-expression of the goal type.
model_hyp_sexps JSON string: list of {name, internal_name, context_index, binder_role, is_instance, is_let, sexp}.
source_syntax JSON string: the tactic's original syntax tree, with identifier leaves annotated by Lean-resolved references. This is the generation target.
syntax_args JSON string: normalized argument slots of the tactic syntax.
term_ranges JSON string: source ranges of elaborated tactic terms.
local_context JSON string: the local context with stable indices, for pointer-style argument supervision.
unit_index Index of the compilation unit within the file.
invocation_index Index of the matched invocation within the unit.
alignment_kind How the dataset tactic text was matched to the invocation.
target_state_matches_invocation True when Lean's post-tactic goal matches the dataset's target state. A useful filter for strict agreement with upstream.
pending_goal_count Pending goals at the invocation. Always 1; see coverage.
hypothesis_count Number of hypotheses in the local context.
hypothesis_names_match True when Lean's hypothesis names match those parsed from the upstream pretty-printed state.
raw_schema_version Schema version of the source-faithful record.
raw_extractor_version Extractor version that produced the raw record.
model_schema_version Schema version of the normalized sidecar.
model_normalization Normalization identifier applied to model S-expressions.
trace_schema_version Schema version of the action trace.
trace_extractor_version Extractor version that produced the action trace.
pantograph_commit Pantograph commit used for raw extraction.
model_pantograph_commit Pantograph commit used for normalization.
raw_record_sha256 Digest binding the sidecars to the raw record. Retained for audit; consumers need not check it, since all three targets ship in one row.
state_sha256 SHA-256 of the upstream state text.
tactic_sha256 SHA-256 of the upstream tactic text.
target_state_sha256 SHA-256 of the upstream target-state text.

Provenance

  • Mathlib commit: 29dcec074de168ac2bf835a77ef68bbe069194c5
  • Upstream dataset: cat-searcher/leandojo-benchmark-4-random
  • Extraction: each Mathlib source file is elaborated with a patched Pantograph REPL, and the proof state Lean records at each matched tactic invocation is captured. States are read from Lean, never parsed back from pretty-printed text.
  • test: extractor lean-action-trace-v3, raw schema v3, Pantograph unknown
  • train: extractor lean-action-trace-v3, raw schema v3, Pantograph unknown
  • val: extractor lean-action-trace-v3, raw schema v3, Pantograph unknown

Limitations

  • Single-goal states only; see Coverage.
  • train coverage is partial and biased; val/test are near-complete.
  • S-expressions are large. Expect the goal and hypothesis columns to dominate memory; select only the representation you need.
  • Normalized and source-faithful S-expressions are different representations of the same state, not alternatives of equal fidelity. Train on model_*; use raw_* when you need exactly what Lean emitted.

License and attribution

This dataset is released under apache-2.0. It is derived work, and both upstream licenses continue to apply to the material they cover:

  • Mathlib 4 is licensed Apache-2.0. Theorem names, tactic text, file paths, and every elaborated term in the S-expression columns derive from Mathlib at commit 29dcec074de168ac2bf835a77ef68bbe069194c5. See https://github.com/leanprover-community/mathlib4/blob/master/LICENSE.
  • LeanDojo is licensed MIT. The row selection and the split / row_index assignment are inherited unchanged from the LeanDojo benchmark, so its notice is reproduced below as MIT requires.
MIT License

Copyright (c) 2023 LeanDojo Team

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

Citation

Please cite both upstreams alongside this dataset: Mathlib for the mathematical content, and LeanDojo for the benchmark this dataset's row identity follows.

Downloads last month
56