Проверить, состоят ли два списка из одних и тех же атомов

(defun test (v w)
  (if (null v)
      (null w)
      (test (remove (car v) v) (remove (car v) w))))

(defun same-atoms (w v)
  (null (our-set-exclusive-or w v)))
 
(defun our-set-exclusive-or (w v)
  (nconc (unique w v) (unique v w)))
 
(defun unique (w v)
  (cond ((null w) nil)
        ((member (car w) v) (unique (cdr w) v))
        ((cons (car w) (unique (cdr w) v)))))
 
> (same-atoms '(a) '(a))
T
> (same-atoms '(a) '(b))
NIL
> (same-atoms '() '())
T
> (same-atoms '(a b) '(b a))
T

(defun remove (a lst)
  (if (null lst) nil 
      (if (eq a (car lst)) (remove a (cdr lst))
                           (cons (car lst) (remove a (cdr lst))))))

(defun same-atoms (w v)
  (null (our-set-exclusive-or w v)))
 
(defun our-set-exclusive-or (w v)
  (append (unique w v) (unique v w)))
 
(defun unique (w v)
  (cond ((null w) nil)
        ((member (car w) v) (unique (cdr w) v))
        ((cons (car w) (unique (cdr w) v)))))
 
> (same-atoms '(a b) '(b a))
T
> (same-atoms '(a b) '(b c))
NIL

(defun task (l1 l2)
 (apply 'and (append (mapcar #'(lambda (x) (member x l2)) l1)
                     (mapcar #'(lambda (x) (member x l1)) l2))))
 
==> task
 
(task '(1 2 3 4) '(1 2 3 1 2 3 4))
 
==> T
 
(task '(1 2 3 4) '(1 2 3 1 2 3))
 
==> NIL