Recognizer for cgraph-formula structures.
(cgraph-formula-p x) → *
Function:
(defun cgraph-formula-p (x) (declare (xargs :guard t)) (let ((__function__ 'cgraph-formula-p)) (declare (ignorable __function__)) (and (mbe :logic (and (alistp x) (equal (strip-cars x) '(deps name dep-success-vars success priority value order ruletype))) :exec (fty::alist-with-carsp x '(deps name dep-success-vars success priority value order ruletype))) (b* ((deps (cdr (std::da-nth 0 x))) (name (cdr (std::da-nth 1 x))) (dep-success-vars (cdr (std::da-nth 2 x))) (success (cdr (std::da-nth 3 x))) (priority (cdr (std::da-nth 4 x))) (value (cdr (std::da-nth 5 x))) (order (cdr (std::da-nth 6 x))) (ruletype (cdr (std::da-nth 7 x)))) (and (fgl-object-bindings-p deps) (symbolp name) (pseudo-term-subst-p dep-success-vars) (pseudo-termp success) (pseudo-termp priority) (pseudo-termp value) (natp order) (ctrex-ruletype-p ruletype))))))
Theorem:
(defthm consp-when-cgraph-formula-p (implies (cgraph-formula-p x) (consp x)) :rule-classes :compound-recognizer)