Debian Codegraph @

test/regress/cli/regress0/tptp/SYN000-1.smt2

raw
1 (set-logic ALL)
2 (set-info :status unsat)
3 (declare-sort $$unsorted 0)
4 (declare-fun tptp.p0 () Bool)
5 (declare-fun tptp.q0 () Bool)
6 (declare-fun tptp.r0 () Bool)
7 (declare-fun tptp.s0 () Bool)
8 (assert (or tptp.p0 (not tptp.q0) tptp.r0 (not tptp.s0)))
9 (declare-fun tptp.p ($$unsorted) Bool)
10 (declare-fun tptp.a () $$unsorted)
11 (declare-fun tptp.q ($$unsorted $$unsorted) Bool)
12 (declare-fun tptp.f ($$unsorted) $$unsorted)
13 (declare-fun tptp.g ($$unsorted $$unsorted $$unsorted) $$unsorted)
14 (declare-fun tptp.r ($$unsorted $$unsorted $$unsorted) Bool)
15 (declare-fun tptp.b () $$unsorted)
16 (declare-fun tptp.s ($$unsorted) Bool)
17 (assert (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (let ((_let_1 (tptp.f Y))) (or (tptp.p X) (not (tptp.q X tptp.a)) (tptp.r X _let_1 (tptp.g X _let_1 Z)) (not (tptp.s (tptp.f (tptp.f (tptp.f tptp.b)))))))))
18 (assert (forall ((Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (let ((_let_1 (tptp.f Y))) (or (= _let_1 (tptp.g X _let_1 Z)) (not (= (tptp.f (tptp.f (tptp.f tptp.b))) tptp.a)) (= X _let_1)))))
19 (assert (or true false))
20 (declare-fun |tptp.'A proposition'| () Bool)
21 (declare-fun |tptp.'A predicate'| ($$unsorted) Bool)
22 (declare-fun |tptp.'A constant'| () $$unsorted)
23 (declare-fun |tptp.'A function'| ($$unsorted) $$unsorted)
24 (declare-fun |tptp.'A _'quoted __ escape_''| () $$unsorted)
25 (assert (forall ((Y $$unsorted)) (or |tptp.'A proposition'| (|tptp.'A predicate'| Y) (tptp.p |tptp.'A constant'|) (tptp.p (|tptp.'A function'| tptp.a)) (tptp.p |tptp.'A _'quoted __ escape_''|))))
26 (declare-fun $$rtu (Real) $$unsorted)
27 (declare-fun $$utr ($$unsorted) Real)
28 (assert (let ((_let_1 (to_real 123))) (= _let_1 ($$utr ($$rtu _let_1)))))
29 (assert (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (let ((_let_1 (tptp.f Y))) (or (tptp.p X) (not (tptp.q X tptp.a)) (tptp.r X _let_1 (tptp.g X _let_1 Z)) (not (tptp.s (tptp.f (tptp.f (tptp.f tptp.b)))))))))
30 (declare-fun tptp.h () $$unsorted)
31 (assert (tptp.p tptp.h))
32 (assert (forall ((X $$unsorted)) (not (tptp.p X))))
33
34 (declare-fun tptp.ia1 () Bool)
35 (assert tptp.ia1)
36 (declare-fun tptp.ia2 () Bool)
37 (assert tptp.ia2)
38 (declare-fun tptp.ia3 () Bool)
39 (assert tptp.ia3)
40 (set-info :filename SYN000-1)
41 (check-sat)