A (sidekick-base.Sidekick_base_solver.Th

module S : sig ... end

module Z : sig ... end

module Q : sig ... end

module LRA_solver : sig ... end

type term = S.T.Term.t

type ty = S.T.Ty.t

val view_as_lia : term -> ( Z.t, Q.t, term ) Sidekick_arith_lia.lia_view

val mk_bool : S.T.Term.store -> bool -> term

val mk_to_real : S.T.Term.store -> term -> term

val mk_lia : 
  S.T.Term.store ->
  ( Z.t, Q.t, term ) Sidekick_arith_lia.lia_view ->
  term

val ty_int : S.T.Term.store -> ty

val mk_eq : S.T.Term.store -> term -> term -> term

val has_ty_int : term -> bool

val lemma_lia : S.Lit.t Iter.t -> S.P.proof_rule

val lemma_relax_to_lra : S.Lit.t Iter.t -> S.P.proof_rule