mirror of
https://github.com/leanprover/lean4.git
synced 2026-03-17 18:34:06 +00:00
08eb78a5b2
This PR sets up the new integrated test/bench suite. It then migrates all benchmarks and some related tests to the new suite. There's also some documentation and some linting. For now, a lot of the old tests are left alone so this PR doesn't become even larger than it already is. Eventually, all tests should be migrated to the new suite though so there isn't a confusing mix of two systems.
25 lines
664 B
Lean4
25 lines
664 B
Lean4
/-!
|
|
Test support for `match`-applications in the simplifier.
|
|
The discriminants should be simplified before trying to apply congruence.
|
|
In the following example, the term `g (a + <num>)` takes an
|
|
exponential amount of time to be simplified the discriminants are not simplified,
|
|
and the `match`-application reduced before visiting the alternatives.
|
|
-/
|
|
|
|
def myid (x : Nat) := 0 + x
|
|
|
|
@[simp] theorem myid_eq : myid x = x := by simp [myid]
|
|
|
|
def f (x : Nat) (y z : Nat) : Nat :=
|
|
match myid x with
|
|
| 0 => y
|
|
| _+1 => z
|
|
|
|
def g (x : Nat) : Nat :=
|
|
match x with
|
|
| 0 => 1
|
|
| a+1 => f x (g a + 1) (g a)
|
|
|
|
theorem ex (h : a = 1) : g (a+64) = a := by
|
|
simp [g, f, h]
|