Debian Codegraph @

test/regress/cli/regress0/ufdt/leon-heap-goal2.smt2

raw
1 ; COMMAND-LINE: --dt-stc-ind
2 ; EXPECT: unsat
3 (set-logic UFDT)
4 (declare-datatype Nat ((succ (pred Nat)) (zero)))
5 (declare-datatype Lst ((cons (head Nat) (tail Lst)) (nil)))
6 (declare-datatype Heap ((hleaf) (heap (rk Nat) (value Nat) (hleft Heap) (hright Heap))))
7 (declare-fun leq (Nat Nat) Bool)
8 (declare-fun rightHeight (Heap) Nat)
9 (assert (= (rightHeight hleaf) zero))
10 (assert (forall ((k Nat) (v Nat) (l Heap) (r Heap)) (= (rightHeight (heap k v l r)) (succ (rightHeight r)))))
11 (declare-fun hasLeftistProperty (Heap) Bool)
12 (assert (hasLeftistProperty hleaf))
13 (assert
14 (forall ((k Nat) (v Nat) (l Heap) (r Heap))
15 (= (hasLeftistProperty (heap k v l r))
16 (and (hasLeftistProperty l)
17 (hasLeftistProperty r)
18 (leq (rightHeight r) (rightHeight l))
19 (= k (succ (rightHeight r)))))))
20 (declare-fun merge (Heap Heap) Heap)
21 (declare-fun hinsert (Heap Nat) Heap)
22 (declare-fun hinsert-all (Lst Heap) Heap)
23 (assert (forall ((h Heap)) (= (hinsert-all nil h) h)))
24 (assert (forall ((h Heap) (n Nat) (l Lst)) (= (hinsert-all (cons n l) h) (hinsert (hinsert-all l h) n))))
25 (assert (forall ((x Heap) (n Nat)) (=> (hasLeftistProperty x) (hasLeftistProperty (hinsert x n)))))
26 (assert (not (forall ((n Lst) (x Heap)) (=> (hasLeftistProperty x) (hasLeftistProperty (hinsert-all n x))))))
27 (check-sat)