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.
99 lines
1.4 KiB
Lean4
99 lines
1.4 KiB
Lean4
theorem ex1 : ∀ x : Int, ∃ n : Nat, n > x :=
|
|
sorry
|
|
|
|
theorem ex2 : ∀ x : Int, ∃ n : Nat, x > n :=
|
|
sorry
|
|
|
|
namespace Lt
|
|
|
|
def ex1 (x y : Nat) (i j : Int) :=
|
|
x < i
|
|
|
|
def ex2 (x y : Nat) (i j : Int) :=
|
|
i < x
|
|
|
|
def ex3 (x y : Nat) (i j : Int) :=
|
|
i + 1 < x
|
|
|
|
def ex4 (x y : Nat) (i j : Int) :=
|
|
i < x + 1
|
|
|
|
def ex5 (x y : Nat) (i j : Int) :=
|
|
i < x + y
|
|
|
|
def ex6 (x y : Nat) (i j : Int) :=
|
|
i + j < x + 0
|
|
|
|
def ex7 (x y : Nat) (i j : Int) :=
|
|
i + j < x + i
|
|
|
|
def ex8 (x y : Nat) (i j : Int) :=
|
|
i + 0 < x + i
|
|
|
|
def ex9 (n : UInt32) :=
|
|
n < 0xd800
|
|
|
|
end Lt
|
|
|
|
namespace Eq
|
|
|
|
def ex1 (x y : Nat) (i j : Int) :=
|
|
x = i
|
|
|
|
def ex2 (x y : Nat) (i j : Int) :=
|
|
i = x
|
|
|
|
def ex3 (x y : Nat) (i j : Int) :=
|
|
i + 1 = x
|
|
|
|
def ex4 (x y : Nat) (i j : Int) :=
|
|
i = x + 1
|
|
|
|
def ex5 (x y : Nat) (i j : Int) :=
|
|
i = x + y
|
|
|
|
def ex6 (x y : Nat) (i j : Int) :=
|
|
i + j = x + 0
|
|
|
|
def ex7 (x y : Nat) (i j : Int) :=
|
|
i + j = x + i
|
|
|
|
def ex8 (x y : Nat) (i j : Int) :=
|
|
i + 0 = x + i
|
|
|
|
def ex9 (n : UInt32) :=
|
|
n = 0xd800
|
|
|
|
end Eq
|
|
|
|
namespace BEq
|
|
|
|
def ex1 (x y : Nat) (i j : Int) :=
|
|
x == i
|
|
|
|
def ex2 (x y : Nat) (i j : Int) :=
|
|
i == x
|
|
|
|
def ex3 (x y : Nat) (i j : Int) :=
|
|
i + 1 == x
|
|
|
|
def ex4 (x y : Nat) (i j : Int) :=
|
|
i == x + 1
|
|
|
|
def ex5 (x y : Nat) (i j : Int) :=
|
|
i == x + y
|
|
|
|
def ex6 (x y : Nat) (i j : Int) :=
|
|
i + j == x + 0
|
|
|
|
def ex7 (x y : Nat) (i j : Int) :=
|
|
i + j == x + i
|
|
|
|
def ex8 (x y : Nat) (i j : Int) :=
|
|
i + 0 == x + i
|
|
|
|
def ex9 (n : UInt32) :=
|
|
n == 0xd800
|
|
|
|
end BEq
|