• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
      • Ipasir
        • Ipasir$a
          • Ipasir$a-p
            • Ipasir$a-fix
            • Ipasir-set-limit$a
            • Ipasir-add-lit$a
            • Ipasir-assume$a
            • Ipasir-init$a
            • Make-ipasir$a
            • Ipasir-finalize-clause$a
            • Ipasir-reinit$a
            • Ipasir$a-equiv
            • Ipasir-input$a
            • Ipasir-val$a
            • Ipasir-release$a
            • Ipasir$a->solved-assumption
            • Ipasir$a->new-clause
            • Ipasir$a->callback-count
            • Ipasir$a->assumption
            • Ipasir-failed$a
            • Change-ipasir$a
            • Ipasir$a->solution
            • Ipasir$a->formula
            • Ipasir$a->status
            • Ipasir$a->history
            • Ipasir-callback-count$a
            • Ipasir-solved-assumption$a
            • Ipasir-some-history$a
            • Ipasir-get-status$a
            • Ipasir-get-assumption$a
            • Ipasir-empty-new-clause$a
            • Create-ipasir$a
            • Ipasir-solve$a
          • Building-an-ipasir-solver-library
          • Ipasir-formula
          • Ipasir-bump-activity-vars$a
          • Ipasir-set$a
          • Ipasir-bump-activity-vars$c
          • Ipasir-get$a
          • Ipasir-set-limit$c
          • Ipasir-set$c
          • Ipasir-failed$c
          • Ipasir-assume$c
          • Ipasir-add-lit$c
          • Ipasir-val$c
          • With-local-ipasir
          • Ipasir-solve$c
          • Ipasir-reinit$c
          • Ipasir-init$c
          • Ipasir-finalize-clause$c
          • Ipasir-some-history$c
          • Ipasir-solved-assumption$c
          • Ipasir-release$c
          • Ipasir-input$c
          • Ipasir-get$c
          • Ipasir-get-status$c
          • Ipasir-get-curr-stats$c
          • Ipasir-get-assumption$c
          • Ipasir-empty-new-clause$c
          • Ipasir-callback-count$c
          • Ipasir-val
          • Ipasir-solve
          • Ipasir-set-limit
          • Ipasir-reinit
          • Ipasir-failed
          • Ipasir-callback-count
          • Ipasir-release
          • Ipasir-input
          • Ipasir-init
          • Ipasir-finalize-clause
          • Ipasir-assume
          • Ipasir-add-lit
        • Aignet
        • Aig
        • Satlink
        • Truth
        • Ubdds
        • Bdd
        • Faig
        • Bed
        • 4v
      • Projects
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Testing-utilities
      • Math
    • Ipasir$a

    Ipasir$a-p

    Recognizer for ipasir$a structures.

    Signature
    (ipasir$a-p x) → *

    Definitions and Theorems

    Function: ipasir$a-p

    (defun
     ipasir$a-p (x)
     (declare (xargs :guard t))
     (let
      ((__function__ 'ipasir$a-p))
      (declare (ignorable __function__))
      (and
       (mbe
          :logic (and (alistp x)
                      (equal (strip-cars x)
                             '(formula assumption new-clause
                                       status solution solved-assumption
                                       callback-count history)))
          :exec (fty::alist-with-carsp
                     x
                     '(formula assumption new-clause
                               status solution solved-assumption
                               callback-count history)))
       (b* ((formula (cdr (std::da-nth 0 x)))
            (assumption (cdr (std::da-nth 1 x)))
            (new-clause (cdr (std::da-nth 2 x)))
            (status (cdr (std::da-nth 3 x)))
            (solution (cdr (std::da-nth 4 x)))
            (solved-assumption (cdr (std::da-nth 5 x)))
            (callback-count (cdr (std::da-nth 6 x)))
            (?history (cdr (std::da-nth 7 x))))
           (and (lit-list-listp formula)
                (lit-listp assumption)
                (lit-listp new-clause)
                (ipasir-status-p status)
                (lit-listp solution)
                (lit-listp solved-assumption)
                (natp callback-count))))))

    Theorem: consp-when-ipasir$a-p

    (defthm consp-when-ipasir$a-p
            (implies (ipasir$a-p x) (consp x))
            :rule-classes :compound-recognizer)