| 1 |
(set-logic QF_AX) |
| 2 |
(set-info :source | |
| 3 |
Benchmarks used in the followin paper: |
| 4 |
Big proof engines as little proof engines: new results on rewrite-based satisfiability procedure |
| 5 |
Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz. |
| 6 |
PDPAR'05 |
| 7 |
http://www.ai.dist.unige.it/pdpar05/ |
| 8 |
|
| 9 |
|
| 10 |
|) |
| 11 |
(set-info :smt-lib-version 2.6) |
| 12 |
(set-info :category "crafted") |
| 13 |
(set-info :status unsat) |
| 14 |
(declare-sort Index 0) |
| 15 |
(declare-sort Element 0) |
| 16 |
(declare-fun a1 () (Array Index Element)) |
| 17 |
(declare-fun i0 () Index) |
| 18 |
(declare-fun i1 () Index) |
| 19 |
(assert (let ((?v_0 (select a1 i1))) (let ((?v_1 (store (store a1 i1 ?v_0) i1 ?v_0))) (let ((?v_2 (select ?v_1 i0))) (let ((?v_3 (store (store ?v_1 i0 ?v_2) i0 ?v_2))) (not (= ?v_3 ?v_3))))))) |
| 20 |
(check-sat) |
| 21 |
(exit) |