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.
79 lines
2.1 KiB
Text
79 lines
2.1 KiB
Text
module
|
||
@[expose] public section -- TODO: remove after we fix congr_eq
|
||
set_option grind.debug true
|
||
inductive S where
|
||
| mk1 (n : Nat)
|
||
| mk2 (n : Nat) (s : S)
|
||
| mk3 (n : Bool)
|
||
| mk4 (s1 s2 : S)
|
||
|
||
def f (x y : S) :=
|
||
match x, y with
|
||
| .mk1 _, _ => 2
|
||
| _, .mk2 1 (.mk4 _ _) => 3
|
||
| .mk3 _, _ => 4
|
||
| _, _ => 5
|
||
|
||
example : f a b < 2 → b = .mk2 y1 y2 → y1 = 2 → a = .mk4 y3 y4 → False := by
|
||
grind (splits := 0) [f.eq_def]
|
||
|
||
example : b = .mk2 y1 y2 → y1 = 2 → a = .mk4 y3 y4 → f a b = 5 := by
|
||
grind (splits := 0) [f.eq_def]
|
||
|
||
example : b = .mk2 y1 y2 → y1 = 2 → a = .mk3 n → f a b = 4 := by
|
||
grind (splits := 0) [f.eq_def]
|
||
|
||
example : b = .mk2 y1 y2 → y1 = 1 → y2 = .mk4 s1 s2 → a = .mk3 n → f a b = 3 := by
|
||
grind (splits := 0) [f.eq_def]
|
||
|
||
example : b = .mk2 y1 y2 → y1 = 1 → y2 = .mk4 s1 s2 → a = .mk2 s3 s4 → f a b = 3 := by
|
||
grind (splits := 0) [f.eq_def]
|
||
|
||
example : f a b < 2 → b = .mk2 y1 y2 → y1 = 2 → a = .mk4 y3 y4 → False := by
|
||
grind (splits := 0) [f]
|
||
|
||
example : b = .mk2 y1 y2 → y1 = 2 → a = .mk4 y3 y4 → f a b = 5 := by
|
||
grind (splits := 0) [f]
|
||
|
||
example : b = .mk2 y1 y2 → y1 = 2 → a = .mk3 n → f a b = 4 := by
|
||
grind (splits := 0) [f]
|
||
|
||
example : b = .mk2 y1 y2 → y1 = 1 → y2 = .mk4 s1 s2 → a = .mk3 n → f a b = 3 := by
|
||
grind (splits := 0) [f]
|
||
|
||
example : b = .mk2 y1 y2 → y1 = 1 → y2 = .mk4 s1 s2 → a = .mk2 s3 s4 → f a b = 3 := by
|
||
grind (splits := 0) [f]
|
||
|
||
example : f a b > 1 := by
|
||
grind (splits := 1) [f.eq_def]
|
||
|
||
example : f a b > 1 := by
|
||
grind [f.eq_def]
|
||
|
||
def g (x y : S) :=
|
||
match x, y with
|
||
| .mk1 a, _ => a + 2
|
||
| _, .mk2 1 (.mk4 _ _) => 3
|
||
| .mk3 _, .mk4 _ _ => 4
|
||
| _, _ => 5
|
||
|
||
example : g a b > 1 := by
|
||
grind [g.eq_def]
|
||
|
||
inductive Vec (α : Type u) : Nat → Type u
|
||
| nil : Vec α 0
|
||
| cons : α → Vec α n → Vec α (n+1)
|
||
|
||
def h (v w : Vec α n) : Nat :=
|
||
match v, w with
|
||
| _, .cons _ (.cons _ _) => 20
|
||
| .nil, _ => 30
|
||
| _, _ => 40
|
||
|
||
example : h a b > 0 := by
|
||
grind [h.eq_def]
|
||
|
||
-- TODO: introduce casts while instantiating equation theorems for `h.match_1`
|
||
-- example (a b : Vec α 2) : h a b = 20 := by
|
||
-- unfold h
|
||
-- grind
|