Common — library smtlib-low-level-theory.theory — module DSeqAux
171
module DSeqAux
172
use int.Int
173
use int.MinMax
174
use DSeq
175
176
function
concat
(a b:seq 'a) : seq 'a =
177
let c = extract a 0 (length a + length b) in
178
update c (length a) (length b) b
179
No proof
180
goal
length_concat
: forall a b: seq 'a. length (concat a b) = length a + length b No proof
181
goal
default_concat
: forall a b: seq 'a. default (concat a b) = (default a) No proof
182
goal
get_concat
: forall a b: seq 'a. forall j.
183
0 <= j < length a + length b -> get (concat a b) j = if 0 <= j < length a then get a j else get b (j-length a)
184
185
function
concat_complicated
(a b:seq 'a) : seq 'a =
186
let c = const (length a + length b) (default a) in
187
let d = update c 0 (length a) a in
188
let e = update d (length a) (length b) b in
189
e
190
No proof
191
lemma
length_concat_complicated
: forall a b: seq 'a.
192
length (concat_complicated a b) = length a + length b No proof
193
lemma
default_concat_complicated
: forall a b: seq 'a.
194
default (concat_complicated a b) = default a No proof
195
lemma
get_concat_complicated
: forall a b: seq 'a. forall j.
196
0 <= j < length a + length b -> get (concat_complicated a b) j = if 0 <= j < length a then get a j else get b (j-length a)
197
No proof
198
goal
concat_complicated
: forall a b: seq 'a. concat a b = concat_complicated a b
199
200
function
cons
(v:'a) (a:seq 'a) : seq 'a =
201
let c = extract a (-1) (length a + 1) in
202
set c 0 v
203
No proof
204
goal
length_cons
: forall a: seq 'a. forall v. length (cons v a) = length a + 1 No proof
205
goal
default_cons
: forall a: seq 'a. forall v. default (cons v a) = (default a) No proof
206
goal
get_cons
: forall a: seq 'a. forall v j.
207
0 <= j < length a + 1 -> get (cons v a) j = if 0 = j then v else get a (j-1)
208
209
function
cons_complicated
(v:'a) (a:seq 'a) : seq 'a =
210
let c = const (length a + 1) (default a) in
211
let d = update c 1 (length a) a in
212
let e = set d 0 v in
213
e
214
No proof
215
goal
cons_complicated
: forall a: seq 'a. forall v:'a. cons v a = cons_complicated v a
216
217
function
snoc
(v:'a) (a:seq 'a) : seq 'a =
218
let c = extract a 0 (length a + 1) in
219
set c (length a) v
220
No proof
221
goal
length_snoc
: forall a: seq 'a. forall v. length (snoc v a) = length a + 1 No proof
222
goal
default_snoc
: forall a: seq 'a. forall v. default (snoc v a) = (default a) No proof
223
goal
get_snoc
: forall a: seq 'a. forall v j.
224
0 <= j < length a + 1 -> get (snoc v a) j = if length a = j then v else get a j
225
226
function
at_
(a:seq 'a) (i:int) : seq 'a = extract a i 1
227
No proof
228
goal
length_at_
: forall a: seq 'a. forall i. length (at_ a i) = 1 No proof
229
goal
default_at_
: forall a: seq 'a. forall i. default (at_ a i) = (default a) No proof
230
goal
get_at_
: forall a: seq 'a. forall i. get (at_ a i) 0 = get a i
231
232
function
update_cvc5
(a:seq 'a) (i:int) (b:seq 'a) : seq 'a =
233
if i < 0 then a
234
else update a i (length b) b
235
No proof
236
goal
length_update_cvc5
: forall dst src: seq 'a. forall pos. length (update_cvc5 dst pos src) = length dst No proof
237
goal
default_update_cvc5
: forall dst src: seq 'a. forall pos. default (update_cvc5 dst pos src) = (default dst) No proof
238
goal
get_update_cvc5
: forall dst src: seq 'a. forall pos j.
239
0 <= j < length dst -> get (update_cvc5 dst pos src) j =
240
if pos < 0 then get dst j else if pos <= j < pos+(length src) then get src (j-pos) else get dst j
241
242
function
extract_cvc5
(x:seq 'a) (pos len:int) : seq 'a =
243
if pos < 0 then const 0 (default x)
244
else extract x pos len
245
No proof
246
goal
length_extract_cvc5
: forall x: seq 'a. forall pos len. length (extract_cvc5 x pos len) = if pos < 0 then 0 else max 0 len No proof
247
goal
default_extract_cvc5
: forall x: seq 'a. forall pos len. default (extract_cvc5 x pos len) = (default x) No proof
248
goal
get_extract_cvc5
: forall x: seq 'a. forall pos len j.
249
0 <= pos -> 0 <= j < len -> get (extract_cvc5 x pos len) j = get x (pos+j)
250
251
function
empty
(v:'a) : seq 'a =
252
const 0 v
253
No proof
254
goal
length_empty
: forall v: 'a. length (empty v) = 0 No proof
255
goal
default_empty
: forall v: 'a. default (empty v) = v No proof
256
goal
is_empty
: forall s: seq 'a. length s = 0 -> s = empty (default s)
257
258
function
unit
(v:'a) : seq 'a =
259
const 1 v
260
No proof
261
goal
length_unit
: forall v: 'a. length (unit v) = 1 No proof
262
goal
default_unit
: forall v: 'a. default (unit v) = v No proof
263
goal
get_unit
: forall v: 'a. get (unit v) 0 = v No proof
264
goal
is_unit
: forall s: seq 'a. length s = 1 -> default s = get s 0 -> s = unit (get s 0)
265
266
function
set_default
(a:seq 'a) (d:'a) : seq 'a =
267
let c = const (length a) d in
268
update c 0 (length a) a
269
No proof
270
goal
length_set_default
: forall a: seq 'a. forall d: 'a. length (set_default a d) = length a No proof
271
goal
default_set_default
: forall a: seq 'a. forall d: 'a. default (set_default a d) = d No proof
272
goal
get_set_default
: forall a: seq 'a. forall d: 'a. forall j.
273
0 <= j < length a -> get (set_default a d) j = get a j
274
end