Debian Codegraph @

test/regress/cli/regress0/parser/use-name-in-same-command.smt2

raw
1 ; EXPECT: unsat
2 (set-logic QF_UFLIA)
3 (set-info :smt-lib-version 2.6)
4 (set-info :source |
5 SMT2 problem corresponding to a linear arithmetic proof step in the proof generated by the veriT solver for the SMT-LIB problem
6 QF_UFLIA/wisas/xs_12_22.smt2
7 |)
8 (set-info :status unsat)
9 (declare-fun arg0 () Int)
10 (declare-fun arg1 () Int)
11 (declare-fun fmt0 () Int)
12 (declare-fun fmt1 () Int)
13 (declare-fun distance () Int)
14 (declare-fun fmt_length () Int)
15 (declare-fun adr_lo () Int)
16 (declare-fun adr_medlo () Int)
17 (declare-fun adr_medhi () Int)
18 (declare-fun adr_hi () Int)
19 (declare-fun format (Int) Int)
20 (declare-fun percent () Int)
21 (declare-fun s () Int)
22 (declare-fun s_count (Int) Int)
23 (declare-fun x () Int)
24 (declare-fun x_count (Int) Int)
25 (assert (not (! (not (! (<= fmt0 arg1) :named p_1)) :named p_0)))
26 (assert (not (! (<= (! (+ 1 (! (x_count 0) :named p_4)) :named p_3) arg1) :named p_2)))
27 (assert (not (! (not (! (= distance 22) :named p_6)) :named p_5)))
28 (assert (not (! (not (! (= arg0 (- fmt0 distance)) :named p_8)) :named p_7)))
29 (assert (not (! (not (! (= arg1 (! (+ (! (+ arg0 (! (* 4 (! (s_count (! (- (- fmt1 2) fmt0) :named p_15)) :named p_14)) :named p_13)) :named p_12) (! (* 4 (! (x_count p_15) :named p_17)) :named p_16)) :named p_11)) :named p_10)) :named p_9)))
30 (assert (not (! (not (! (= 0 p_4) :named p_19)) :named p_18)))
31 (assert (not (! (not (! (= p_17 p_3) :named p_21)) :named p_20)))
32 (assert (not p_5))
33 (assert (not (! (not (! (= 0 fmt0) :named p_23)) :named p_22)))
34 (assert (not p_7))
35 (assert (not p_9))
36 (assert (not p_18))
37 (assert (not p_20))
38 (check-sat)
39 (exit)