Debian Codegraph @

test/regress/cli/regress1/quantifiers/isaplanner-goal20.smt2

raw
1 ; COMMAND-LINE: --quant-ind --conjecture-gen
2 ; EXPECT: unsat
3 (set-logic UFDTLIA)
4 (set-info :status unsat)
5 (declare-datatypes ((Nat 0)) (((succ (pred Nat)) (zero))
6 ))
7 (declare-datatypes ((Lst 0)) (((cons (head Nat) (tail Lst)) (nil))
8 ))
9 (declare-datatypes ((Tree 0)) (((node (data Nat) (left Tree) (right Tree)) (leaf))
10 ))
11 (declare-datatypes ((Pair 0)(ZLst 0)) (((mkpair (first Nat) (second Nat)))
12 ((zcons (zhead Pair) (ztail ZLst)) (znil))
13 ))
14 (declare-fun P (Nat) Bool)
15 (declare-fun f (Nat) Nat)
16 (declare-fun less (Nat Nat) Bool)
17 (declare-fun plus (Nat Nat) Nat)
18 (declare-fun minus (Nat Nat) Nat)
19 (declare-fun mult (Nat Nat) Nat)
20 (declare-fun nmax (Nat Nat) Nat)
21 (declare-fun nmin (Nat Nat) Nat)
22 (declare-fun nat-to-int (Nat) Int)
23 (declare-fun append (Lst Lst) Lst)
24 (declare-fun len (Lst) Nat)
25 (declare-fun drop (Nat Lst) Lst)
26 (declare-fun take (Nat Lst) Lst)
27 (declare-fun count (Nat Lst) Nat)
28 (declare-fun last (Lst) Nat)
29 (declare-fun butlast (Lst) Lst)
30 (declare-fun mem (Nat Lst) Bool)
31 (declare-fun delete (Nat Lst) Lst)
32 (declare-fun rev (Lst) Lst)
33 (declare-fun lmap (Lst) Lst)
34 (declare-fun filter (Lst) Lst)
35 (declare-fun dropWhile (Lst) Lst)
36 (declare-fun takeWhile (Lst) Lst)
37 (declare-fun ins1 (Nat Lst) Lst)
38 (declare-fun insort (Nat Lst) Lst)
39 (declare-fun sorted (Lst) Bool)
40 (declare-fun sort (Lst) Lst)
41 (declare-fun zip (Lst Lst) ZLst)
42 (declare-fun zappend (ZLst ZLst) ZLst)
43 (declare-fun zdrop (Nat ZLst) ZLst)
44 (declare-fun ztake (Nat ZLst) ZLst)
45 (declare-fun zrev (ZLst) ZLst)
46 (declare-fun mirror (Tree) Tree)
47 (declare-fun height (Tree) Nat)
48 (define-fun leq ((x Nat) (y Nat)) Bool (or (= x y) (less x y)))
49 (assert (forall ((x Nat)) (>= (nat-to-int x) 0) ))
50 (assert (forall ((x Nat) (y Nat)) (=> (= (nat-to-int x) (nat-to-int y)) (= x y)) ))
51 (assert (= (nat-to-int zero) 0))
52 (assert (forall ((x Nat)) (= (nat-to-int (succ x)) (+ 1 (nat-to-int x))) ))
53 (assert (forall ((x Nat)) (= (less x zero) false) ))
54 (assert (forall ((x Nat)) (= (less zero (succ x)) true) ))
55 (assert (forall ((x Nat) (y Nat)) (= (less (succ x) (succ y)) (less x y)) ))
56 (assert (forall ((x Nat) (y Nat)) (= (less x y) (< (nat-to-int x) (nat-to-int y))) ))
57 (assert (= (len nil) zero))
58 (assert (forall ((x Nat) (y Lst)) (= (len (cons x y)) (succ (len y))) ))
59 (assert (forall ((i Nat)) (= (insort i nil) (cons i nil)) ))
60 (assert (forall ((i Nat) (x Nat) (y Lst)) (= (insort i (cons x y)) (ite (less i x) (cons i (cons x y)) (cons x (insort i y)))) ))
61 (assert (= (sort nil) nil))
62 (assert (forall ((x Nat) (y Lst)) (= (sort (cons x y)) (insort x (sort y))) ))
63 (assert (not (forall ((l Lst)) (= (len (sort l)) (len l)) )))
64 (check-sat)
65 (exit)
66