Debian Codegraph @

test/regress/cli/regress0/nl/very-easy-sat.smt2

raw
1 ; COMMAND-LINE: --nl-ext=full
2 ; EXPECT: sat
3 (set-logic QF_NRA)
4 (set-info :source |
5 These benchmarks used in the paper:
6
7 Dejan Jovanovic and Leonardo de Moura. Solving Non-Linear Arithmetic.
8 In IJCAR 2012, published as LNCS volume 7364, pp. 339--354.
9
10 The meti-tarski benchmarks are proof obligations extracted from the
11 Meti-Tarski project, see:
12
13 B. Akbarpour and L. C. Paulson. MetiTarski: An automatic theorem prover
14 for real-valued special functions. Journal of Automated Reasoning,
15 44(3):175-205, 2010.
16
17 Submitted by Dejan Jovanovic for SMT-LIB.
18
19
20 |)
21 (set-info :smt-lib-version 2.6)
22 (set-info :category "industrial")
23 (set-info :status sat)
24 (declare-fun skoC () Real)
25 (declare-fun skoS () Real)
26 (declare-fun skoCB () Real)
27 (declare-fun skoSB () Real)
28 (declare-fun skoX () Real)
29 (assert (and (<= skoX (/ 177 366500000)) (and (not (<= (/ 177 366500000) skoX)) (and (= (* skoSB skoSB) (+ 1 (* skoCB (* skoCB (- 1))))) (and (= (* skoS skoS) (+ 1 (* skoC (* skoC (- 1))))) (and (<= skoX (/ 1 10000000)) (<= 0 skoX)))))))
30 (check-sat)