anchor.diff:        )
       )
   
  -(verify-guards expand
  -  :guard-debug t
  +  (verify-guards expand
       :hints (("Goal" :use ((:instance pseudo-term-listp-of-pseudo-lambdap-of-cdar-ex-args->term-lst)))))
   
     (define initialize-fn-lvls ((fn-lst func-alistp))
  
positive.code:                (consp (assoc-equal foo (ex-args->fn-lvls x)))))
      )
  
  ;; (defun filter-fn-symbs (lst wrld acc)
  ;;   (declare (xargs :guard (and (symbol-listp lst)
  ;;                               (plist-worldp wrld))))
  ;;   (cond ((endp lst) acc)
  ;;         (t (filter-fn-symbs (cdr lst)
  ;;                             wrld
  ;;                             (if (function-symbolp (car lst) wrld)
  ;;                                 (cons (car lst) acc)
  ;;                               acc)))))
  
  ;; ; The desired result:
  ;; (let* ((world (w state))
  ;;        (fns (remove-duplicates-eq
  ;;              (strip-cadrs (universal-theory :here)))))
  ;;   (filter-fn-symbs fns world nil))
  
  (defconst *SMT-basic-functions*
    `(binary-+ binary-* unary-/ unary--
      equal <
      implies if not
      lambda ))
  
    (encapsulate
      ()
  
negative.code: ;; To be compatible with Arithmetic books
  (include-book "ordinals/lexicographic-ordering-without-arithmetic" :dir :system)
  
  (defsection SMT-goal-generator
    :parents (Smtlink)
    :short "SMT-goal-generator generates the three type of goals for the verified clause processor"
  
    (defalist sym-nat-alist
      :key-type symbol
  