Debian Codegraph @

test/regress/cli/regress1/abduction/sygus-abduct-test-user.smt2

raw
1 ; COMMAND-LINE: --produce-abducts
2 ; COMMAND-LINE: --produce-abducts --sygus-core-connective
3 ; SCRUBBER: grep -v -E '(\(define-fun)'
4 ; EXIT: 0
5 (set-logic QF_UFLIRA)
6 (set-option :produce-abducts true)
7 (declare-fun n () Int)
8 (declare-fun m () Int)
9 (declare-fun x () Int)
10 (declare-fun y () Int)
11
12 (assert (>= n 1))
13 (assert (and (<= n x)(<= x (+ n 5))))
14 (assert (and (<= 1 y)(<= y m)))
15
16 ; Generate a predicate A that is consistent with the above axioms (i.e.
17 ; their conjunction is SAT), and is such that the conjunction of the above
18 ; axioms, A and the negation of the conjecture below are UNSAT.
19 ; The signature of A is below grammar.
20 (get-abduct A (not (< x y))
21
22 ; the grammar for the abduct-to-synthesize
23 ; notice it does not permit the sygus-core-connective algorithm; this regression
24 ; tests that we ignore this option properly.
25 ((Start Bool) (StartInt Int))
26 (
27 (Start Bool ((< StartInt StartInt)))
28 (StartInt Int (n m (+ StartInt StartInt) 0 1))
29 )
30
31 )