Debian Codegraph @

test/regress/cli/regress0/proofs/scope.smt2

raw
1 ; COMMAND-LINE: --produce-proofs
2 ; EXIT: 0
3 ; SCRUBBER: grep -v -E '.*'
4 (set-logic AUFLIA)
5 (declare-sort A$ 0)
6 (declare-sort B$ 0)
7 (declare-sort C$ 0)
8 (declare-sort D$ 0)
9 (declare-sort E$ 0)
10 (declare-sort F$ 0)
11 (declare-sort G$ 0)
12 (declare-sort H$ 0)
13 (declare-sort I$ 0)
14 (declare-sort J$ 0)
15 (declare-sort K$ 0)
16 (declare-sort L$ 0)
17 (declare-sort M$ 0)
18 (declare-sort N$ 0)
19 (declare-sort O$ 0)
20 (declare-sort P$ 0)
21 (declare-fun f1$ (M$ J$) L$)
22 (declare-fun f2$ (N$ C$) L$)
23 (declare-fun f3$ (C$ A$) B$)
24 (declare-fun f4$ (D$ E$) B$)
25 (declare-fun f5$ (F$ G$) D$)
26 (declare-fun f6$ (A$) F$)
27 (declare-fun f7$ (A$) G$)
28 (declare-fun f8$ (A$) E$)
29 (declare-fun f9$ (A$) E$)
30 (declare-fun x1$ () M$)
31 (declare-fun x2$ () N$)
32 (declare-fun x3$ () C$)
33 (declare-fun x4$ () C$)
34 (declare-fun x5$ () D$)
35 (declare-fun x6$ () J$)
36 (declare-fun x7$ () J$)
37 (declare-fun x8$ () M$)
38 (declare-fun x9$ () O$)
39 (declare-fun f10$ (H$ A$) K$)
40 (declare-fun f3a$ (E$ H$) I$)
41 (declare-fun f3b$ (J$ K$) I$)
42 (declare-fun f5a$ (O$ P$) N$)
43 (declare-fun x10$ () P$)
44 (assert (! (forall ((?v0 A$)) (not (= (f3$ x3$ ?v0) (f4$ (f5$ (f6$ ?v0) (f7$ ?v0)) (f8$ ?v0))))) :named a0))
45 (assert (! (forall ((?v0 A$)) (not (= (f3$ x4$ ?v0) (f4$ x5$ (f9$ ?v0))))) :named a1))
46 (assert (! (forall ((?v0 A$) (?v1 H$)) (not (= (f3a$ (f8$ ?v0) ?v1) (f3b$ x6$ (f10$ ?v1 ?v0))))) :named a2))
47 (assert (! (forall ((?v0 A$) (?v1 H$)) (not (= (f3a$ (f9$ ?v0) ?v1) (f3b$ x7$ (f10$ ?v1 ?v0))))) :named a3))
48 (assert (! (not (= (f1$ x8$ x6$) (f2$ (f5a$ x9$ x10$) x3$))) :named a4))
49 (assert (! (= (f1$ x1$ x7$) (f1$ x8$ x6$)) :named a5))
50 (assert (! (= (f1$ x1$ x7$) (f2$ x2$ x4$)) :named a6))
51 (assert (! (= (f2$ x2$ x4$) (f2$ (f5a$ x9$ x10$) x3$)) :named a7))
52 (assert (! (not false) :named a8))
53 (check-sat)
54 (get-proof)