cfc46ac17f
This PR simplifies the `grind order` module, and internalizes the order constraints. It removes the `Offset` type class because it introduced too much complexity. We now cover the same use cases with a simpler approach: - Any type that implements at least `Std.IsPreorder` - Arbitrary ordered rings. - `Nat` by the `Nat.ToInt` adapter.
85 lines
1.4 KiB
Text
85 lines
1.4 KiB
Text
module
|
|
reset_grind_attrs%
|
|
|
|
attribute [grind] List.map_append
|
|
|
|
def a := 10
|
|
|
|
example : a = 5 + 5 := by
|
|
grind [a]
|
|
|
|
/--
|
|
error: `grind` failed
|
|
case grind
|
|
h : ¬a = 10
|
|
⊢ False
|
|
[grind] Goal diagnostics
|
|
[facts] Asserted facts
|
|
[prop] ¬a = 10
|
|
[eqc] False propositions
|
|
[prop] a = 10
|
|
[cutsat] Assignment satisfying linear constraints
|
|
[assign] a := 0
|
|
-/
|
|
#guard_msgs (error) in
|
|
example : a = 5 + 5 := by
|
|
grind
|
|
|
|
section
|
|
attribute [local grind] a
|
|
|
|
example : a = 5 + 5 := by
|
|
grind
|
|
end
|
|
|
|
def f (x : Nat) := x + 1
|
|
|
|
theorem fa : f a = 11 := rfl
|
|
|
|
example : f a = 10 + 1 := by
|
|
grind [fa]
|
|
|
|
/--
|
|
error: `grind` failed
|
|
case grind
|
|
h : ¬f a = 11
|
|
⊢ False
|
|
[grind] Goal diagnostics
|
|
[facts] Asserted facts
|
|
[prop] ¬f a = 11
|
|
[eqc] False propositions
|
|
[prop] f a = 11
|
|
[cutsat] Assignment satisfying linear constraints
|
|
[assign] a := 1
|
|
[assign] f a := 0
|
|
-/
|
|
#guard_msgs (error) in
|
|
example : f a = 10 + 1 := by
|
|
grind
|
|
|
|
attribute [grind] fa
|
|
|
|
example : f a = 10 + 1 := by
|
|
grind
|
|
|
|
/--
|
|
error: `grind` failed
|
|
case grind
|
|
x : Nat
|
|
h : ¬f x = 11
|
|
⊢ False
|
|
[grind] Goal diagnostics
|
|
[facts] Asserted facts
|
|
[prop] ¬f x = 11
|
|
[eqc] False propositions
|
|
[prop] f x = 11
|
|
[ematch] E-matching patterns
|
|
[thm] fa: [f `[a]]
|
|
[cutsat] Assignment satisfying linear constraints
|
|
[assign] x := 2
|
|
[assign] a := 1
|
|
[assign] f x := 0
|
|
-/
|
|
#guard_msgs (error) in
|
|
example : f x = 10 + 1 := by
|
|
grind
|