• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Community
  • Proof-automation
    • Gl
    • Witness-cp
    • Ccg
    • Install-not-normalized
    • Rewrite$
    • Fgl
      • Fgl-rewrite-rules
      • Fgl-function-mode
      • Fgl-object
      • Fgl-solving
      • Fgl-handling-if-then-elses
      • Fgl-counterexamples
      • Fgl-getting-bits-from-objects
      • Fgl-primitive-and-meta-rules
      • Fgl-interpreter-overview
      • Fgl-correctness-of-binding-free-variables
      • Fgl-debugging
      • Fgl-testbenches
      • Def-fgl-boolean-constraint
      • Fgl-stack
      • Fgl-rewrite-tracing
      • Def-fgl-param-thm
      • Def-fgl-thm
      • Fgl-fast-alist-support
      • Fgl-array-support
      • Advanced-equivalence-checking-with-fgl
      • Fgl-fty-support
      • Fgl-internals
        • Symbolic-arithmetic
        • Bfr
          • Bfr-eval
          • Bfrstate
          • Bfr->aignet-lit
          • Bfr-p
          • Bounded-lit-fix
          • Bfr-list-fix
          • Aignet-lit->bfr
          • Variable-g-bindings
          • Bfr-listp$
          • Bfrstate>=
          • Bfr-listp-witness
          • Fgl-object-bindings-bfrlist
          • Bfr-set-var
          • Bfr-negate
          • Bfr-fix
          • Fgl-bfr-object-bindings-p
          • Bfr-mode
          • Bfr-mode-is
          • Lbfr-case
          • Bfrstate-case
          • Bfrstate-mode-is
          • Lbfr-mode-is
          • Bfr-mode-p
        • Fgl-interpreter-state
    • Removable-runes
    • Efficiency
    • Rewrite-bounds
    • Bash
    • Def-dag-measure
    • Bdd
    • Remove-hyps
    • Contextual-rewriting
    • Simp
    • Rewrite$-hyps
    • Bash-term-to-dnf
    • Use-trivial-ancestors-check
    • Minimal-runes
    • Clause-processor-tools
    • Fn-is-body
    • Without-subsumption
    • Rewrite-equiv-hint
    • Def-bounds
    • Rewrite$-context
    • Try-gl-concls
    • Hint-utils
  • ACL2
  • Macro-libraries
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Bfr

Bfr->aignet-lit

Signature

(bfr->aignet-lit x &optional (bfrstate 'bfrstate)) → lit

Arguments

x — Guard (bfr-p x).

bfrstate — Guard (bfrstate-p bfrstate).

Returns

lit — Type (satlink::litp lit).

Definitions and Theorems

Function: bfr->aignet-lit-fn

(defun bfr->aignet-lit-fn (x bfrstate)
  (declare (xargs :guard (and (bfrstate-p bfrstate) (bfr-p x))))
  (declare (xargs :guard (bfrstate-mode-is :aignet)))
  (let ((__function__ 'bfr->aignet-lit))
    (declare (ignorable __function__))
    (b* ((x (bfr-fix x)))
      (case x
        ((nil) 0)
        ((t) 1)
        (t (satlink::lit-fix x))))))

Theorem: litp-of-bfr->aignet-lit

(defthm litp-of-bfr->aignet-lit
  (b* ((lit (bfr->aignet-lit-fn x bfrstate)))
    (satlink::litp lit))
  :rule-classes :type-prescription)

Theorem: bfr->aignet-lit-in-bounds

(defthm bfr->aignet-lit-in-bounds
  (b* ((?lit (bfr->aignet-lit-fn x bfrstate)))
    (implies (bfrstate-mode-is :aignet)
             (<= (satlink::lit->var lit)
                 (bfrstate->bound bfrstate))))
  :rule-classes :linear)

Theorem: bfr->aignet-lit-of-aignet-lit->bfr

(defthm bfr->aignet-lit-of-aignet-lit->bfr
  (implies (bfrstate-mode-is :aignet)
           (equal (bfr->aignet-lit (aignet-lit->bfr x))
                  (bounded-lit-fix x (bfrstate->bound bfrstate)))))

Theorem: aignet-lit->bfr-of-bfr->aignet-lit

(defthm aignet-lit->bfr-of-bfr->aignet-lit
  (implies (bfrstate-mode-is :aignet)
           (equal (aignet-lit->bfr (bfr->aignet-lit x))
                  (bfr-fix x))))

Theorem: bfr->aignet-lit-of-bfr-fix

(defthm bfr->aignet-lit-of-bfr-fix
  (equal (bfr->aignet-lit (bfr-fix x))
         (bfr->aignet-lit x)))

Theorem: bfr->aignet-lit-of-consts

(defthm bfr->aignet-lit-of-consts
  (and (equal (bfr->aignet-lit t) 1)
       (equal (bfr->aignet-lit nil) 0)))

Theorem: bfr->aignet-lit-fn-of-bfrstate-fix-bfrstate

(defthm bfr->aignet-lit-fn-of-bfrstate-fix-bfrstate
  (equal (bfr->aignet-lit-fn x (bfrstate-fix bfrstate))
         (bfr->aignet-lit-fn x bfrstate)))

Theorem: bfr->aignet-lit-fn-bfrstate-equiv-congruence-on-bfrstate

(defthm bfr->aignet-lit-fn-bfrstate-equiv-congruence-on-bfrstate
  (implies (bfrstate-equiv bfrstate bfrstate-equiv)
           (equal (bfr->aignet-lit-fn x bfrstate)
                  (bfr->aignet-lit-fn x bfrstate-equiv)))
  :rule-classes :congruence)