structure Lean.Meta.Linear.Var : Type

• id : Nat

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

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

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

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

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

structure Lean.Meta.Linear.Assignment : Type

• val : Array Std.Internal.Rat

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

Equations

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

@[reducible, inline]

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

Equations

• a.size = a.val.size

@[reducible, inline]

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

Equations

• a.get? x = if h : x.id < a.size then some a.val[x.id] else none

@[reducible, inline]

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

@[reducible, inline]

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

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✝

@[reducible, inline]

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

@[reducible, inline]

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

Equations

• e.getMaxVarCoeff = e.val.back!.fst

@[reducible, inline]

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

Equations

• e.getMaxVar = e.val.back!.snd

@[reducible, inline]

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

Equations

• e.get i = e.val[i]

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

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

Equations

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

@[irreducible]

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

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 #[]

@[irreducible]

def Lean.Meta.Linear.Poly.combine.go (d₁ : Int) (e₁ : Lean.Meta.Linear.Poly) (d₂ : Int) (e₂ : Lean.Meta.Linear.Poly) (i₁ 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 Std.Internal.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

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

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

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

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

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

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

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

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

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

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

@[reducible, inline]

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

Equations

• c.isStrict = 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) : Std.Internal.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

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

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 } }

@[reducible, inline]

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

@[reducible, inline]

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

@[reducible, inline]

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

Equations

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

@[reducible, inline]

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

Equations

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

@[reducible, inline]

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

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

def Lean.Meta.Linear.resolve (s : Lean.Meta.Linear.State) (cl 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