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
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
|
(**************************************************************************)
(* *)
(* SMTCoq *)
(* Copyright (C) 2011 - 2016 *)
(* *)
(* Michaël Armand *)
(* Benjamin Grégoire *)
(* Chantal Keller *)
(* *)
(* Inria - École Polytechnique - Université Paris-Sud *)
(* *)
(* This file is distributed under the terms of the CeCILL-C licence *)
(* *)
(**************************************************************************)
type __ = Obj.t
type unit0 =
| Tt
val implb : bool -> bool -> bool
val xorb : bool -> bool -> bool
val negb : bool -> bool
type nat =
| O
| S of nat
type 'a option =
| Some of 'a
| None
val option_map : ('a1 -> 'a2) -> 'a1 option -> 'a2 option
val fst : ('a1*'a2) -> 'a1
val snd : ('a1*'a2) -> 'a2
type 'a list =
| Nil
| Cons of 'a * 'a list
val app : 'a1 list -> 'a1 list -> 'a1 list
val compOpp : ExtrNative.comparison -> ExtrNative.comparison
type compareSpecT =
| CompEqT
| CompLtT
| CompGtT
val compareSpec2Type : ExtrNative.comparison -> compareSpecT
type 'a compSpecT = compareSpecT
val compSpec2Type : 'a1 -> 'a1 -> ExtrNative.comparison -> 'a1 compSpecT
type 'a sig0 =
'a
(* singleton inductive, whose constructor was exist *)
type sumbool =
| Left
| Right
type 'a sumor =
| Inleft of 'a
| Inright
val plus : nat -> nat -> nat
val nat_iter : nat -> ('a1 -> 'a1) -> 'a1 -> 'a1
type positive =
| XI of positive
| XO of positive
| XH
type n =
| N0
| Npos of positive
type z =
| Z0
| Zpos of positive
| Zneg of positive
val eqb : bool -> bool -> bool
type reflect =
| ReflectT
| ReflectF
val iff_reflect : bool -> reflect
module type TotalOrder' =
sig
type t
end
module MakeOrderTac :
functor (O:TotalOrder') ->
sig
end
module MaxLogicalProperties :
functor (O:TotalOrder') ->
functor (M:sig
val max : O.t -> O.t -> O.t
end) ->
sig
module Private_Tac :
sig
end
end
module Pos :
sig
type t = positive
val succ : positive -> positive
val add : positive -> positive -> positive
val add_carry : positive -> positive -> positive
val pred_double : positive -> positive
val pred : positive -> positive
val pred_N : positive -> n
type mask =
| IsNul
| IsPos of positive
| IsNeg
val mask_rect : 'a1 -> (positive -> 'a1) -> 'a1 -> mask -> 'a1
val mask_rec : 'a1 -> (positive -> 'a1) -> 'a1 -> mask -> 'a1
val succ_double_mask : mask -> mask
val double_mask : mask -> mask
val double_pred_mask : positive -> mask
val pred_mask : mask -> mask
val sub_mask : positive -> positive -> mask
val sub_mask_carry : positive -> positive -> mask
val sub : positive -> positive -> positive
val mul : positive -> positive -> positive
val iter : positive -> ('a1 -> 'a1) -> 'a1 -> 'a1
val pow : positive -> positive -> positive
val square : positive -> positive
val div2 : positive -> positive
val div2_up : positive -> positive
val size_nat : positive -> nat
val size : positive -> positive
val compare_cont :
positive -> positive -> ExtrNative.comparison -> ExtrNative.comparison
val compare : positive -> positive -> ExtrNative.comparison
val min : positive -> positive -> positive
val max : positive -> positive -> positive
val eqb : positive -> positive -> bool
val leb : positive -> positive -> bool
val ltb : positive -> positive -> bool
val sqrtrem_step :
(positive -> positive) -> (positive -> positive) -> (positive*mask) ->
positive*mask
val sqrtrem : positive -> positive*mask
val sqrt : positive -> positive
val gcdn : nat -> positive -> positive -> positive
val gcd : positive -> positive -> positive
val ggcdn : nat -> positive -> positive -> positive*(positive*positive)
val ggcd : positive -> positive -> positive*(positive*positive)
val coq_Nsucc_double : n -> n
val coq_Ndouble : n -> n
val coq_lor : positive -> positive -> positive
val coq_land : positive -> positive -> n
val ldiff : positive -> positive -> n
val coq_lxor : positive -> positive -> n
val shiftl_nat : positive -> nat -> positive
val shiftr_nat : positive -> nat -> positive
val shiftl : positive -> n -> positive
val shiftr : positive -> n -> positive
val testbit_nat : positive -> nat -> bool
val testbit : positive -> n -> bool
val iter_op : ('a1 -> 'a1 -> 'a1) -> positive -> 'a1 -> 'a1
val to_nat : positive -> nat
val of_nat : nat -> positive
val of_succ_nat : nat -> positive
end
module Coq_Pos :
sig
module Coq__1 : sig
type t = positive
end
type t = Coq__1.t
val succ : positive -> positive
val add : positive -> positive -> positive
val add_carry : positive -> positive -> positive
val pred_double : positive -> positive
val pred : positive -> positive
val pred_N : positive -> n
type mask = Pos.mask =
| IsNul
| IsPos of positive
| IsNeg
val mask_rect : 'a1 -> (positive -> 'a1) -> 'a1 -> mask -> 'a1
val mask_rec : 'a1 -> (positive -> 'a1) -> 'a1 -> mask -> 'a1
val succ_double_mask : mask -> mask
val double_mask : mask -> mask
val double_pred_mask : positive -> mask
val pred_mask : mask -> mask
val sub_mask : positive -> positive -> mask
val sub_mask_carry : positive -> positive -> mask
val sub : positive -> positive -> positive
val mul : positive -> positive -> positive
val iter : positive -> ('a1 -> 'a1) -> 'a1 -> 'a1
val pow : positive -> positive -> positive
val square : positive -> positive
val div2 : positive -> positive
val div2_up : positive -> positive
val size_nat : positive -> nat
val size : positive -> positive
val compare_cont :
positive -> positive -> ExtrNative.comparison -> ExtrNative.comparison
val compare : positive -> positive -> ExtrNative.comparison
val min : positive -> positive -> positive
val max : positive -> positive -> positive
val eqb : positive -> positive -> bool
val leb : positive -> positive -> bool
val ltb : positive -> positive -> bool
val sqrtrem_step :
(positive -> positive) -> (positive -> positive) -> (positive*mask) ->
positive*mask
val sqrtrem : positive -> positive*mask
val sqrt : positive -> positive
val gcdn : nat -> positive -> positive -> positive
val gcd : positive -> positive -> positive
val ggcdn : nat -> positive -> positive -> positive*(positive*positive)
val ggcd : positive -> positive -> positive*(positive*positive)
val coq_Nsucc_double : n -> n
val coq_Ndouble : n -> n
val coq_lor : positive -> positive -> positive
val coq_land : positive -> positive -> n
val ldiff : positive -> positive -> n
val coq_lxor : positive -> positive -> n
val shiftl_nat : positive -> nat -> positive
val shiftr_nat : positive -> nat -> positive
val shiftl : positive -> n -> positive
val shiftr : positive -> n -> positive
val testbit_nat : positive -> nat -> bool
val testbit : positive -> n -> bool
val iter_op : ('a1 -> 'a1 -> 'a1) -> positive -> 'a1 -> 'a1
val to_nat : positive -> nat
val of_nat : nat -> positive
val of_succ_nat : nat -> positive
val eq_dec : positive -> positive -> sumbool
val peano_rect : 'a1 -> (positive -> 'a1 -> 'a1) -> positive -> 'a1
val peano_rec : 'a1 -> (positive -> 'a1 -> 'a1) -> positive -> 'a1
type coq_PeanoView =
| PeanoOne
| PeanoSucc of positive * coq_PeanoView
val coq_PeanoView_rect :
'a1 -> (positive -> coq_PeanoView -> 'a1 -> 'a1) -> positive ->
coq_PeanoView -> 'a1
val coq_PeanoView_rec :
'a1 -> (positive -> coq_PeanoView -> 'a1 -> 'a1) -> positive ->
coq_PeanoView -> 'a1
val peanoView_xO : positive -> coq_PeanoView -> coq_PeanoView
val peanoView_xI : positive -> coq_PeanoView -> coq_PeanoView
val peanoView : positive -> coq_PeanoView
val coq_PeanoView_iter :
'a1 -> (positive -> 'a1 -> 'a1) -> positive -> coq_PeanoView -> 'a1
val eqb_spec : positive -> positive -> reflect
val switch_Eq :
ExtrNative.comparison -> ExtrNative.comparison -> ExtrNative.comparison
val mask2cmp : mask -> ExtrNative.comparison
val leb_spec0 : positive -> positive -> reflect
val ltb_spec0 : positive -> positive -> reflect
module Private_Tac :
sig
end
module Private_Rev :
sig
module ORev :
sig
type t = Coq__1.t
end
module MRev :
sig
val max : t -> t -> t
end
module MPRev :
sig
module Private_Tac :
sig
end
end
end
module Private_Dec :
sig
val max_case_strong :
t -> t -> (t -> t -> __ -> 'a1 -> 'a1) -> (__ -> 'a1) -> (__ -> 'a1) ->
'a1
val max_case :
t -> t -> (t -> t -> __ -> 'a1 -> 'a1) -> 'a1 -> 'a1 -> 'a1
val max_dec : t -> t -> sumbool
val min_case_strong :
t -> t -> (t -> t -> __ -> 'a1 -> 'a1) -> (__ -> 'a1) -> (__ -> 'a1) ->
'a1
val min_case :
t -> t -> (t -> t -> __ -> 'a1 -> 'a1) -> 'a1 -> 'a1 -> 'a1
val min_dec : t -> t -> sumbool
end
val max_case_strong : t -> t -> (__ -> 'a1) -> (__ -> 'a1) -> 'a1
val max_case : t -> t -> 'a1 -> 'a1 -> 'a1
val max_dec : t -> t -> sumbool
val min_case_strong : t -> t -> (__ -> 'a1) -> (__ -> 'a1) -> 'a1
val min_case : t -> t -> 'a1 -> 'a1 -> 'a1
val min_dec : t -> t -> sumbool
end
module N :
sig
type t = n
val zero : n
val one : n
val two : n
val succ_double : n -> n
val double : n -> n
val succ : n -> n
val pred : n -> n
val succ_pos : n -> positive
val add : n -> n -> n
val sub : n -> n -> n
val mul : n -> n -> n
val compare : n -> n -> ExtrNative.comparison
val eqb : n -> n -> bool
val leb : n -> n -> bool
val ltb : n -> n -> bool
val min : n -> n -> n
val max : n -> n -> n
val div2 : n -> n
val even : n -> bool
val odd : n -> bool
val pow : n -> n -> n
val square : n -> n
val log2 : n -> n
val size : n -> n
val size_nat : n -> nat
val pos_div_eucl : positive -> n -> n*n
val div_eucl : n -> n -> n*n
val div : n -> n -> n
val modulo : n -> n -> n
val gcd : n -> n -> n
val ggcd : n -> n -> n*(n*n)
val sqrtrem : n -> n*n
val sqrt : n -> n
val coq_lor : n -> n -> n
val coq_land : n -> n -> n
val ldiff : n -> n -> n
val coq_lxor : n -> n -> n
val shiftl_nat : n -> nat -> n
val shiftr_nat : n -> nat -> n
val shiftl : n -> n -> n
val shiftr : n -> n -> n
val testbit_nat : n -> nat -> bool
val testbit : n -> n -> bool
val to_nat : n -> nat
val of_nat : nat -> n
val iter : n -> ('a1 -> 'a1) -> 'a1 -> 'a1
val eq_dec : n -> n -> sumbool
val discr : n -> positive sumor
val binary_rect : 'a1 -> (n -> 'a1 -> 'a1) -> (n -> 'a1 -> 'a1) -> n -> 'a1
val binary_rec : 'a1 -> (n -> 'a1 -> 'a1) -> (n -> 'a1 -> 'a1) -> n -> 'a1
val peano_rect : 'a1 -> (n -> 'a1 -> 'a1) -> n -> 'a1
val peano_rec : 'a1 -> (n -> 'a1 -> 'a1) -> n -> 'a1
val leb_spec0 : n -> n -> reflect
val ltb_spec0 : n -> n -> reflect
module Private_BootStrap :
sig
end
val recursion : 'a1 -> (n -> 'a1 -> 'a1) -> n -> 'a1
module Private_OrderTac :
sig
module Elts :
sig
type t = n
end
module Tac :
sig
end
end
module Private_NZPow :
sig
end
module Private_NZSqrt :
sig
end
val sqrt_up : n -> n
val log2_up : n -> n
module Private_NZDiv :
sig
end
val lcm : n -> n -> n
val eqb_spec : n -> n -> reflect
val b2n : bool -> n
val setbit : n -> n -> n
val clearbit : n -> n -> n
val ones : n -> n
val lnot : n -> n -> n
module Private_Tac :
sig
end
module Private_Rev :
sig
module ORev :
sig
type t = n
end
module MRev :
sig
val max : n -> n -> n
end
module MPRev :
sig
module Private_Tac :
sig
end
end
end
module Private_Dec :
sig
val max_case_strong :
n -> n -> (n -> n -> __ -> 'a1 -> 'a1) -> (__ -> 'a1) -> (__ -> 'a1) ->
'a1
val max_case :
n -> n -> (n -> n -> __ -> 'a1 -> 'a1) -> 'a1 -> 'a1 -> 'a1
val max_dec : n -> n -> sumbool
val min_case_strong :
n -> n -> (n -> n -> __ -> 'a1 -> 'a1) -> (__ -> 'a1) -> (__ -> 'a1) ->
'a1
val min_case :
n -> n -> (n -> n -> __ -> 'a1 -> 'a1) -> 'a1 -> 'a1 -> 'a1
val min_dec : n -> n -> sumbool
end
val max_case_strong : n -> n -> (__ -> 'a1) -> (__ -> 'a1) -> 'a1
val max_case : n -> n -> 'a1 -> 'a1 -> 'a1
val max_dec : n -> n -> sumbool
val min_case_strong : n -> n -> (__ -> 'a1) -> (__ -> 'a1) -> 'a1
val min_case : n -> n -> 'a1 -> 'a1 -> 'a1
val min_dec : n -> n -> sumbool
end
module Z :
sig
type t = z
val zero : z
val one : z
val two : z
val double : z -> z
val succ_double : z -> z
val pred_double : z -> z
val pos_sub : positive -> positive -> z
val add : z -> z -> z
val opp : z -> z
val succ : z -> z
val pred : z -> z
val sub : z -> z -> z
val mul : z -> z -> z
val pow_pos : z -> positive -> z
val pow : z -> z -> z
val square : z -> z
val compare : z -> z -> ExtrNative.comparison
val sgn : z -> z
val leb : z -> z -> bool
val ltb : z -> z -> bool
val geb : z -> z -> bool
val gtb : z -> z -> bool
val eqb : z -> z -> bool
val max : z -> z -> z
val min : z -> z -> z
val abs : z -> z
val abs_nat : z -> nat
val abs_N : z -> n
val to_nat : z -> nat
val to_N : z -> n
val of_nat : nat -> z
val of_N : n -> z
val iter : z -> ('a1 -> 'a1) -> 'a1 -> 'a1
val pos_div_eucl : positive -> z -> z*z
val div_eucl : z -> z -> z*z
val div : z -> z -> z
val modulo : z -> z -> z
val quotrem : z -> z -> z*z
val quot : z -> z -> z
val rem : z -> z -> z
val even : z -> bool
val odd : z -> bool
val div2 : z -> z
val quot2 : z -> z
val log2 : z -> z
val sqrtrem : z -> z*z
val sqrt : z -> z
val gcd : z -> z -> z
val ggcd : z -> z -> z*(z*z)
val testbit : z -> z -> bool
val shiftl : z -> z -> z
val shiftr : z -> z -> z
val coq_lor : z -> z -> z
val coq_land : z -> z -> z
val ldiff : z -> z -> z
val coq_lxor : z -> z -> z
val eq_dec : z -> z -> sumbool
module Private_BootStrap :
sig
end
val leb_spec0 : z -> z -> reflect
val ltb_spec0 : z -> z -> reflect
module Private_OrderTac :
sig
module Elts :
sig
type t = z
end
module Tac :
sig
end
end
val sqrt_up : z -> z
val log2_up : z -> z
module Private_NZDiv :
sig
end
module Private_Div :
sig
module Quot2Div :
sig
val div : z -> z -> z
val modulo : z -> z -> z
end
module NZQuot :
sig
end
end
val lcm : z -> z -> z
val eqb_spec : z -> z -> reflect
val b2z : bool -> z
val setbit : z -> z -> z
val clearbit : z -> z -> z
val lnot : z -> z
val ones : z -> z
module Private_Tac :
sig
end
module Private_Rev :
sig
module ORev :
sig
type t = z
end
module MRev :
sig
val max : z -> z -> z
end
module MPRev :
sig
module Private_Tac :
sig
end
end
end
module Private_Dec :
sig
val max_case_strong :
z -> z -> (z -> z -> __ -> 'a1 -> 'a1) -> (__ -> 'a1) -> (__ -> 'a1) ->
'a1
val max_case :
z -> z -> (z -> z -> __ -> 'a1 -> 'a1) -> 'a1 -> 'a1 -> 'a1
val max_dec : z -> z -> sumbool
val min_case_strong :
z -> z -> (z -> z -> __ -> 'a1 -> 'a1) -> (__ -> 'a1) -> (__ -> 'a1) ->
'a1
val min_case :
z -> z -> (z -> z -> __ -> 'a1 -> 'a1) -> 'a1 -> 'a1 -> 'a1
val min_dec : z -> z -> sumbool
end
val max_case_strong : z -> z -> (__ -> 'a1) -> (__ -> 'a1) -> 'a1
val max_case : z -> z -> 'a1 -> 'a1 -> 'a1
val max_dec : z -> z -> sumbool
val min_case_strong : z -> z -> (__ -> 'a1) -> (__ -> 'a1) -> 'a1
val min_case : z -> z -> 'a1 -> 'a1 -> 'a1
val min_dec : z -> z -> sumbool
end
val zeq_bool : z -> z -> bool
val nth : nat -> 'a1 list -> 'a1 -> 'a1
val map : ('a1 -> 'a2) -> 'a1 list -> 'a2 list
val fold_right : ('a2 -> 'a1 -> 'a1) -> 'a1 -> 'a2 list -> 'a1
val existsb : ('a1 -> bool) -> 'a1 list -> bool
val forallb : ('a1 -> bool) -> 'a1 list -> bool
type int = ExtrNative.uint
val lsl0 : int -> int -> int
val lsr0 : int -> int -> int
val land0 : int -> int -> int
val lxor0 : int -> int -> int
val sub0 : int -> int -> int
val eqb0 : int -> int -> bool
val ltb0 : int -> int -> bool
val leb0 : int -> int -> bool
val foldi_cont :
(int -> ('a1 -> 'a2) -> 'a1 -> 'a2) -> int -> int -> ('a1 -> 'a2) -> 'a1 ->
'a2
val foldi_down_cont :
(int -> ('a1 -> 'a2) -> 'a1 -> 'a2) -> int -> int -> ('a1 -> 'a2) -> 'a1 ->
'a2
val is_zero : int -> bool
val is_even : int -> bool
val compare0 : int -> int -> ExtrNative.comparison
val foldi : (int -> 'a1 -> 'a1) -> int -> int -> 'a1 -> 'a1
val fold : ('a1 -> 'a1) -> int -> int -> 'a1 -> 'a1
val foldi_down : (int -> 'a1 -> 'a1) -> int -> int -> 'a1 -> 'a1
val forallb0 : (int -> bool) -> int -> int -> bool
val existsb0 : (int -> bool) -> int -> int -> bool
val cast : int -> int -> (__ -> __ -> __) option
val reflect_eqb : int -> int -> reflect
type 'a array = 'a ExtrNative.parray
val make : int -> 'a1 -> 'a1 array
val get : 'a1 array -> int -> 'a1
val default : 'a1 array -> 'a1
val set : 'a1 array -> int -> 'a1 -> 'a1 array
val length : 'a1 array -> int
val to_list : 'a1 array -> 'a1 list
val forallbi : (int -> 'a1 -> bool) -> 'a1 array -> bool
val forallb1 : ('a1 -> bool) -> 'a1 array -> bool
val existsb1 : ('a1 -> bool) -> 'a1 array -> bool
val mapi : (int -> 'a1 -> 'a2) -> 'a1 array -> 'a2 array
val foldi_left : (int -> 'a1 -> 'a2 -> 'a1) -> 'a1 -> 'a2 array -> 'a1
val fold_left : ('a1 -> 'a2 -> 'a1) -> 'a1 -> 'a2 array -> 'a1
val foldi_right : (int -> 'a1 -> 'a2 -> 'a2) -> 'a1 array -> 'a2 -> 'a2
module Valuation :
sig
type t = int -> bool
end
module Var :
sig
val _true : int
val _false : int
val interp : Valuation.t -> int -> bool
end
module Lit :
sig
val is_pos : int -> bool
val blit : int -> int
val lit : int -> int
val neg : int -> int
val nlit : int -> int
val _true : int
val _false : int
val eqb : int -> int -> bool
val interp : Valuation.t -> int -> bool
end
module C :
sig
type t = int list
val interp : Valuation.t -> t -> bool
val _true : t
val is_false : t -> bool
val or_aux : (t -> t -> t) -> int -> t -> t -> int list
val coq_or : t -> t -> t
val resolve_aux : (t -> t -> t) -> int -> t -> t -> t
val resolve : t -> t -> t
end
module S :
sig
type t = C.t array
val get : t -> int -> C.t
val internal_set : t -> int -> C.t -> t
val make : int -> t
val insert : int -> int list -> int list
val sort_uniq : int list -> int list
val set_clause : t -> int -> C.t -> t
val set_resolve : t -> int -> int array -> t
end
val afold_left :
'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a2 -> 'a1) -> 'a2 array -> 'a1
val afold_right :
'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a2 -> 'a1) -> 'a2 array -> 'a1
val rev_aux : 'a1 list -> 'a1 list -> 'a1 list
val rev : 'a1 list -> 'a1 list
val distinct_aux2 : ('a1 -> 'a1 -> bool) -> bool -> 'a1 -> 'a1 list -> bool
val distinct_aux : ('a1 -> 'a1 -> bool) -> bool -> 'a1 list -> bool
val distinct : ('a1 -> 'a1 -> bool) -> 'a1 list -> bool
val forallb2 : ('a1 -> 'a2 -> bool) -> 'a1 list -> 'a2 list -> bool
module Form :
sig
type form =
| Fatom of int
| Ftrue
| Ffalse
| Fnot2 of int * int
| Fand of int array
| For of int array
| Fimp of int array
| Fxor of int * int
| Fiff of int * int
| Fite of int * int * int
val form_rect :
(int -> 'a1) -> 'a1 -> 'a1 -> (int -> int -> 'a1) -> (int array -> 'a1)
-> (int array -> 'a1) -> (int array -> 'a1) -> (int -> int -> 'a1) ->
(int -> int -> 'a1) -> (int -> int -> int -> 'a1) -> form -> 'a1
val form_rec :
(int -> 'a1) -> 'a1 -> 'a1 -> (int -> int -> 'a1) -> (int array -> 'a1)
-> (int array -> 'a1) -> (int array -> 'a1) -> (int -> int -> 'a1) ->
(int -> int -> 'a1) -> (int -> int -> int -> 'a1) -> form -> 'a1
val is_Ftrue : form -> bool
val is_Ffalse : form -> bool
val interp_aux : (int -> bool) -> (int -> bool) -> form -> bool
val t_interp : (int -> bool) -> form array -> bool array
val lt_form : int -> form -> bool
val wf : form array -> bool
val interp_state_var : (int -> bool) -> form array -> int -> bool
val interp : (int -> bool) -> form array -> form -> bool
val check_form : form array -> bool
end
type typ_eqb = { te_eqb : (__ -> __ -> bool);
te_reflect : (__ -> __ -> reflect) }
type te_carrier = __
val te_eqb : typ_eqb -> te_carrier -> te_carrier -> bool
module Typ :
sig
type coq_type =
| Tindex of int
| TZ
| Tbool
| Tpositive
val type_rect : (int -> 'a1) -> 'a1 -> 'a1 -> 'a1 -> coq_type -> 'a1
val type_rec : (int -> 'a1) -> 'a1 -> 'a1 -> 'a1 -> coq_type -> 'a1
type ftype = coq_type list*coq_type
type interp = __
type interp_ftype = __
val i_eqb : typ_eqb array -> coq_type -> interp -> interp -> bool
val reflect_i_eqb :
typ_eqb array -> coq_type -> interp -> interp -> reflect
type cast_result =
| Cast of (__ -> __ -> __)
| NoCast
val cast_result_rect :
coq_type -> coq_type -> ((__ -> __ -> __) -> 'a1) -> 'a1 -> cast_result
-> 'a1
val cast_result_rec :
coq_type -> coq_type -> ((__ -> __ -> __) -> 'a1) -> 'a1 -> cast_result
-> 'a1
val cast : coq_type -> coq_type -> cast_result
val eqb : coq_type -> coq_type -> bool
val reflect_eqb : coq_type -> coq_type -> reflect
end
val list_beq : ('a1 -> 'a1 -> bool) -> 'a1 list -> 'a1 list -> bool
val reflect_list_beq :
('a1 -> 'a1 -> bool) -> ('a1 -> 'a1 -> reflect) -> 'a1 list -> 'a1 list ->
reflect
module Atom :
sig
type cop =
| CO_xH
| CO_Z0
val cop_rect : 'a1 -> 'a1 -> cop -> 'a1
val cop_rec : 'a1 -> 'a1 -> cop -> 'a1
type unop =
| UO_xO
| UO_xI
| UO_Zpos
| UO_Zneg
| UO_Zopp
val unop_rect : 'a1 -> 'a1 -> 'a1 -> 'a1 -> 'a1 -> unop -> 'a1
val unop_rec : 'a1 -> 'a1 -> 'a1 -> 'a1 -> 'a1 -> unop -> 'a1
type binop =
| BO_Zplus
| BO_Zminus
| BO_Zmult
| BO_Zlt
| BO_Zle
| BO_Zge
| BO_Zgt
| BO_eq of Typ.coq_type
val binop_rect :
'a1 -> 'a1 -> 'a1 -> 'a1 -> 'a1 -> 'a1 -> 'a1 -> (Typ.coq_type -> 'a1) ->
binop -> 'a1
val binop_rec :
'a1 -> 'a1 -> 'a1 -> 'a1 -> 'a1 -> 'a1 -> 'a1 -> (Typ.coq_type -> 'a1) ->
binop -> 'a1
type nop =
Typ.coq_type
(* singleton inductive, whose constructor was NO_distinct *)
val nop_rect : (Typ.coq_type -> 'a1) -> nop -> 'a1
val nop_rec : (Typ.coq_type -> 'a1) -> nop -> 'a1
type atom =
| Acop of cop
| Auop of unop * int
| Abop of binop * int * int
| Anop of nop * int list
| Aapp of int * int list
val atom_rect :
(cop -> 'a1) -> (unop -> int -> 'a1) -> (binop -> int -> int -> 'a1) ->
(nop -> int list -> 'a1) -> (int -> int list -> 'a1) -> atom -> 'a1
val atom_rec :
(cop -> 'a1) -> (unop -> int -> 'a1) -> (binop -> int -> int -> 'a1) ->
(nop -> int list -> 'a1) -> (int -> int list -> 'a1) -> atom -> 'a1
val cop_eqb : cop -> cop -> bool
val uop_eqb : unop -> unop -> bool
val bop_eqb : binop -> binop -> bool
val nop_eqb : nop -> nop -> bool
val eqb : atom -> atom -> bool
val reflect_cop_eqb : cop -> cop -> reflect
val reflect_uop_eqb : unop -> unop -> reflect
val reflect_bop_eqb : binop -> binop -> reflect
val reflect_nop_eqb : nop -> nop -> reflect
val reflect_eqb : atom -> atom -> reflect
type ('t, 'i) coq_val = { v_type : 't; v_val : 'i }
val val_rect : ('a1 -> 'a2 -> 'a3) -> ('a1, 'a2) coq_val -> 'a3
val val_rec : ('a1 -> 'a2 -> 'a3) -> ('a1, 'a2) coq_val -> 'a3
val v_type : ('a1, 'a2) coq_val -> 'a1
val v_val : ('a1, 'a2) coq_val -> 'a2
type bval = (Typ.coq_type, Typ.interp) coq_val
val coq_Bval :
typ_eqb array -> Typ.coq_type -> Typ.interp -> (Typ.coq_type, Typ.interp)
coq_val
type tval = (Typ.ftype, Typ.interp_ftype) coq_val
val coq_Tval :
typ_eqb array -> Typ.ftype -> Typ.interp_ftype -> (Typ.ftype,
Typ.interp_ftype) coq_val
val bvtrue : typ_eqb array -> bval
val bvfalse : typ_eqb array -> bval
val typ_cop : cop -> Typ.coq_type
val typ_uop : unop -> Typ.coq_type*Typ.coq_type
val typ_bop : binop -> (Typ.coq_type*Typ.coq_type)*Typ.coq_type
val typ_nop : nop -> Typ.coq_type*Typ.coq_type
val check_args :
(int -> Typ.coq_type) -> int list -> Typ.coq_type list -> bool
val check_aux :
typ_eqb array -> tval array -> (int -> Typ.coq_type) -> atom ->
Typ.coq_type -> bool
val check_args_dec :
(int -> Typ.coq_type) -> Typ.coq_type -> int list -> Typ.coq_type list ->
sumbool
val check_aux_dec :
typ_eqb array -> tval array -> (int -> Typ.coq_type) -> atom -> sumbool
val apply_unop :
typ_eqb array -> Typ.coq_type -> Typ.coq_type -> (Typ.interp ->
Typ.interp) -> bval -> (Typ.coq_type, Typ.interp) coq_val
val apply_binop :
typ_eqb array -> Typ.coq_type -> Typ.coq_type -> Typ.coq_type ->
(Typ.interp -> Typ.interp -> Typ.interp) -> bval -> bval ->
(Typ.coq_type, Typ.interp) coq_val
val apply_func :
typ_eqb array -> Typ.coq_type list -> Typ.coq_type -> Typ.interp_ftype ->
bval list -> bval
val interp_cop : typ_eqb array -> cop -> (Typ.coq_type, Typ.interp) coq_val
val interp_uop :
typ_eqb array -> unop -> bval -> (Typ.coq_type, Typ.interp) coq_val
val interp_bop :
typ_eqb array -> binop -> bval -> bval -> (Typ.coq_type, Typ.interp)
coq_val
val compute_interp :
typ_eqb array -> (int -> bval) -> Typ.coq_type -> Typ.interp list -> int
list -> Typ.interp list option
val interp_aux :
typ_eqb array -> tval array -> (int -> bval) -> atom -> bval
val interp_bool : typ_eqb array -> bval -> bool
val t_interp : typ_eqb array -> tval array -> atom array -> bval array
val lt_atom : int -> atom -> bool
val wf : atom array -> bool
val get_type' : typ_eqb array -> bval array -> int -> Typ.coq_type
val get_type :
typ_eqb array -> tval array -> atom array -> int -> Typ.coq_type
val wt : typ_eqb array -> tval array -> atom array -> bool
val interp_hatom : typ_eqb array -> tval array -> atom array -> int -> bval
val interp : typ_eqb array -> tval array -> atom array -> atom -> bval
val interp_form_hatom :
typ_eqb array -> tval array -> atom array -> int -> bool
val check_atom : atom array -> bool
end
val or_of_imp : int array -> int array
val check_True : C.t
val check_False : int list
val check_BuildDef : Form.form array -> int -> C.t
val check_ImmBuildDef : Form.form array -> S.t -> int -> C.t
val check_BuildDef2 : Form.form array -> int -> C.t
val check_ImmBuildDef2 : Form.form array -> S.t -> int -> C.t
val check_BuildProj : Form.form array -> int -> int -> C.t
val check_ImmBuildProj : Form.form array -> S.t -> int -> int -> C.t
val get_eq :
Form.form array -> Atom.atom array -> int -> (int -> int -> C.t) -> C.t
val check_trans_aux :
Form.form array -> Atom.atom array -> int -> int -> int list -> int -> C.t
-> C.t
val check_trans :
Form.form array -> Atom.atom array -> int -> int list -> C.t
val build_congr :
Form.form array -> Atom.atom array -> int option list -> int list -> int
list -> C.t -> C.t
val check_congr :
Form.form array -> Atom.atom array -> int -> int option list -> C.t
val check_congr_pred :
Form.form array -> Atom.atom array -> int -> int -> int option list -> C.t
type 'c pol =
| Pc of 'c
| Pinj of positive * 'c pol
| PX of 'c pol * positive * 'c pol
val p0 : 'a1 -> 'a1 pol
val p1 : 'a1 -> 'a1 pol
val peq : ('a1 -> 'a1 -> bool) -> 'a1 pol -> 'a1 pol -> bool
val mkPinj : positive -> 'a1 pol -> 'a1 pol
val mkPinj_pred : positive -> 'a1 pol -> 'a1 pol
val mkPX :
'a1 -> ('a1 -> 'a1 -> bool) -> 'a1 pol -> positive -> 'a1 pol -> 'a1 pol
val mkXi : 'a1 -> 'a1 -> positive -> 'a1 pol
val mkX : 'a1 -> 'a1 -> 'a1 pol
val popp : ('a1 -> 'a1) -> 'a1 pol -> 'a1 pol
val paddC : ('a1 -> 'a1 -> 'a1) -> 'a1 pol -> 'a1 -> 'a1 pol
val psubC : ('a1 -> 'a1 -> 'a1) -> 'a1 pol -> 'a1 -> 'a1 pol
val paddI :
('a1 -> 'a1 -> 'a1) -> ('a1 pol -> 'a1 pol -> 'a1 pol) -> 'a1 pol ->
positive -> 'a1 pol -> 'a1 pol
val psubI :
('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1) -> ('a1 pol -> 'a1 pol -> 'a1 pol) ->
'a1 pol -> positive -> 'a1 pol -> 'a1 pol
val paddX :
'a1 -> ('a1 -> 'a1 -> bool) -> ('a1 pol -> 'a1 pol -> 'a1 pol) -> 'a1 pol
-> positive -> 'a1 pol -> 'a1 pol
val psubX :
'a1 -> ('a1 -> 'a1) -> ('a1 -> 'a1 -> bool) -> ('a1 pol -> 'a1 pol -> 'a1
pol) -> 'a1 pol -> positive -> 'a1 pol -> 'a1 pol
val padd :
'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> bool) -> 'a1 pol -> 'a1 pol ->
'a1 pol
val psub :
'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1) -> ('a1
-> 'a1 -> bool) -> 'a1 pol -> 'a1 pol -> 'a1 pol
val pmulC_aux :
'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> bool) -> 'a1 pol -> 'a1 -> 'a1
pol
val pmulC :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> bool) -> 'a1 pol -> 'a1
-> 'a1 pol
val pmulI :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> bool) -> ('a1 pol ->
'a1 pol -> 'a1 pol) -> 'a1 pol -> positive -> 'a1 pol -> 'a1 pol
val pmul :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 ->
bool) -> 'a1 pol -> 'a1 pol -> 'a1 pol
val psquare :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 ->
bool) -> 'a1 pol -> 'a1 pol
type 'c pExpr =
| PEc of 'c
| PEX of positive
| PEadd of 'c pExpr * 'c pExpr
| PEsub of 'c pExpr * 'c pExpr
| PEmul of 'c pExpr * 'c pExpr
| PEopp of 'c pExpr
| PEpow of 'c pExpr * n
val mk_X : 'a1 -> 'a1 -> positive -> 'a1 pol
val ppow_pos :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 ->
bool) -> ('a1 pol -> 'a1 pol) -> 'a1 pol -> 'a1 pol -> positive -> 'a1 pol
val ppow_N :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 ->
bool) -> ('a1 pol -> 'a1 pol) -> 'a1 pol -> n -> 'a1 pol
val norm_aux :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 ->
'a1) -> ('a1 -> 'a1) -> ('a1 -> 'a1 -> bool) -> 'a1 pExpr -> 'a1 pol
type 'a bFormula =
| TT
| FF
| X
| A of 'a
| Cj of 'a bFormula * 'a bFormula
| D of 'a bFormula * 'a bFormula
| N of 'a bFormula
| I of 'a bFormula * 'a bFormula
type 'term' clause = 'term' list
type 'term' cnf = 'term' clause list
val tt : 'a1 cnf
val ff : 'a1 cnf
val add_term :
('a1 -> bool) -> ('a1 -> 'a1 -> 'a1 option) -> 'a1 -> 'a1 clause -> 'a1
clause option
val or_clause :
('a1 -> bool) -> ('a1 -> 'a1 -> 'a1 option) -> 'a1 clause -> 'a1 clause ->
'a1 clause option
val or_clause_cnf :
('a1 -> bool) -> ('a1 -> 'a1 -> 'a1 option) -> 'a1 clause -> 'a1 cnf -> 'a1
cnf
val or_cnf :
('a1 -> bool) -> ('a1 -> 'a1 -> 'a1 option) -> 'a1 cnf -> 'a1 cnf -> 'a1
cnf
val and_cnf : 'a1 cnf -> 'a1 cnf -> 'a1 cnf
val xcnf :
('a2 -> bool) -> ('a2 -> 'a2 -> 'a2 option) -> ('a1 -> 'a2 cnf) -> ('a1 ->
'a2 cnf) -> bool -> 'a1 bFormula -> 'a2 cnf
val cnf_checker : ('a1 list -> 'a2 -> bool) -> 'a1 cnf -> 'a2 list -> bool
val tauto_checker :
('a2 -> bool) -> ('a2 -> 'a2 -> 'a2 option) -> ('a1 -> 'a2 cnf) -> ('a1 ->
'a2 cnf) -> ('a2 list -> 'a3 -> bool) -> 'a1 bFormula -> 'a3 list -> bool
val cneqb : ('a1 -> 'a1 -> bool) -> 'a1 -> 'a1 -> bool
val cltb : ('a1 -> 'a1 -> bool) -> ('a1 -> 'a1 -> bool) -> 'a1 -> 'a1 -> bool
type 'c polC = 'c pol
type op1 =
| Equal
| NonEqual
| Strict
| NonStrict
type 'c nFormula = 'c polC*op1
val opMult : op1 -> op1 -> op1 option
val opAdd : op1 -> op1 -> op1 option
type 'c psatz =
| PsatzIn of nat
| PsatzSquare of 'c polC
| PsatzMulC of 'c polC * 'c psatz
| PsatzMulE of 'c psatz * 'c psatz
| PsatzAdd of 'c psatz * 'c psatz
| PsatzC of 'c
| PsatzZ
val map_option : ('a1 -> 'a2 option) -> 'a1 option -> 'a2 option
val map_option2 :
('a1 -> 'a2 -> 'a3 option) -> 'a1 option -> 'a2 option -> 'a3 option
val pexpr_times_nformula :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 ->
bool) -> 'a1 polC -> 'a1 nFormula -> 'a1 nFormula option
val nformula_times_nformula :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 ->
bool) -> 'a1 nFormula -> 'a1 nFormula -> 'a1 nFormula option
val nformula_plus_nformula :
'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> bool) -> 'a1 nFormula -> 'a1
nFormula -> 'a1 nFormula option
val eval_Psatz :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 ->
bool) -> ('a1 -> 'a1 -> bool) -> 'a1 nFormula list -> 'a1 psatz -> 'a1
nFormula option
val check_inconsistent :
'a1 -> ('a1 -> 'a1 -> bool) -> ('a1 -> 'a1 -> bool) -> 'a1 nFormula -> bool
type op2 =
| OpEq
| OpNEq
| OpLe
| OpGe
| OpLt
| OpGt
type 't formula = { flhs : 't pExpr; fop : op2; frhs : 't pExpr }
val norm :
'a1 -> 'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 ->
'a1) -> ('a1 -> 'a1) -> ('a1 -> 'a1 -> bool) -> 'a1 pExpr -> 'a1 pol
val psub0 :
'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1) -> ('a1
-> 'a1 -> bool) -> 'a1 pol -> 'a1 pol -> 'a1 pol
val padd0 :
'a1 -> ('a1 -> 'a1 -> 'a1) -> ('a1 -> 'a1 -> bool) -> 'a1 pol -> 'a1 pol ->
'a1 pol
type zWitness = z psatz
val psub1 : z pol -> z pol -> z pol
val padd1 : z pol -> z pol -> z pol
val norm0 : z pExpr -> z pol
val xnormalise : z formula -> z nFormula list
val normalise : z formula -> z nFormula cnf
val xnegate : z formula -> z nFormula list
val negate : z formula -> z nFormula cnf
val zunsat : z nFormula -> bool
val zdeduce : z nFormula -> z nFormula -> z nFormula option
val ceiling : z -> z -> z
type zArithProof =
| DoneProof
| RatProof of zWitness * zArithProof
| CutProof of zWitness * zArithProof
| EnumProof of zWitness * zWitness * zArithProof list
val zgcdM : z -> z -> z
val zgcd_pol : z polC -> z*z
val zdiv_pol : z polC -> z -> z polC
val makeCuttingPlane : z polC -> z polC*z
val genCuttingPlane : z nFormula -> ((z polC*z)*op1) option
val nformula_of_cutting_plane : ((z polC*z)*op1) -> z nFormula
val is_pol_Z0 : z polC -> bool
val eval_Psatz0 : z nFormula list -> zWitness -> z nFormula option
val valid_cut_sign : op1 -> bool
val zChecker : z nFormula list -> zArithProof -> bool
val zTautoChecker : z formula bFormula -> zArithProof list -> bool
val build_positive_atom_aux :
(int -> positive option) -> Atom.atom -> positive option
val build_positive : Atom.atom array -> int -> positive option
val build_z_atom_aux : Atom.atom array -> Atom.atom -> z option
val build_z_atom : Atom.atom array -> Atom.atom -> z option
type vmap = positive*Atom.atom list
val find_var_aux : Atom.atom -> positive -> Atom.atom list -> positive option
val find_var : vmap -> Atom.atom -> vmap*positive
val empty_vmap : vmap
val build_pexpr_atom_aux :
Atom.atom array -> (vmap -> int -> vmap*z pExpr) -> vmap -> Atom.atom ->
vmap*z pExpr
val build_pexpr : Atom.atom array -> vmap -> int -> vmap*z pExpr
val build_op2 : Atom.binop -> op2 option
val build_formula_atom :
Atom.atom array -> vmap -> Atom.atom -> (vmap*z formula) option
val build_formula : Atom.atom array -> vmap -> int -> (vmap*z formula) option
val build_not2 : int -> z formula bFormula -> z formula bFormula
val build_hform :
Atom.atom array -> (vmap -> int -> (vmap*z formula bFormula) option) ->
vmap -> Form.form -> (vmap*z formula bFormula) option
val build_var :
Form.form array -> Atom.atom array -> vmap -> int -> (vmap*z formula
bFormula) option
val build_form :
Form.form array -> Atom.atom array -> vmap -> Form.form -> (vmap*z formula
bFormula) option
val build_nlit :
Form.form array -> Atom.atom array -> vmap -> int -> (vmap*z formula
bFormula) option
val build_clause_aux :
Form.form array -> Atom.atom array -> vmap -> int list -> (vmap*z formula
bFormula) option
val build_clause :
Form.form array -> Atom.atom array -> vmap -> int list -> (vmap*z formula
bFormula) option
val get_eq0 :
Form.form array -> Atom.atom array -> int -> (int -> int -> C.t) -> C.t
val get_not_le :
Form.form array -> Atom.atom array -> int -> (int -> int -> C.t) -> C.t
val check_micromega :
Form.form array -> Atom.atom array -> int list -> zArithProof list -> C.t
val check_diseq : Form.form array -> Atom.atom array -> int -> C.t
val check_atom_aux :
Atom.atom array -> (int -> int -> bool) -> Atom.atom -> Atom.atom -> bool
val check_hatom : Atom.atom array -> int -> int -> bool
val check_neg_hatom : Atom.atom array -> int -> int -> bool
val remove_not : Form.form array -> int -> int
val get_and : Form.form array -> int -> int array option
val get_or : Form.form array -> int -> int array option
val flatten_op_body :
(int -> int array option) -> (int list -> int -> int list) -> int list ->
int -> int list
val flatten_op_lit :
(int -> int array option) -> int -> int list -> int -> int list
val flatten_and : Form.form array -> int array -> int list
val flatten_or : Form.form array -> int array -> int list
val check_flatten_body :
Form.form array -> (int -> int -> bool) -> (int -> int -> bool) -> (int ->
int -> bool) -> int -> int -> bool
val check_flatten_aux :
Form.form array -> (int -> int -> bool) -> (int -> int -> bool) -> int ->
int -> bool
val check_flatten :
Form.form array -> (int -> int -> bool) -> (int -> int -> bool) -> S.t ->
int -> int -> C.t
val check_spl_arith :
Form.form array -> Atom.atom array -> int list -> int -> zArithProof list
-> C.t
val check_in : int -> int list -> bool
val check_diseqs_complete_aux :
int -> int list -> (int*int) option array -> bool
val check_diseqs_complete : int list -> (int*int) option array -> bool
val check_diseqs :
Form.form array -> Atom.atom array -> Typ.coq_type -> int list -> int array
-> bool
val check_distinct :
Form.form array -> Atom.atom array -> int -> int array -> bool
val check_distinct_two_args :
Form.form array -> Atom.atom array -> int -> int -> bool
val check_lit :
Form.form array -> Atom.atom array -> (int -> int -> bool) -> int -> int ->
bool
val check_form_aux :
Form.form array -> Atom.atom array -> (int -> int -> bool) -> Form.form ->
Form.form -> bool
val check_hform : Form.form array -> Atom.atom array -> int -> int -> bool
val check_lit' : Form.form array -> Atom.atom array -> int -> int -> bool
val check_distinct_elim :
Form.form array -> Atom.atom array -> int list -> int -> int list
type 'step _trace_ = 'step array array
val _checker_ :
(S.t -> 'a1 -> S.t) -> (C.t -> bool) -> S.t -> 'a1 _trace_ -> int -> bool
module Euf_Checker :
sig
type step =
| Res of int * int array
| ImmFlatten of int * int * int
| CTrue of int
| CFalse of int
| BuildDef of int * int
| BuildDef2 of int * int
| BuildProj of int * int * int
| ImmBuildDef of int * int
| ImmBuildDef2 of int * int
| ImmBuildProj of int * int * int
| EqTr of int * int * int list
| EqCgr of int * int * int option list
| EqCgrP of int * int * int * int option list
| LiaMicromega of int * int list * zArithProof list
| LiaDiseq of int * int
| SplArith of int * int * int * zArithProof list
| SplDistinctElim of int * int * int
val step_rect :
(int -> int array -> 'a1) -> (int -> int -> int -> 'a1) -> (int -> 'a1)
-> (int -> 'a1) -> (int -> int -> 'a1) -> (int -> int -> 'a1) -> (int ->
int -> int -> 'a1) -> (int -> int -> 'a1) -> (int -> int -> 'a1) -> (int
-> int -> int -> 'a1) -> (int -> int -> int list -> 'a1) -> (int -> int
-> int option list -> 'a1) -> (int -> int -> int -> int option list ->
'a1) -> (int -> int list -> zArithProof list -> 'a1) -> (int -> int ->
'a1) -> (int -> int -> int -> zArithProof list -> 'a1) -> (int -> int ->
int -> 'a1) -> step -> 'a1
val step_rec :
(int -> int array -> 'a1) -> (int -> int -> int -> 'a1) -> (int -> 'a1)
-> (int -> 'a1) -> (int -> int -> 'a1) -> (int -> int -> 'a1) -> (int ->
int -> int -> 'a1) -> (int -> int -> 'a1) -> (int -> int -> 'a1) -> (int
-> int -> int -> 'a1) -> (int -> int -> int list -> 'a1) -> (int -> int
-> int option list -> 'a1) -> (int -> int -> int -> int option list ->
'a1) -> (int -> int list -> zArithProof list -> 'a1) -> (int -> int ->
'a1) -> (int -> int -> int -> zArithProof list -> 'a1) -> (int -> int ->
int -> 'a1) -> step -> 'a1
val step_checker : Atom.atom array -> Form.form array -> S.t -> step -> S.t
val euf_checker :
Atom.atom array -> Form.form array -> (C.t -> bool) -> S.t -> step
_trace_ -> int -> bool
type certif =
| Certif of int * step _trace_ * int
val certif_rect : (int -> step _trace_ -> int -> 'a1) -> certif -> 'a1
val certif_rec : (int -> step _trace_ -> int -> 'a1) -> certif -> 'a1
val add_roots : S.t -> int array -> int array option -> S.t
val valid :
typ_eqb array -> Atom.tval array -> Atom.atom array -> Form.form array ->
int array -> bool
val checker :
typ_eqb array -> Atom.tval array -> Atom.atom array -> Form.form array ->
int array -> int array option -> certif -> bool
val checker_b :
typ_eqb array -> Atom.tval array -> Atom.atom array -> Form.form array ->
int -> bool -> certif -> bool
val checker_eq :
typ_eqb array -> Atom.tval array -> Atom.atom array -> Form.form array ->
int -> int -> int -> certif -> bool
val checker_ext :
Atom.atom array -> Form.form array -> int array -> int array option ->
certif -> bool
end
|