Debian Codegraph @

test/regress/cli/regress1/nl/nl-unk-quant.smt2

raw
1 ; COMMAND-LINE: --nl-ext=full
2 ; EXPECT: unsat
3 (set-logic UFNIA)
4 (set-info :source |Benchmarks from the paper: "Extending Sledgehammer with SMT Solvers" by Jasmin Blanchette, Sascha Bohme, and Lawrence C. Paulson, CADE 2011. Translated to SMT2 by Andrew Reynolds and Morgan Deters.|)
5 (set-info :smt-lib-version 2.6)
6 (set-info :category "industrial")
7 (set-info :status unsat)
8 (declare-sort S1 0)
9 (declare-sort S2 0)
10 (declare-sort S3 0)
11 (declare-sort S4 0)
12 (declare-fun f1 () S1)
13 (declare-fun f2 () S1)
14 (declare-fun f3 () S2)
15 (declare-fun f4 (S3 Int) S2)
16 (declare-fun f5 () S3)
17 (declare-fun f6 (S4 S2) Int)
18 (declare-fun f7 () S4)
19 (declare-fun f8 () Int)
20 (declare-fun f9 (Int) S1)
21 (declare-fun f10 () Int)
22 (declare-fun f11 () S2)
23 (assert (not (= f1 f2)))
24 (assert (let ((?v_0 (f6 f7 f3)) (?v_1 (f6 f7 f11))) (not (=> (and (= f3 (f4 f5 (- (f6 f7 (f4 f5 f8)) 1))) (= (f9 (* (+ (* 4 f10) 1) (+ 1 ?v_0))) f1)) (=> (< f8 (+ 1 ?v_1)) (=> (< 0 f8) (< ?v_0 ?v_1)))))))
25 (assert (forall ((?v0 S2)) (= (f4 f5 (f6 f7 ?v0)) ?v0)))
26 (assert (forall ((?v0 Int)) (=> (<= 0 ?v0) (= (f6 f7 (f4 f5 ?v0)) ?v0))))
27 (assert (forall ((?v0 Int)) (=> (< ?v0 0) (= (f6 f7 (f4 f5 ?v0)) 0))))
28 (check-sat)
29 (exit)