Logic form of ipasir-input. See ipasir for usage.
(ipasir-input$a solver) → new-solver
Function:
(defun ipasir-input$a (solver) (declare (xargs :guard (ipasir$a-p solver))) (declare (xargs :guard (not (eq (ipasir-get-status$a solver) :undef)))) (let ((__function__ 'ipasir-input$a)) (declare (ignorable __function__)) (change-ipasir$a solver :status :input)))
Theorem:
(defthm ipasir$a-p-of-ipasir-input$a (b* ((new-solver (ipasir-input$a solver))) (ipasir$a-p new-solver)) :rule-classes :rewrite)
Theorem:
(defthm ipasir-input$a-status (b* ((?new-solver (ipasir-input$a solver))) (equal (ipasir$a->status new-solver) :input)))
Theorem:
(defthm new-clause-of-ipasir-input$a (b* ((?new-solver (ipasir-input$a solver))) (equal (ipasir$a->new-clause new-solver) (ipasir$a->new-clause solver))))
Theorem:
(defthm formula-of-ipasir-input$a (b* ((?new-solver (ipasir-input$a solver))) (equal (ipasir$a->formula new-solver) (ipasir$a->formula solver))))
Theorem:
(defthm assumption-of-ipasir-input$a (b* ((?new-solver (ipasir-input$a solver))) (equal (ipasir$a->assumption new-solver) (ipasir$a->assumption solver))))
Theorem:
(defthm ipasir-input$a-of-ipasir$a-fix-solver (equal (ipasir-input$a (ipasir$a-fix solver)) (ipasir-input$a solver)))
Theorem:
(defthm ipasir-input$a-ipasir$a-equiv-congruence-on-solver (implies (ipasir$a-equiv solver solver-equiv) (equal (ipasir-input$a solver) (ipasir-input$a solver-equiv))) :rule-classes :congruence)