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
|
(* This file was originally generated by why.
It can be modified; only the generated parts will be overwritten. *)
Require Export Why.
Require Export ZArithRing.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_1 :
forall (n: Z),
forall (HW_1: n >= 0),
0 >= 0.
Proof.
intuition.
Save.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_2 :
forall (n: Z),
forall (HW_1: n >= 0),
n >= (0 * 0).
Proof.
intuition.
Save.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_3 :
forall (n: Z),
forall (HW_1: n >= 0),
1 = ((0 + 1) * (0 + 1)).
Proof.
intuition.
Save.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_4 :
forall (n: Z),
forall (HW_1: n >= 0),
forall (HW_2: 0 >= 0 /\ n >= (0 * 0) /\ 1 = ((0 + 1) * (0 + 1))),
forall (count: Z),
forall (sum: Z),
forall (HW_3: count >= 0 /\ n >= (count * count) /\ sum =
((count + 1) * (count + 1))),
forall (HW_4: sum <= n),
forall (count0: Z),
forall (HW_5: count0 = (count + 1)),
forall (sum0: Z),
forall (HW_6: sum0 = (sum + 2 * count0 + 1)),
count0 >= 0.
Proof.
intuition.
Save.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_5 :
forall (n: Z),
forall (HW_1: n >= 0),
forall (HW_2: 0 >= 0 /\ n >= (0 * 0) /\ 1 = ((0 + 1) * (0 + 1))),
forall (count: Z),
forall (sum: Z),
forall (HW_3: count >= 0 /\ n >= (count * count) /\ sum =
((count + 1) * (count + 1))),
forall (HW_4: sum <= n),
forall (count0: Z),
forall (HW_5: count0 = (count + 1)),
forall (sum0: Z),
forall (HW_6: sum0 = (sum + 2 * count0 + 1)),
n >= (count0 * count0).
Proof.
intuition.
apply Zge_trans with sum; intuition.
subst count0; intuition.
Save.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_6 :
forall (n: Z),
forall (HW_1: n >= 0),
forall (HW_2: 0 >= 0 /\ n >= (0 * 0) /\ 1 = ((0 + 1) * (0 + 1))),
forall (count: Z),
forall (sum: Z),
forall (HW_3: count >= 0 /\ n >= (count * count) /\ sum =
((count + 1) * (count + 1))),
forall (HW_4: sum <= n),
forall (count0: Z),
forall (HW_5: count0 = (count + 1)),
forall (sum0: Z),
forall (HW_6: sum0 = (sum + 2 * count0 + 1)),
sum0 = ((count0 + 1) * (count0 + 1)).
Proof.
intuition.
subst sum0 count0 sum; ring.
Save.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_7 :
forall (n: Z),
forall (HW_1: n >= 0),
forall (HW_2: 0 >= 0 /\ n >= (0 * 0) /\ 1 = ((0 + 1) * (0 + 1))),
forall (count: Z),
forall (sum: Z),
forall (HW_3: count >= 0 /\ n >= (count * count) /\ sum =
((count + 1) * (count + 1))),
forall (HW_4: sum <= n),
forall (count0: Z),
forall (HW_5: count0 = (count + 1)),
forall (sum0: Z),
forall (HW_6: sum0 = (sum + 2 * count0 + 1)),
0 <= (n - sum).
Proof.
intuition.
Save.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_8 :
forall (n: Z),
forall (HW_1: n >= 0),
forall (HW_2: 0 >= 0 /\ n >= (0 * 0) /\ 1 = ((0 + 1) * (0 + 1))),
forall (count: Z),
forall (sum: Z),
forall (HW_3: count >= 0 /\ n >= (count * count) /\ sum =
((count + 1) * (count + 1))),
forall (HW_4: sum <= n),
forall (count0: Z),
forall (HW_5: count0 = (count + 1)),
forall (sum0: Z),
forall (HW_6: sum0 = (sum + 2 * count0 + 1)),
(n - sum0) < (n - sum).
Proof.
intuition.
Save.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_9 :
forall (n: Z),
forall (HW_1: n >= 0),
forall (HW_2: 0 >= 0 /\ n >= (0 * 0) /\ 1 = ((0 + 1) * (0 + 1))),
forall (count: Z),
forall (sum: Z),
forall (HW_3: count >= 0 /\ n >= (count * count) /\ sum =
((count + 1) * (count + 1))),
forall (HW_7: sum > n),
(count * count) <= n.
Proof.
intuition.
Save.
(* Why obligation from file "", line 0, characters 0-0: *)
(*Why goal*) Lemma sqrt_po_10 :
forall (n: Z),
forall (HW_1: n >= 0),
forall (HW_2: 0 >= 0 /\ n >= (0 * 0) /\ 1 = ((0 + 1) * (0 + 1))),
forall (count: Z),
forall (sum: Z),
forall (HW_3: count >= 0 /\ n >= (count * count) /\ sum =
((count + 1) * (count + 1))),
forall (HW_7: sum > n),
n < ((count + 1) * (count + 1)).
Proof.
intuition.
Save.
|
