Debian Codegraph @

test/regress/cli/regress1/proofs/alpha-eq-var-shadow-name-only.smt2

raw
1 ; EXPECT: unsat
2 (set-logic AUFLIA)
3 (declare-sort State2_behaviour$ 0)
4 (declare-sort State2$ 0)
5 (declare-sort State1$ 0)
6 (declare-sort State1_state2_bool_fun_fun$ 0)
7 (declare-sort Index$ 0)
8 (declare-sort State2_bool_fun$ 0)
9 (declare-sort Index_state1_state2_bool_fun_fun_fun$ 0)
10 (declare-sort State1_state1_bool_fun_fun$ 0)
11 (declare-sort State1_bool_fun$ 0)
12 (declare-sort State1_set$ 0)
13 (declare-sort State1_behaviour$ 0)
14 (declare-sort State2_set$ 0)
15 (declare-const thesis$ Bool)
16 (declare-const s2$ State2$)
17 (declare-const step1$ State1_state1_bool_fun_fun$)
18 (declare-const diverges$ State2_behaviour$)
19 (declare-const match$ Index_state1_state2_bool_fun_fun_fun$)
20 (declare-const s1$ State1$)
21 (declare-const bot$ State1_set$)
22 (declare-const bot$a State2_set$)
23 (declare-const diverges$a State1_behaviour$)
24 (declare-fun set_behaviour$ (State1_behaviour$) State1_set$)
25 (declare-fun fun_app$o (Index_state1_state2_bool_fun_fun_fun$ Index$) State1_state2_bool_fun_fun$)
26 (declare-fun fun_app$b (State2_bool_fun$ State2$) Bool)
27 (declare-fun fun_app$n (State1_state2_bool_fun_fun$ State1$) State2_bool_fun$)
28 (declare-fun tranclp$ (State1_state1_bool_fun_fun$) State1_state1_bool_fun_fun$)
29 (declare-fun fun_app$c (State1_bool_fun$ State1$) Bool)
30 (declare-fun fun_app$h (State1_state1_bool_fun_fun$ State1$) State1_bool_fun$)
31 (declare-fun set_behaviour$a (State2_behaviour$) State2_set$)
32 (assert (not thesis$))
33 (assert (forall ((?v0 State1$) (?v1 Index$)) (=> (and (fun_app$c (fun_app$h (tranclp$ step1$) s1$) ?v0) (fun_app$b (fun_app$n (fun_app$o match$ ?v1) ?v0) s2$)) thesis$)))
34 (assert (exists ((?v0 Index$) (?v1 State1$)) (and (fun_app$c (fun_app$h (tranclp$ step1$) s1$) ?v1) (fun_app$b (fun_app$n (fun_app$o match$ ?v0) ?v1) s2$))))
35 (assert (= (set_behaviour$ diverges$a) bot$))
36 (assert (= (set_behaviour$a diverges$) bot$a))
37 (check-sat)