Debian Codegraph @

test/regress/cli/regress1/ho/sev428-mbqi.smt2

raw
1 ; COMMAND-LINE: --mbqi
2 ; EXPECT: unsat
3 (set-logic HO_ALL)
4 (declare-sort $$unsorted 0)
5 (declare-fun tptp.eps ((-> $$unsorted Bool)) $$unsorted)
6 (assert (forall ((P (-> $$unsorted Bool))) (=> (exists ((X $$unsorted)) (@ P X)) (@ P (@ tptp.eps P)))))
7 (declare-fun tptp.epsio ((-> (-> $$unsorted Bool) Bool) $$unsorted) Bool)
8 (assert (forall ((P (-> (-> $$unsorted Bool) Bool))) (=> (exists ((X (-> $$unsorted Bool))) (@ P X)) (@ P (@ tptp.epsio P)))))
9 (declare-fun tptp.setunion ((-> (-> $$unsorted Bool) Bool) $$unsorted) Bool)
10 (assert (= tptp.setunion (lambda ((C (-> (-> $$unsorted Bool) Bool)) (X $$unsorted)) (exists ((Y (-> $$unsorted Bool))) (and (@ C Y) (@ Y X))))))
11 (declare-fun tptp.choosenonempty ((-> (-> $$unsorted Bool) Bool) $$unsorted) Bool)
12 (assert (= tptp.choosenonempty (lambda ((C (-> (-> $$unsorted Bool) Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.epsio (lambda ((Y (-> $$unsorted Bool))) (and (@ C Y) (@ Y (@ tptp.eps Y))))) __flatten_var_0))))
13 (declare-fun tptp.c ((-> $$unsorted Bool)) Bool)
14 (declare-fun tptp.a () $$unsorted)
15 (assert (@ (@ tptp.setunion tptp.c) tptp.a))
16 (assert (not (and (@ tptp.c (@ tptp.choosenonempty tptp.c)) (exists ((X $$unsorted)) (@ (@ tptp.choosenonempty tptp.c) X)))))
17 (set-info :filename SEV428^1)
18 (check-sat-assuming ( true ))