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.
30 lines
979 B
Text
30 lines
979 B
Text
import Std.Tactic.BVDecide
|
|
|
|
open BitVec
|
|
|
|
theorem ineq_unit_1 (x y : BitVec 64) (h : x ≠ y) : y ≠ x := by
|
|
bv_decide
|
|
|
|
theorem ineq_unit_2 (x y z : BitVec 32) (h1 : x < y) (h2 : y < z) : x < z := by
|
|
bv_decide
|
|
|
|
theorem ineq_unit_2' (x y z : BitVec 32) (h1 : BitVec.ult x y) (h2 : y < z) : BitVec.ult x z := by
|
|
bv_decide
|
|
|
|
theorem ineq_unit_3 (x y z : BitVec 32) (h1 : x ≤ y) (h2 : y ≤ z) : x ≤ z := by
|
|
bv_decide
|
|
|
|
theorem ineq_unit_3' (x y z : BitVec 32) (h1 : BitVec.ule x y) (h2 : y ≤ z) : BitVec.ule x z := by
|
|
bv_decide
|
|
|
|
theorem ineq_unit_4 (x y z : BitVec 32) (h1 : x > y) (h2 : y > z) : x > z := by
|
|
bv_decide
|
|
|
|
theorem ineq_unit_5 (x y z : BitVec 32) (h1 : x ≥ y) (h2 : y ≥ z) : x ≥ z := by
|
|
bv_decide
|
|
|
|
theorem ineq_unit_6 (x y z : BitVec 32) (h1 : BitVec.slt x y) (h2 : BitVec.slt y z) : BitVec.slt x z := by
|
|
bv_decide
|
|
|
|
theorem ineq_unit_7 (x y z : BitVec 32) (h1 : BitVec.sle x y) (h2 : BitVec.sle y z) : BitVec.sle x z := by
|
|
bv_decide
|