6b24eb474f
This PR fixes a bug in the dynamic variable reordering function used in `grind cutsat`. Closes #9948
6 lines
160 B
Text
6 lines
160 B
Text
theorem sum_of_n (n : Nat) :
|
|
(List.range (n + 1)).sum = n * (n + 1) / 2 := by
|
|
induction n with
|
|
| zero => rfl
|
|
| succ k ih =>
|
|
grind [List.range_succ]
|