1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
|
(* This file was originally generated by why.
It can be modified; only the generated parts will be overwritten. *)
Require Import Why.
Require Import Omega.
Proof.
unfold sorted_array; intuition.
Save.
Proof.
intuition.
assert (h: k = i).
omega.
subst result k; omega.
Save.
Proof.
intuition.
Save.
Proof.
intuition.
Save.
Proof.
intuition.
assert (h: (k < j) \/ k = j).
omega.
intuition.
apply Zle_trans with (access t0 min).
subst min0; omega.
auto with *.
subst min0 k; omega.
Save.
Proof.
intuition.
assert (h: (k < j) \/ k = j).
omega.
intuition.
subst k; omega.
Save.
Proof.
intuition.
Save.
Proof.
intuition.
Save.
Proof.
intuition.
Save.
Proof.
intuition.
ArraySubst t1.
Save.
Proof.
intuition.
ArraySubst t2.
ArraySubst t1.
assert (h: i = 0%Z \/ (0 < i)).
omega.
intuition.
replace (i0 - 1)%Z with 0%Z.
unfold sorted_array; intros; omega.
omega.
replace (i0 - 1)%Z with (i - 1 + 1)%Z.
apply right_extension.
omega.
ArraySubst t2.
ArraySubst t1.
apply sorted_array_id with t0.
assumption.
unfold array_id; intros.
subst t2; do 2 AccessOther.
replace (i - 1 + 1)%Z with i.
subst t2 t1; do 2 AccessOther.
subst result1.
auto with *.
omega.
omega.
apply permut_trans with t0.
subst t2; subst t1; subst result1 result2.
apply exchange_is_permut with min i; auto with *.
assumption.
assert (h: k = i \/ (k < i)).
omega.
intuition.
subst k.
subst t2.
AccessSame.
AccessOther.
subst t1.
assert (h: l = min \/ min <> l).
omega.
intuition.
subst l; AccessSame.
subst result1 result2; auto with *.
assert (h: l < array_length (update (update t0 min result2) i result1)).
assumption.
do 2 rewrite array_length_update in h.
AccessOther.
subst.
auto with *.
ArraySubst t1.
assert (h: i < array_length (update t0 min result2)). assumption.
rewrite array_length_update in h.
assert (h': l < array_length (update (update t0 min result2) i result1)). assumption.
do 2 rewrite array_length_update in h'.
omega.
subst.
AccessOther.
AccessOther.
AccessOther.
assert (h: l < array_length (update (update t0 min (access t0 i)) i (access t0 min))). assumption.
do 2 rewrite array_length_update in h.
assert (l = min \/ min <> l).
omega.
intuition.
subst l; AccessSame.
auto with *.
AccessOther.
auto with *.
assert (h: l < array_length (update (update t0 min (access t0 i)) i (access t0 min))). assumption.
do 2 rewrite array_length_update in h.
omega.
subst t2 t1; simpl; unfold Zwf; omega.
Save.
Proof.
intuition.
assert (i=0 \/ 0<i). omega. intuition.
unfold sorted_array; intros; omega.
replace (array_length t0 - 1)%Z with (i - 1 + 1)%Z.
apply right_extension; try omega.
assumption.
auto with *.
omega.
Qed.
(*Why type*) Definition farray: Set ->Set.
Admitted.
(*Why logic*) Definition access : forall (A1:Set), (array A1) -> Z -> A1.
Admitted.
Implicit Arguments access.
(*Why logic*) Definition update :
forall (A1:Set), (array A1) -> Z -> A1 -> (array A1).
Admitted.
Implicit Arguments update.
(*Why axiom*) Lemma access_update :
forall (A1:Set),
(forall (a:(array A1)),
(forall (i:Z), (forall (v:A1), (access (update a i v) i) = v))).
Admitted.
(*Why axiom*) Lemma access_update_neq :
forall (A1:Set),
(forall (a:(array A1)),
(forall (i:Z),
(forall (j:Z),
(forall (v:A1), (i <> j -> (access (update a i v) j) = (access a j)))))).
Admitted.
(*Why logic*) Definition array_length : forall (A1:Set), (array A1) -> Z.
Admitted.
Implicit Arguments array_length.
(*Why predicate*) Definition sorted_array (t:(array Z)) (i:Z) (j:Z)
:= (forall (k1:Z),
(forall (k2:Z),
((i <= k1 /\ k1 <= k2) /\ k2 <= j -> (access t k1) <= (access t k2)))).
(*Why predicate*) Definition exchange (A106:Set) (a1:(array A106)) (a2:(array A106)) (i:Z) (j:Z)
:= (array_length a1) = (array_length a2) /\
(access a1 i) = (access a2 j) /\ (access a2 i) = (access a1 j) /\
(forall (k:Z), (k <> i /\ k <> j -> (access a1 k) = (access a2 k))).
Implicit Arguments exchange.
(*Why logic*) Definition permut :
forall (A1:Set), (array A1) -> (array A1) -> Z -> Z -> Prop.
Admitted.
Implicit Arguments permut.
(*Why axiom*) Lemma permut_refl :
forall (A1:Set),
(forall (t:(array A1)), (forall (l:Z), (forall (u:Z), (permut t t l u)))).
Admitted.
(*Why axiom*) Lemma permut_sym :
forall (A1:Set),
(forall (t1:(array A1)),
(forall (t2:(array A1)),
(forall (l:Z), (forall (u:Z), ((permut t1 t2 l u) -> (permut t2 t1 l u)))))).
Admitted.
(*Why axiom*) Lemma permut_trans :
forall (A1:Set),
(forall (t1:(array A1)),
(forall (t2:(array A1)),
(forall (t3:(array A1)),
(forall (l:Z),
(forall (u:Z),
((permut t1 t2 l u) -> ((permut t2 t3 l u) -> (permut t1 t3 l u)))))))).
Admitted.
(*Why axiom*) Lemma permut_exchange :
forall (A1:Set),
(forall (a1:(array A1)),
(forall (a2:(array A1)),
(forall (l:Z),
(forall (u:Z),
(forall (i:Z),
(forall (j:Z),
(l <= i /\ i <= u ->
(l <= j /\ j <= u -> ((exchange a1 a2 i j) -> (permut a1 a2 l u)))))))))).
Admitted.
(*Why axiom*) Lemma exchange_upd :
forall (A1:Set),
(forall (a:(array A1)),
(forall (i:Z),
(forall (j:Z),
(exchange a (update (update a i (access a j)) j (access a i)) i j)))).
Admitted.
(*Why axiom*) Lemma permut_weakening :
forall (A1:Set),
(forall (a1:(array A1)),
(forall (a2:(array A1)),
(forall (l1:Z),
(forall (r1:Z),
(forall (l2:Z),
(forall (r2:Z),
((l1 <= l2 /\ l2 <= r2) /\ r2 <= r1 ->
((permut a1 a2 l2 r2) -> (permut a1 a2 l1 r1))))))))).
Admitted.
(*Why axiom*) Lemma permut_eq :
forall (A1:Set),
(forall (a1:(array A1)),
(forall (a2:(array A1)),
(forall (l:Z),
(forall (u:Z),
(l <= u ->
((permut a1 a2 l u) ->
(forall (i:Z), (i < l \/ u < i -> (access a2 i) = (access a1 i))))))))).
Admitted.
(*Why predicate*) Definition permutation (A115:Set) (a1:(array A115)) (a2:(array A115))
:= (permut a1 a2 0 ((array_length a1) - 1)).
Implicit Arguments permutation.
(*Why axiom*) Lemma array_length_update :
forall (A1:Set),
(forall (a:(array A1)),
(forall (i:Z),
(forall (v:A1), (array_length (update a i v)) = (array_length a)))).
Admitted.
(*Why axiom*) Lemma permut_array_length :
forall (A1:Set),
(forall (a1:(array A1)),
(forall (a2:(array A1)),
(forall (l:Z),
(forall (u:Z),
((permut a1 a2 l u) -> (array_length a1) = (array_length a2)))))).
Admitted.
|
