structure Lean.Meta.Linear.Var : Type

• id : Nat

instance Lean.Meta.Linear.instInhabitedVar : Inhabited Lean.Meta.Linear.Var

Equations

• Lean.Meta.Linear.instInhabitedVar = { default := { id := default } }

instance Lean.Meta.Linear.instOrdVar : Ord Lean.Meta.Linear.Var

Equations

• Lean.Meta.Linear.instOrdVar = { compare := Lean.Meta.Linear.ordVar✝ }

instance Lean.Meta.Linear.instDecidableEqVar : DecidableEq Lean.Meta.Linear.Var

Equations

• Lean.Meta.Linear.instDecidableEqVar = Lean.Meta.Linear.decEqVar✝

instance Lean.Meta.Linear.instReprVar : Repr Lean.Meta.Linear.Var

Equations

• Lean.Meta.Linear.instReprVar = { reprPrec := Lean.Meta.Linear.reprVar✝ }

instance Lean.Meta.Linear.instLTVar : LT Lean.Meta.Linear.Var

Equations

• Lean.Meta.Linear.instLTVar = { lt := fun (a b : Lean.Meta.Linear.Var) => a.id < b.id }

instance Lean.Meta.Linear.instDecidableLtVarInstLTVar (a : Lean.Meta.Linear.Var) (b : Lean.Meta.Linear.Var) : Decidable (a < b)

Equations

• Lean.Meta.Linear.instDecidableLtVarInstLTVar a b = inferInstanceAs (Decidable (a.id < b.id))

structure Lean.Meta.Linear.Assignment : Type

• val : Array Lean.Rat

instance Lean.Meta.Linear.instInhabitedAssignment : Inhabited Lean.Meta.Linear.Assignment

Equations

• Lean.Meta.Linear.instInhabitedAssignment = { default := { val := default } }

@[inline, reducible]

abbrev Lean.Meta.Linear.Assignment.size (a : Lean.Meta.Linear.Assignment) : Nat

Equations

• Lean.Meta.Linear.Assignment.size a = Array.size a.val

@[inline, reducible]

abbrev Lean.Meta.Linear.Assignment.get? (a : Lean.Meta.Linear.Assignment) (x : Lean.Meta.Linear.Var) : Option Lean.Rat

Equations

• Lean.Meta.Linear.Assignment.get? a x = if h : x.id < Lean.Meta.Linear.Assignment.size a then some (Array.get a.val { val := x.id, isLt := h }) else none

@[inline, reducible]

abbrev Lean.Meta.Linear.Assignment.push (a : Lean.Meta.Linear.Assignment) (v : Lean.Rat) : Lean.Meta.Linear.Assignment

Equations

• Lean.Meta.Linear.Assignment.push a v = { val := Array.push a.val v }

@[inline, reducible]

abbrev Lean.Meta.Linear.Assignment.shrink (a : Lean.Meta.Linear.Assignment) (newSize : Nat) : Lean.Meta.Linear.Assignment

Equations

• Lean.Meta.Linear.Assignment.shrink a newSize = { val := Array.shrink a.val newSize }

structure Lean.Meta.Linear.Poly : Type

• val : Array (Int × Lean.Meta.Linear.Var)

instance Lean.Meta.Linear.instInhabitedPoly : Inhabited Lean.Meta.Linear.Poly

Equations

• Lean.Meta.Linear.instInhabitedPoly = { default := { val := default } }

instance Lean.Meta.Linear.instReprPoly : Repr Lean.Meta.Linear.Poly

Equations

• Lean.Meta.Linear.instReprPoly = { reprPrec := Lean.Meta.Linear.reprPoly✝ }

instance Lean.Meta.Linear.instDecidableEqPoly : DecidableEq Lean.Meta.Linear.Poly

Equations

• Lean.Meta.Linear.instDecidableEqPoly = Lean.Meta.Linear.decEqPoly✝

@[inline, reducible]

abbrev Lean.Meta.Linear.Poly.size (e : Lean.Meta.Linear.Poly) : Nat

Equations

• Lean.Meta.Linear.Poly.size e = Array.size e.val

@[inline, reducible]

abbrev Lean.Meta.Linear.Poly.getMaxVarCoeff (e : Lean.Meta.Linear.Poly) : Int

Equations

• Lean.Meta.Linear.Poly.getMaxVarCoeff e = (Array.back e.val).fst

@[inline, reducible]

abbrev Lean.Meta.Linear.Poly.getMaxVar (e : Lean.Meta.Linear.Poly) : Lean.Meta.Linear.Var

Equations

• Lean.Meta.Linear.Poly.getMaxVar e = (Array.back e.val).snd

@[inline, reducible]

abbrev Lean.Meta.Linear.Poly.get (e : Lean.Meta.Linear.Poly) (i : Fin (Lean.Meta.Linear.Poly.size e)) : Int × Lean.Meta.Linear.Var

Equations

• Lean.Meta.Linear.Poly.get e i = Array.get e.val i

def Lean.Meta.Linear.Poly.scale (d : Int) (e : Lean.Meta.Linear.Poly) : Lean.Meta.Linear.Poly

Equations

• Lean.Meta.Linear.Poly.scale d e = { val := Array.map (fun (x : Int × Lean.Meta.Linear.Var) => match x with | (c, x) => (c * d, x)) e.val }

def Lean.Meta.Linear.Poly.add (e₁ : Lean.Meta.Linear.Poly) (e₂ : Lean.Meta.Linear.Poly) : Lean.Meta.Linear.Poly

Equations

• Lean.Meta.Linear.Poly.add e₁ e₂ = Lean.Meta.Linear.Poly.add.go e₁ e₂ 0 0 #[]

def Lean.Meta.Linear.Poly.add.go (e₁ : Lean.Meta.Linear.Poly) (e₂ : Lean.Meta.Linear.Poly) (i₁ : Nat) (i₂ : Nat) (r : Array (Int × Lean.Meta.Linear.Var)) : Lean.Meta.Linear.Poly

Equations

• One or more equations did not get rendered due to their size.

def Lean.Meta.Linear.Poly.combine (d₁ : Int) (e₁ : Lean.Meta.Linear.Poly) (d₂ : Int) (e₂ : Lean.Meta.Linear.Poly) : Lean.Meta.Linear.Poly

Equations

• Lean.Meta.Linear.Poly.combine d₁ e₁ d₂ e₂ = Lean.Meta.Linear.Poly.combine.go d₁ e₁ d₂ e₂ 0 0 #[]

def Lean.Meta.Linear.Poly.combine.go (d₁ : Int) (e₁ : Lean.Meta.Linear.Poly) (d₂ : Int) (e₂ : Lean.Meta.Linear.Poly) (i₁ : Nat) (i₂ : Nat) (r : Array (Int × Lean.Meta.Linear.Var)) : Lean.Meta.Linear.Poly

Equations

• One or more equations did not get rendered due to their size.

def Lean.Meta.Linear.Poly.eval? (e : Lean.Meta.Linear.Poly) (a : Lean.Meta.Linear.Assignment) : Option Lean.Rat

Equations

• One or more equations did not get rendered due to their size.

structure Lean.Meta.Linear.AssumptionId : Type

• id : Nat

instance Lean.Meta.Linear.instInhabitedAssumptionId : Inhabited Lean.Meta.Linear.AssumptionId

Equations

• Lean.Meta.Linear.instInhabitedAssumptionId = { default := { id := default } }

instance Lean.Meta.Linear.instDecidableEqAssumptionId : DecidableEq Lean.Meta.Linear.AssumptionId

Equations

• Lean.Meta.Linear.instDecidableEqAssumptionId = Lean.Meta.Linear.decEqAssumptionId✝

instance Lean.Meta.Linear.instReprAssumptionId : Repr Lean.Meta.Linear.AssumptionId

Equations

• Lean.Meta.Linear.instReprAssumptionId = { reprPrec := Lean.Meta.Linear.reprAssumptionId✝ }

inductive Lean.Meta.Linear.Justification : Type

• combine: Int → Lean.Meta.Linear.Justification → Int → Lean.Meta.Linear.Justification → Lean.Meta.Linear.Justification
• assumption: Lean.Meta.Linear.AssumptionId → Lean.Meta.Linear.Justification

instance Lean.Meta.Linear.instInhabitedJustification : Inhabited Lean.Meta.Linear.Justification

Equations

• Lean.Meta.Linear.instInhabitedJustification = { default := Lean.Meta.Linear.Justification.assumption default }

instance Lean.Meta.Linear.instDecidableEqJustification : DecidableEq Lean.Meta.Linear.Justification

Equations

• Lean.Meta.Linear.instDecidableEqJustification = Lean.Meta.Linear.decEqJustification✝

instance Lean.Meta.Linear.instBEqJustification : BEq Lean.Meta.Linear.Justification

Equations

• Lean.Meta.Linear.instBEqJustification = { beq := Lean.Meta.Linear.beqJustification✝ }

instance Lean.Meta.Linear.instReprJustification : Repr Lean.Meta.Linear.Justification

Equations

• Lean.Meta.Linear.instReprJustification = { reprPrec := Lean.Meta.Linear.reprJustification✝ }

inductive Lean.Meta.Linear.CnstrKind : Type

• eq: Lean.Meta.Linear.CnstrKind
• div: Lean.Meta.Linear.CnstrKind
• lt: Lean.Meta.Linear.CnstrKind
• le: Lean.Meta.Linear.CnstrKind

instance Lean.Meta.Linear.instInhabitedCnstrKind : Inhabited Lean.Meta.Linear.CnstrKind

Equations

• Lean.Meta.Linear.instInhabitedCnstrKind = { default := Lean.Meta.Linear.CnstrKind.eq }

instance Lean.Meta.Linear.instDecidableEqCnstrKind : DecidableEq Lean.Meta.Linear.CnstrKind

Equations

• Lean.Meta.Linear.instDecidableEqCnstrKind x y = if h : Lean.Meta.Linear.CnstrKind.toCtorIdx x = Lean.Meta.Linear.CnstrKind.toCtorIdx y then isTrue ⋯ else isFalse ⋯

instance Lean.Meta.Linear.instBEqCnstrKind : BEq Lean.Meta.Linear.CnstrKind

Equations

• Lean.Meta.Linear.instBEqCnstrKind = { beq := Lean.Meta.Linear.beqCnstrKind✝ }

instance Lean.Meta.Linear.instReprCnstrKind : Repr Lean.Meta.Linear.CnstrKind

Equations

• Lean.Meta.Linear.instReprCnstrKind = { reprPrec := Lean.Meta.Linear.reprCnstrKind✝ }

structure Lean.Meta.Linear.Cnstr : Type

• kind : Lean.Meta.Linear.CnstrKind
• lhs : Lean.Meta.Linear.Poly
• rhs : Int
• jst : Lean.Meta.Linear.Justification

instance Lean.Meta.Linear.instInhabitedCnstr : Inhabited Lean.Meta.Linear.Cnstr

Equations

• Lean.Meta.Linear.instInhabitedCnstr = { default := { kind := default, lhs := default, rhs := default, jst := default } }

instance Lean.Meta.Linear.instDecidableEqCnstr : DecidableEq Lean.Meta.Linear.Cnstr

Equations

• Lean.Meta.Linear.instDecidableEqCnstr = Lean.Meta.Linear.decEqCnstr✝

instance Lean.Meta.Linear.instBEqCnstr : BEq Lean.Meta.Linear.Cnstr

Equations

• Lean.Meta.Linear.instBEqCnstr = { beq := Lean.Meta.Linear.beqCnstr✝ }

instance Lean.Meta.Linear.instReprCnstr : Repr Lean.Meta.Linear.Cnstr

Equations

• Lean.Meta.Linear.instReprCnstr = { reprPrec := Lean.Meta.Linear.reprCnstr✝ }

@[inline, reducible]

abbrev Lean.Meta.Linear.Cnstr.isStrict (c : Lean.Meta.Linear.Cnstr) : Bool

Equations

• Lean.Meta.Linear.Cnstr.isStrict c = match c.kind with | Lean.Meta.Linear.CnstrKind.lt => true | x => false

def Lean.Meta.Linear.Cnstr.getBound (c : Lean.Meta.Linear.Cnstr) (a : Lean.Meta.Linear.Assignment) : Lean.Rat

Equations

• One or more equations did not get rendered due to their size.

def Lean.Meta.Linear.Cnstr.isUnsat (c : Lean.Meta.Linear.Cnstr) (a : Lean.Meta.Linear.Assignment) : Bool

Equations

• One or more equations did not get rendered due to their size.

def Lean.Meta.Linear.getBestBound? (cs : Array Lean.Meta.Linear.Cnstr) (a : Lean.Meta.Linear.Assignment) (isLower : Bool) (isInt : Bool) : Option (Lean.Rat × Lean.Meta.Linear.Cnstr)

Equations

• One or more equations did not get rendered due to their size.

inductive Lean.Meta.Linear.Result : Type

• unsat: Lean.Meta.Linear.Justification → Lean.Meta.Linear.Result
• unsupported: Lean.Meta.Linear.Result
• timeout: Lean.Meta.Linear.Result
• sat: Lean.Meta.Linear.Assignment → Lean.Meta.Linear.Result

structure Lean.Meta.Linear.Context : Type

• int : Array Bool

structure Lean.Meta.Linear.State : Type

• lowers : Array (Array Lean.Meta.Linear.Cnstr)
• uppers : Array (Array Lean.Meta.Linear.Cnstr)
• int : Array Bool
• assignment : Lean.Meta.Linear.Assignment

instance Lean.Meta.Linear.instInhabitedState : Inhabited Lean.Meta.Linear.State

Equations

• Lean.Meta.Linear.instInhabitedState = { default := { lowers := default, uppers := default, int := default, assignment := default } }

@[inline, reducible]

abbrev Lean.Meta.Linear.State.getNumVars (s : Lean.Meta.Linear.State) : Nat

Equations

• Lean.Meta.Linear.State.getNumVars s = Array.size s.lowers

@[inline, reducible]

abbrev Lean.Meta.Linear.State.currVar (s : Lean.Meta.Linear.State) : Nat

Equations

• Lean.Meta.Linear.State.currVar s = Lean.Meta.Linear.Assignment.size s.assignment

@[inline, reducible]

abbrev Lean.Meta.Linear.State.getBestLowerBound? (s : Lean.Meta.Linear.State) : Option (Lean.Rat × Lean.Meta.Linear.Cnstr)

Equations

• Lean.Meta.Linear.State.getBestLowerBound? s = Lean.Meta.Linear.getBestBound? s.lowers[Lean.Meta.Linear.State.currVar s]! s.assignment true s.int[Lean.Meta.Linear.State.currVar s]!

@[inline, reducible]

abbrev Lean.Meta.Linear.State.getBestUpperBound? (s : Lean.Meta.Linear.State) : Option (Lean.Rat × Lean.Meta.Linear.Cnstr)

Equations

• Lean.Meta.Linear.State.getBestUpperBound? s = Lean.Meta.Linear.getBestBound? s.uppers[Lean.Meta.Linear.State.currVar s]! s.assignment false s.int[Lean.Meta.Linear.State.currVar s]!

@[inline, reducible]

abbrev Lean.Meta.Linear.State.assignCurr (s : Lean.Meta.Linear.State) (v : Lean.Rat) : Lean.Meta.Linear.State

Equations

• Lean.Meta.Linear.State.assignCurr s v = { lowers := s.lowers, uppers := s.uppers, int := s.int, assignment := Lean.Meta.Linear.Assignment.push s.assignment v }

def Lean.Meta.Linear.pickAssignment? (lower : Lean.Rat) (lowerIsStrict : Bool) (upper : Lean.Rat) (upperIsStrict : Bool) : Option Lean.Rat

Equations

• One or more equations did not get rendered due to their size.

def Lean.Meta.Linear.resolve (s : Lean.Meta.Linear.State) (cl : Lean.Meta.Linear.Cnstr) (cu : Lean.Meta.Linear.Cnstr) : Lean.Meta.Linear.Result ⊕ Lean.Meta.Linear.State

Equations

• One or more equations did not get rendered due to their size.

def Lean.Meta.Linear.solve (n : Nat) (s : Lean.Meta.Linear.State) : Lean.Meta.Linear.Result

Equations

• One or more equations did not get rendered due to their size.
• Lean.Meta.Linear.solve 0 s = Lean.Meta.Linear.Result.timeout