(define *default-tense-relations*

'(equal overlaps overlapped-by starts started-by ends ended-by during contains))

(define *inverses-of-primitive-events* '(notA))

(define *interval-fluents '())

(define *alphabet* (build-alphabet *primitive-events*))

(define (ev-not ev1)

(nfa-alphabet-set! ev1 (alphabet))

(let* ((dfa1 (nfa->dfa ev1))

(closure (weak-subsumptive-closure dfa1))

(L (dfa-consistent-universal-language))

(not-ev1 (dfa-less L closure)))

(dfa->nfa not-ev1)))

(print "*************************")

;(print (maxf length (nfa-alphabet nfa1)))

;(map print (nfa-alphabet nfa1))

(view (graph dfa1))