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 (=> (and tptp.p0 (not tptp.q0)) (or tptp.r0 (not tptp.s0))))
9 (declare-fun tptp.a () $$unsorted)
10 (declare-fun tptp.b () $$unsorted)
11 (declare-fun tptp.h () $$unsorted)
12 (declare-fun tptp.f ($$unsorted) $$unsorted)
13 (declare-fun tptp.g ($$unsorted $$unsorted $$unsorted) $$unsorted)
14 (declare-fun tptp.p ($$unsorted) Bool)
15 (declare-fun tptp.q ($$unsorted $$unsorted) Bool)
16 (declare-fun tptp.r ($$unsorted $$unsorted $$unsorted) Bool)
17 (declare-fun tptp.s ($$unsorted) Bool)
18 (assert (forall ((X $$unsorted)) (=> (or (tptp.p X) (not (tptp.q X tptp.a))) (exists ((Y $$unsorted) (Z $$unsorted)) (let ((_let_1 (tptp.f Y))) (and (tptp.r X _let_1 (tptp.g X _let_1 Z)) (not (tptp.s (tptp.f (tptp.f (tptp.f tptp.b)))))))))))
19 (assert (exists ((Y $$unsorted)) (forall ((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))))))
20 (assert (or true false))
21 (declare-fun |tptp.'A proposition'| () Bool)
22 (declare-fun |tptp.'A predicate'| ($$unsorted) Bool)
23 (declare-fun |tptp.'A constant'| () $$unsorted)
24 (declare-fun |tptp.'A function'| ($$unsorted) $$unsorted)
25 (declare-fun |tptp.'A _'quoted __ escape_''| () $$unsorted)
26 (assert (or |tptp.'A proposition'| (|tptp.'A predicate'| tptp.a) (tptp.p |tptp.'A constant'|) (tptp.p (|tptp.'A function'| tptp.a)) (tptp.p |tptp.'A _'quoted __ escape_''|)))
27 (assert (forall ((X $$unsorted)) (= (=> (not (tptp.q X tptp.a)) (tptp.p X)) (exists ((Y $$unsorted) (Z $$unsorted)) (let ((_let_1 (tptp.f Y))) (xor (tptp.r X _let_1 (tptp.g X _let_1 Z)) (not (tptp.s (tptp.f (tptp.f (tptp.f tptp.b)))))))))))
28 (declare-sort tptp.new 0)
29 (declare-fun tptp.newc () tptp.new)
30 (declare-fun tptp.newf (tptp.new $$unsorted) tptp.new)
31 (declare-fun tptp.newp (tptp.new $$unsorted) Bool)
32 (assert (forall ((X tptp.new)) (tptp.newp (tptp.newf tptp.newc tptp.a) tptp.a)))
33 (assert (forall ((X $$unsorted)) (=> (or (tptp.p X) (not (tptp.q X tptp.a))) (exists ((Y $$unsorted) (Z $$unsorted)) (let ((_let_1 (tptp.f Y))) (and (tptp.r X _let_1 (tptp.g X _let_1 Z)) (not (tptp.s (tptp.f (tptp.f (tptp.f tptp.b)))))))))))
34 (assert (tptp.p tptp.h))
35 (assert (not (exists ((X $$unsorted)) (tptp.p X))))
36
37 (declare-fun tptp.ia1 () Bool)
38 (declare-fun tptp.ia2 () Bool)
39 (declare-fun tptp.ia3 () Bool)
40 (assert tptp.ia1)
41 (assert tptp.ia2)
42 (assert tptp.ia3)
43 (set-info :filename SYN000_1)
44 (check-sat-assuming ( true ))