test/regress/cli/regress1/fmf/fc-pigeonhole19.smt2
raw| 1 | (set-logic UFC) |
| 2 | (set-info :status unsat) |
| 3 | |
| 4 | (declare-sort P 0) |
| 5 | (declare-sort H 0) |
| 6 | |
| 7 | (declare-fun p () P) |
| 8 | (declare-fun h () H) |
| 9 | |
| 10 | ; pigeonhole using native cardinality constraints |
| 11 | (assert (_ fmf.card P 19)) |
| 12 | (assert (not (_ fmf.card P 18))) |
| 13 | (assert (_ fmf.card H 18)) |
| 14 | (assert (not (_ fmf.card H 17))) |
| 15 | |
| 16 | ; each pigeon has different holes |
| 17 | (declare-fun f (P) H) |
| 18 | (assert (forall ((p1 P) (p2 P)) (=> (not (= p1 p2)) (not (= (f p1) (f p2)))))) |
| 19 | |
| 20 | (check-sat) |