Debian Codegraph @

test/regress/cli/regress0/quantifiers/bug290.smt2

raw
1 (set-logic AUFLIA)
2 (set-info :source | Simple list theorem |)
3 (set-info :smt-lib-version 2.6)
4 (set-info :category "crafted")
5 (set-info :status unsat)
6 (declare-sort List 0)
7 (declare-sort Elem 0)
8 (declare-fun cons (Elem List) List)
9 (declare-fun nil () List)
10 (declare-fun len (List) Int)
11 (assert (= (len nil) 0))
12 (assert (forall ((?x Elem) (?y List)) (= (len (cons ?x ?y)) (+ (len ?y) 1))))
13 (declare-fun append (List List) List)
14 (assert (forall ((?y List)) (= (append nil ?y) ?y)))
15 (assert (forall ((?x Elem) (?y1 List) (?y2 List)) (= (append (cons ?x ?y1) ?y2) (cons ?x (append ?y1 ?y2)))))
16 (declare-fun x () Elem)
17 (declare-fun y () List)
18 (assert (not (= (append (cons x nil) y) (cons x y))))
19 (check-sat)
20 (exit)