/usr/share/acl2-7.1/boot-strap-pass-2.lisp is in acl2-source 7.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | ; ACL2 Version 7.1 -- A Computational Logic for Applicative Common Lisp
; Copyright (C) 2015, Regents of the University of Texas
; This version of ACL2 is a descendent of ACL2 Version 1.9, Copyright
; (C) 1997 Computational Logic, Inc. See the documentation topic NOTE-2-0.
; This program is free software; you can redistribute it and/or modify
; it under the terms of the LICENSE file distributed with ACL2.
; This program is distributed in the hope that it will be useful,
; but WITHOUT ANY WARRANTY; without even the implied warranty of
; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
; LICENSE for more details.
; Written by: Matt Kaufmann and J Strother Moore
; email: Kaufmann@cs.utexas.edu and Moore@cs.utexas.edu
; Department of Computer Science
; University of Texas at Austin
; Austin, TX 78712 U.S.A.
(in-package "ACL2")
; This file, boot-strap-pass-2, is compiled and loaded; but it is only
; processed during the second pass of the boot-strap process, not the first.
; We introduce proper defattach events, i.e., without :skip-checks t. Here are
; some guiding principles for making system functions available for attachment
; by users.
; - The initial attachment is named by adding the suffix -builtin. For
; example, worse-than is a constrained function initially attached to
; worse-than-builtin.
; - Use the weakest logical specs we can (even if T), without getting
; distracted by names. For example, we do not specify a relationship between
; worse-than-or-equal and worse-than.
; - Only make functions attachable if they are used in our sources somewhere
; outside their definitions. So for example, we do not introduce
; worse-than-list as a constrained function, since its only use is in the
; mutual-recursion event that defines worse-than.
; We conclude by defining some theories, at the end so that they pick up the
; rest of this file.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Miscellaneous verify-termination and guard verification
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; cons-term and symbol-class -- at one point during development, used in
; fncall-term, but anyhow, generally useful to have in logic mode
(verify-termination-boot-strap quote-listp) ; and guards
(verify-termination-boot-strap cons-term1) ; and guards
(verify-termination-boot-strap cons-term) ; and guards
(verify-termination-boot-strap symbol-class) ; and guards
; observation1-cw
(verify-termination-boot-strap observation1-cw)
(verify-guards observation1-cw)
; packn1 and packn
(verify-termination-boot-strap packn1) ; and guards
(encapsulate ()
(local
(defthm character-listp-explode-nonnegative-integer
(implies (character-listp z)
(character-listp (explode-nonnegative-integer x y z)))
:rule-classes ((:forward-chaining :trigger-terms
((explode-nonnegative-integer x y z))))))
(local
(defthm character-listp-explode-atom
(character-listp (explode-atom x y))
:rule-classes ((:forward-chaining :trigger-terms
((explode-atom x y))))))
(verify-termination-boot-strap packn) ; and guards
(verify-termination-boot-strap packn-pos) ; and guards
)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Attachment: too-many-ifs-post-rewrite and too-many-ifs-pre-rewrite
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
#+acl2-loop-only
; The above readtime conditional avoids a CLISP warning, and lets the defproxy
; for print-clause-id-okp provide the raw Lisp definition.
(encapsulate
((too-many-ifs-post-rewrite (args val) t
:guard (and (pseudo-term-listp args)
(pseudo-termp val))))
(local (defun too-many-ifs-post-rewrite (args val)
(list args val))))
; The following events are derived from the original version of community book
; books/system/too-many-ifs.lisp. But here we provide a proof that does not
; depend on books. Our approach was to take the proof in the above book,
; eliminate the unnecessary use of an arithmetic book, expand away all uses of
; macros and make-events, avoid use of (theory 'minimal-theory) since that
; theory didn't yet exist (where these events were originally placed), and
; apply some additional hand-editing in order (for example) to remove hints
; depending on the tools/flag community book. We have left original events
; from the book as comments.
(encapsulate
()
(logic)
;;; (include-book "tools/flag" :dir :system)
; In the original book, but not needed for its certification:
; (include-book "arithmetic/top-with-meta" :dir :system)
; Comments like the following show events from the original book.
;;; (make-flag pseudo-termp-flg
;;; pseudo-termp
;;; :flag-var flg
;;; :flag-mapping ((pseudo-termp . term)
;;; (pseudo-term-listp . list))
;;; :defthm-macro-name defthm-pseudo-termp
;;; :local t)
(local
(defun-nx pseudo-termp-flg (flg x lst)
(declare (xargs :verify-guards nil
:normalize nil
:measure (case flg (term (acl2-count x))
(otherwise (acl2-count lst)))))
(case flg
(term (if (consp x)
(cond ((equal (car x) 'quote)
(and (consp (cdr x))
(equal (cddr x) nil)))
((true-listp x)
(and (pseudo-termp-flg 'list nil (cdr x))
(cond ((symbolp (car x)) t)
((true-listp (car x))
(and (equal (length (car x)) 3)
(equal (caar x) 'lambda)
(symbol-listp (cadar x))
(pseudo-termp-flg 'term (caddar x) nil)
(equal (length (cadar x))
(length (cdr x)))))
(t nil))))
(t nil))
(symbolp x)))
(otherwise (if (consp lst)
(and (pseudo-termp-flg 'term (car lst) nil)
(pseudo-termp-flg 'list nil (cdr lst)))
(equal lst nil))))))
(local
(defthm pseudo-termp-flg-equivalences
(equal (pseudo-termp-flg flg x lst)
(case flg (term (pseudo-termp x))
(otherwise (pseudo-term-listp lst))))
:hints
(("goal" :induct (pseudo-termp-flg flg x lst)))))
(local (in-theory (disable (:definition pseudo-termp-flg))))
; Added here (not present or needed in the certified book):
(verify-termination-boot-strap max) ; and guards
(verify-termination-boot-strap var-counts1)
;;; (make-flag var-counts1-flg
;;; var-counts1
;;; :flag-var flg
;;; :flag-mapping ((var-counts1 . term)
;;; (var-counts1-lst . list))
;;; :defthm-macro-name defthm-var-counts1
;;; :local t)
(local
(defun-nx var-counts1-flg (flg rhs arg lst acc)
(declare (xargs :verify-guards nil
:normalize nil
:measure (case flg (term (acl2-count rhs))
(otherwise (acl2-count lst)))
:hints nil
:well-founded-relation o<
:mode :logic)
(ignorable rhs arg lst acc))
(case flg
(term (cond ((equal arg rhs) (+ 1 acc))
((consp rhs)
(cond ((equal 'quote (car rhs)) acc)
((equal (car rhs) 'if)
(max (var-counts1-flg 'term
(caddr rhs)
arg nil acc)
(var-counts1-flg 'term
(cadddr rhs)
arg nil acc)))
(t (var-counts1-flg 'list
nil arg (cdr rhs)
acc))))
(t acc)))
(otherwise (if (consp lst)
(var-counts1-flg 'list
nil arg (cdr lst)
(var-counts1-flg 'term
(car lst)
arg nil acc))
acc)))))
(local
(defthm
var-counts1-flg-equivalences
(equal (var-counts1-flg flg rhs arg lst acc)
(case flg (term (var-counts1 arg rhs acc))
(otherwise (var-counts1-lst arg lst acc))))))
(local (in-theory (disable (:definition var-counts1-flg))))
;;; (defthm-var-counts1 natp-var-counts1
;;; (term
;;; (implies (natp acc)
;;; (natp (var-counts1 arg rhs acc)))
;;; :rule-classes :type-prescription)
;;; (list
;;; (implies (natp acc)
;;; (natp (var-counts1-lst arg lst acc)))
;;; :rule-classes :type-prescription)
;;; :hints (("Goal" :induct (var-counts1-flg flg rhs arg lst acc))))
(local
(defthm natp-var-counts1
(case flg
(term (implies (natp acc)
(natp (var-counts1 arg rhs acc))))
(otherwise (implies (natp acc)
(natp (var-counts1-lst arg lst acc)))))
:hints (("Goal" :induct (var-counts1-flg flg rhs arg lst acc)))
:rule-classes nil))
(local
(defthm natp-var-counts1-term
(implies (natp acc)
(natp (var-counts1 arg rhs acc)))
:hints (("Goal" ; :in-theory (theory 'minimal-theory)
:use ((:instance natp-var-counts1 (flg 'term)))))
:rule-classes :type-prescription))
(local
(defthm natp-var-counts1-list
(implies (natp acc)
(natp (var-counts1-lst arg lst acc)))
:hints (("Goal" ; :in-theory (theory 'minimal-theory)
:use ((:instance natp-var-counts1 (flg 'list)))))
:rule-classes :type-prescription))
(verify-guards var-counts1)
(verify-termination-boot-strap var-counts) ; and guards
;;; Since the comment about var-counts says that var-counts returns a list of
;;; nats as long as lhs-args, I prove those facts, speculatively.
; Except, we reason instead about integer-listp. See the comment just above
; the commented-out definition of nat-listp in the source code (file
; rewrite.lisp).
; (verify-termination nat-listp)
(local
(defthm integer-listp-var-counts
(integer-listp (var-counts lhs-args rhs))))
(local
(defthm len-var-counts
(equal (len (var-counts lhs-args rhs))
(len lhs-args))))
(verify-termination-boot-strap count-ifs) ; and guards
; Added here (not present or needed in the certified book):
(verify-termination-boot-strap ifix) ; and guards
; Added here (not present or needed in the certified book):
(verify-termination-boot-strap abs) ; and guards
; Added here (not present or needed in the certified book):
(verify-termination-boot-strap expt) ; and guards
; Added here (not present or needed in the certified book):
(local (defthm natp-expt
(implies (and (integerp base)
(integerp n)
(<= 0 n))
(integerp (expt base n)))
:rule-classes :type-prescription))
; Added here (not present or needed in the certified book):
(verify-termination-boot-strap signed-byte-p) ; and guards
(verify-termination-boot-strap too-many-ifs0) ; and guards
(verify-termination-boot-strap too-many-ifs-pre-rewrite-builtin) ; and guards
(verify-termination-boot-strap occur-cnt-bounded)
;;; (make-flag occur-cnt-bounded-flg
;;; occur-cnt-bounded
;;; :flag-var flg
;;; :flag-mapping ((occur-cnt-bounded . term)
;;; (occur-cnt-bounded-lst . list))
;;; :defthm-macro-name defthm-occur-cnt-bounded
;;; :local t)
(local
(defun-nx occur-cnt-bounded-flg (flg term2 term1 lst a m bound-m)
(declare (xargs :verify-guards nil
:normalize nil
:measure (case flg (term (acl2-count term2))
(otherwise (acl2-count lst))))
(ignorable term2 term1 lst a m bound-m))
(case flg
(term (cond ((equal term1 term2)
(if (< bound-m a) -1 (+ a m)))
((consp term2)
(if (equal 'quote (car term2))
a
(occur-cnt-bounded-flg 'list
nil term1 (cdr term2)
a m bound-m)))
(t a)))
(otherwise (if (consp lst)
(let ((new (occur-cnt-bounded-flg 'term
(car lst)
term1 nil a m bound-m)))
(if (equal new -1)
-1
(occur-cnt-bounded-flg 'list
nil term1 (cdr lst)
new m bound-m)))
a)))))
(local
(defthm occur-cnt-bounded-flg-equivalences
(equal (occur-cnt-bounded-flg flg term2 term1 lst a m bound-m)
(case flg
(term (occur-cnt-bounded term1 term2 a m bound-m))
(otherwise (occur-cnt-bounded-lst term1 lst a m bound-m))))))
(local (in-theory (disable (:definition occur-cnt-bounded-flg))))
;;; (defthm-occur-cnt-bounded integerp-occur-cnt-bounded
;;; (term
;;; (implies (and (integerp a)
;;; (integerp m))
;;; (integerp (occur-cnt-bounded term1 term2 a m bound-m)))
;;; :rule-classes :type-prescription)
;;; (list
;;; (implies (and (integerp a)
;;; (integerp m))
;;; (integerp (occur-cnt-bounded-lst term1 lst a m bound-m)))
;;; :rule-classes :type-prescription)
;;; :hints (("Goal" :induct (occur-cnt-bounded-flg flg term2 term1 lst a m
;;; bound-m))))
(local
(defthm integerp-occur-cnt-bounded
(case flg
(term (implies (and (integerp a) (integerp m))
(integerp (occur-cnt-bounded term1 term2 a m bound-m))))
(otherwise
(implies (and (integerp a) (integerp m))
(integerp (occur-cnt-bounded-lst term1 lst a m bound-m)))))
:rule-classes nil
:hints
(("Goal" :induct (occur-cnt-bounded-flg flg term2 term1 lst a m bound-m)))))
(local
(defthm integerp-occur-cnt-bounded-term
(implies (and (integerp a) (integerp m))
(integerp (occur-cnt-bounded term1 term2 a m bound-m)))
:rule-classes :type-prescription
:hints (("goal" ; :in-theory (theory 'minimal-theory)
:use ((:instance integerp-occur-cnt-bounded
(flg 'term)))))))
(local
(defthm integerp-occur-cnt-bounded-list
(implies (and (integerp a) (integerp m))
(integerp (occur-cnt-bounded-lst term1 lst a m bound-m)))
:rule-classes :type-prescription
:hints (("goal" ; :in-theory (theory 'minimal-theory)
:use ((:instance integerp-occur-cnt-bounded
(flg 'list)))))))
;;; (defthm-occur-cnt-bounded signed-byte-p-30-occur-cnt-bounded-flg
;;; (term
;;; (implies (and (force (signed-byte-p 30 a))
;;; (signed-byte-p 30 m)
;;; (signed-byte-p 30 (+ bound-m m))
;;; (force (<= 0 a))
;;; (<= 0 m)
;;; (<= 0 bound-m)
;;; (<= a (+ bound-m m)))
;;; (and (<= -1 (occur-cnt-bounded term1 term2 a m bound-m))
;;; (<= (occur-cnt-bounded term1 term2 a m bound-m) (+ bound-m m))))
;;; :rule-classes :linear)
;;; (list
;;; (implies (and (force (signed-byte-p 30 a))
;;; (signed-byte-p 30 m)
;;; (signed-byte-p 30 (+ bound-m m))
;;; (force (<= 0 a))
;;; (<= 0 m)
;;; (<= 0 bound-m)
;;; (<= a (+ bound-m m)))
;;; (and (<= -1 (occur-cnt-bounded-lst term1 lst a m bound-m))
;;; (<= (occur-cnt-bounded-lst term1 lst a m bound-m) (+ bound-m m))))
;;; :rule-classes :linear)
;;; :hints (("Goal" :induct (occur-cnt-bounded-flg flg term2 term1 lst a m
;;; bound-m))))
(local
(defthm signed-byte-p-30-occur-cnt-bounded-flg
(case flg
(term (implies (and (force (signed-byte-p 30 a))
(signed-byte-p 30 m)
(signed-byte-p 30 (+ bound-m m))
(force (<= 0 a))
(<= 0 m)
(<= 0 bound-m)
(<= a (+ bound-m m)))
(and (<= -1
(occur-cnt-bounded term1 term2 a m bound-m))
(<= (occur-cnt-bounded term1 term2 a m bound-m)
(+ bound-m m)))))
(otherwise
(implies (and (force (signed-byte-p 30 a))
(signed-byte-p 30 m)
(signed-byte-p 30 (+ bound-m m))
(force (<= 0 a))
(<= 0 m)
(<= 0 bound-m)
(<= a (+ bound-m m)))
(and (<= -1
(occur-cnt-bounded-lst term1 lst a m bound-m))
(<= (occur-cnt-bounded-lst term1 lst a m bound-m)
(+ bound-m m))))))
:rule-classes nil
:hints
(("Goal" :induct (occur-cnt-bounded-flg flg term2 term1 lst a m bound-m)))))
(local
(defthm signed-byte-p-30-occur-cnt-bounded-flg-term
(implies (and (force (signed-byte-p 30 a))
(signed-byte-p 30 m)
(signed-byte-p 30 (+ bound-m m))
(force (<= 0 a))
(<= 0 m)
(<= 0 bound-m)
(<= a (+ bound-m m)))
(and (<= -1
(occur-cnt-bounded term1 term2 a m bound-m))
(<= (occur-cnt-bounded term1 term2 a m bound-m)
(+ bound-m m))))
:rule-classes :linear
:hints (("Goal" ; :in-theory (theory 'minimal-theory)
:use ((:instance signed-byte-p-30-occur-cnt-bounded-flg
(flg 'term)))))))
(local
(defthm signed-byte-p-30-occur-cnt-bounded-flg-list
(implies (and (force (signed-byte-p 30 a))
(signed-byte-p 30 m)
(signed-byte-p 30 (+ bound-m m))
(force (<= 0 a))
(<= 0 m)
(<= 0 bound-m)
(<= a (+ bound-m m)))
(and (<= -1
(occur-cnt-bounded-lst term1 lst a m bound-m))
(<= (occur-cnt-bounded-lst term1 lst a m bound-m)
(+ bound-m m))))
:rule-classes :linear
:hints (("Goal" ; :in-theory (theory 'minimal-theory)
:use ((:instance signed-byte-p-30-occur-cnt-bounded-flg
(flg 'list)))))))
(verify-guards occur-cnt-bounded)
(verify-termination-boot-strap too-many-ifs1) ; and guards
(verify-termination-boot-strap too-many-ifs-post-rewrite-builtin) ; and guards
)
(defattach too-many-ifs-post-rewrite too-many-ifs-post-rewrite-builtin)
; Complete too-many-ifs-pre-rewrite.
#+acl2-loop-only
; The above readtime conditional avoids a CLISP warning, and lets the defproxy
; for print-clause-id-okp provide the raw Lisp definition.
(encapsulate
((too-many-ifs-pre-rewrite (args counts) t
:guard
(and (pseudo-term-listp args)
(integer-listp counts)
(equal (len args) (len counts)))))
(local (defun too-many-ifs-pre-rewrite (args counts)
(list args counts))))
(defattach (too-many-ifs-pre-rewrite too-many-ifs-pre-rewrite-builtin))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Attachment: ancestors-check, worse-than, worse-than-or-equal
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(verify-termination-boot-strap pseudo-variantp)
(verify-termination-boot-strap member-char-stringp)
(verify-termination-boot-strap terminal-substringp1)
(verify-termination-boot-strap terminal-substringp)
(verify-termination-boot-strap evg-occur)
(verify-termination-boot-strap min-fixnum)
(verify-termination-boot-strap fn-count-evg-rec ; but not guards
(declare (xargs :verify-guards nil)))
(defthm fn-count-evg-rec-type-prescription
(implies (natp acc)
(natp (fn-count-evg-rec evg acc calls)))
:rule-classes :type-prescription)
(defthm fn-count-evg-rec-bound
(< (fn-count-evg-rec evg acc calls)
536870912) ; (expt 2 29)
:rule-classes :linear)
(verify-guards fn-count-evg-rec)
(verify-termination-boot-strap occur)
(verify-termination-boot-strap worse-than-builtin-clocked) ; and mut-rec nest
(verify-termination-boot-strap worse-than-builtin)
(verify-termination-boot-strap worse-than-or-equal-builtin)
(verify-termination-boot-strap ancestor-listp)
(verify-termination-boot-strap earlier-ancestor-biggerp)
(verify-termination-boot-strap fn-count-1) ; but not guards
(defthm fn-count-1-type
(implies (and (integerp fn-count-acc)
(integerp p-fn-count-acc))
(and (integerp (car (fn-count-1 flag term
fn-count-acc p-fn-count-acc)))
(integerp (mv-nth 0 (fn-count-1 flag term
fn-count-acc
p-fn-count-acc)))
(integerp (mv-nth 1 (fn-count-1 flag term
fn-count-acc
p-fn-count-acc)))
(integerp (nth 0 (fn-count-1 flag term
fn-count-acc
p-fn-count-acc)))
(integerp (nth 1 (fn-count-1 flag term
fn-count-acc
p-fn-count-acc)))))
:rule-classes ((:forward-chaining
:trigger-terms
((fn-count-1 flag term fn-count-acc p-fn-count-acc)))))
(verify-guards fn-count-1)
(verify-termination-boot-strap var-fn-count-1) ; but not guards
(defthm symbol-listp-cdr-assoc-equal
(implies (symbol-list-listp x)
(symbol-listp (cdr (assoc-equal key x)))))
; We state the following three rules in all forms that we think might be useful
; to those who want to reason about var-fn-count-1, for example if they are
; developing attachments to ancestors-check.
(defthm integerp-nth-0-var-fn-count-1
(implies (integerp var-count-acc)
(integerp (nth 0 (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table))))
:rule-classes
((:forward-chaining
:trigger-terms
((var-fn-count-1 flg x var-count-acc fn-count-acc
p-fn-count-acc invisible-fns
invisible-fns-table))
:corollary
(implies (integerp var-count-acc)
(and (integerp (nth 0 (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table)))
(integerp (mv-nth 0 (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table)))
(integerp (car (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table))))))))
(defthm integerp-nth-1-var-fn-count-1
(implies (integerp fn-count-acc)
(integerp (nth 1 (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table))))
:rule-classes
((:forward-chaining
:trigger-terms
((var-fn-count-1 flg x var-count-acc fn-count-acc
p-fn-count-acc invisible-fns
invisible-fns-table))
:corollary
(implies (integerp fn-count-acc)
(and (integerp (nth 1 (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table)))
(integerp (mv-nth 1 (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table))))))))
(defthm integerp-nth-2-var-fn-count-1
(implies (integerp p-fn-count-acc)
(integerp (nth 2 (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table))))
:rule-classes
((:forward-chaining
:trigger-terms
((var-fn-count-1 flg x var-count-acc fn-count-acc
p-fn-count-acc invisible-fns
invisible-fns-table))
:corollary
(implies (integerp p-fn-count-acc)
(and (integerp (nth 2 (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table)))
(integerp (mv-nth 2 (var-fn-count-1
flg x
var-count-acc fn-count-acc p-fn-count-acc
invisible-fns invisible-fns-table))))))))
(verify-guards var-fn-count-1)
(verify-termination-boot-strap equal-mod-commuting) ; and guards
(verify-termination-boot-strap ancestors-check1)
(verify-termination-boot-strap ancestors-check-builtin)
(defun member-equal-mod-commuting (x lst wrld)
(declare (xargs :guard (and (pseudo-termp x)
(pseudo-term-listp lst)
(plist-worldp wrld))))
(cond ((endp lst) nil)
((equal-mod-commuting x (car lst) wrld) lst)
(t (member-equal-mod-commuting x (cdr lst) wrld))))
; In the following, terms (nth 0 ...) and (nth 1 ...) in the hints were
; originally (car ...) and (mv-nth 1 ...), respectively, but those didn't
; work. It would be good at some point to explore why not, given that the
; original versions worked outside the build.
(defun strip-ancestor-literals (ancestors)
(declare (xargs :guard (ancestor-listp ancestors)))
(cond ((endp ancestors) nil)
(t (cons (access ancestor (car ancestors) :lit)
(strip-ancestor-literals (cdr ancestors))))))
(encapsulate
()
(local
(defthm ancestors-check1-property
(mv-let (on-ancestors assumed-true)
(ancestors-check1 lit-atm lit var-cnt fn-cnt p-fn-cnt ancestors
tokens)
(implies (and on-ancestors
assumed-true)
(member-equal-mod-commuting
lit
(strip-ancestor-literals ancestors)
nil)))
:rule-classes nil))
(defthmd ancestors-check-builtin-property
(mv-let (on-ancestors assumed-true)
(ancestors-check-builtin lit ancestors tokens)
(implies (and on-ancestors
assumed-true)
(member-equal-mod-commuting
lit
(strip-ancestor-literals ancestors)
nil)))
:hints (("Goal"
:use
((:instance
ancestors-check1-property
(lit-atm lit)
(var-cnt 0)
(fn-cnt 0)
(p-fn-cnt 0))
(:instance
ancestors-check1-property
(lit-atm lit)
(var-cnt (nth 0 (var-fn-count-1 nil lit 0 0 0 nil nil)))
(fn-cnt (nth 1 (var-fn-count-1 nil lit 0 0 0 nil nil)))
(p-fn-cnt (nth 2 (var-fn-count-1 nil lit 0 0 0 nil nil))))
(:instance
ancestors-check1-property
(lit-atm (cadr lit))
(var-cnt (nth 0 (var-fn-count-1 nil (cadr lit) 0 0 0 nil nil)))
(fn-cnt (nth 1 (var-fn-count-1 nil (cadr lit) 0 0 0 nil nil)))
(p-fn-cnt (nth 2
(var-fn-count-1 nil (cadr lit) 0 0 0
nil nil)))))))))
#+acl2-loop-only
; The above readtime conditional avoids a CLISP warning, and lets the defproxy
; for print-clause-id-okp provide the raw Lisp definition.
(encapsulate
((ancestors-check (lit ancestors tokens) (mv t t)
:guard (and (pseudo-termp lit)
(ancestor-listp ancestors)
(true-listp tokens))))
(local (defun ancestors-check (lit ancestors tokens)
(ancestors-check-builtin lit ancestors tokens)))
(defthmd ancestors-check-constraint
(implies (and (pseudo-termp lit)
(ancestor-listp ancestors)
(true-listp tokens))
(mv-let (on-ancestors assumed-true)
(ancestors-check lit ancestors tokens)
(implies (and on-ancestors
assumed-true)
(member-equal-mod-commuting
lit
(strip-ancestor-literals ancestors)
nil))))
:hints (("Goal" :use ancestors-check-builtin-property))))
(defattach (ancestors-check ancestors-check-builtin)
:hints (("Goal" :by ancestors-check-builtin-property)))
(defattach worse-than worse-than-builtin)
(defattach worse-than-or-equal worse-than-or-equal-builtin)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Attachment: acl2x-expansion-alist
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(verify-termination-boot-strap hons-copy-with-state) ; and guards
(verify-termination-boot-strap identity-with-state) ; and guards
(defattach (acl2x-expansion-alist
; User-modifiable; see comment in the defstub introducing
; acl2x-expansion-alist.
identity-with-state))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Attachments: rw-cache utilities
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(verify-termination-boot-strap rw-cache-debug-builtin) ; and guards
(defattach rw-cache-debug rw-cache-debug-builtin)
(verify-termination-boot-strap rw-cache-debug-action-builtin) ; and guards
(defattach rw-cache-debug-action rw-cache-debug-action-builtin)
(verify-termination-boot-strap rw-cacheable-failure-reason-builtin) ; and guards
(defattach rw-cacheable-failure-reason rw-cacheable-failure-reason-builtin)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Attachments: print-clause-id-okp
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(verify-termination-boot-strap all-digits-p) ; and guards
(verify-termination-boot-strap ; and guards
(d-pos-listp
(declare
(xargs
:guard-hints
(("Goal"
:use ((:instance coerce-inverse-2
(x (symbol-name (car lst))))
(:instance character-listp-coerce
(str (symbol-name (car lst)))))
:expand ((len (coerce (symbol-name (car lst)) 'list)))
:in-theory (disable coerce-inverse-2
character-listp-coerce)))))))
(verify-termination-boot-strap pos-listp)
(verify-guards pos-listp)
(defthm d-pos-listp-forward-to-true-listp
(implies (d-pos-listp x)
(true-listp x))
:rule-classes :forward-chaining)
(verify-termination-boot-strap clause-id-p) ; and guards
#+acl2-loop-only
; The above readtime conditional avoids a CLISP warning, and lets the defproxy
; for print-clause-id-okp provide the raw Lisp definition.
(encapsulate
(((print-clause-id-okp *) => * :formals (cl-id) :guard (clause-id-p cl-id)))
(local (defun print-clause-id-okp (x)
x)))
(verify-termination-boot-strap print-clause-id-okp-builtin) ; and guards
(defattach print-clause-id-okp print-clause-id-okp-builtin)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Attachments: oncep-tp
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; We could avoid the forms below by replacing the earlier forms
; (defproxy oncep-tp (* *) => *)
; (defun oncep-tp-builtin ...) ; :guard t
; (defattach (oncep-tp oncep-tp-builtin) :skip-checks t)
; in place, by changing defproxy to defstub and removing :skip-checks t.
; However, the guard on once-tp would then be left with a guard of t, which
; might be stronger than we'd like.
#+acl2-loop-only
; The above readtime conditional avoids a CLISP warning, and lets the defproxy
; for print-clause-id-okp provide the raw Lisp definition.
(encapsulate
(((oncep-tp * *) => *
:formals (rune wrld)
:guard (and (plist-worldp wrld)
; Although (runep rune wrld) is appropriate here, we don't want to fight the
; battle yet of putting runep into :logic mode. So we just lay down the
; syntactic part of its code, which should suffice for user-defined attachments
; to oncep-tp.
(and (consp rune)
(consp (cdr rune))
(symbolp (cadr rune))))))
(logic)
(local (defun oncep-tp (rune wrld)
(oncep-tp-builtin rune wrld))))
(defattach oncep-tp oncep-tp-builtin)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; verify-termination and guard verification:
; string-for-tilde-@-clause-id-phrase and some subsidiary functions
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; David Rager proved termination and guards for
; string-for-tilde-@-clause-id-phrase, with a proof that included community
; books unicode/explode-atom and unicode/explode-nonnegative-integer. Here, we
; rework that proof a bit to avoid those dependencies. Note that this proof
; depends on d-pos-listp, whose termination and guard verification are
; performed above.
; We proved true-listp-explode-nonnegative-integer here, but then found it was
; already proved locally in axioms.lisp. So we made that defthm non-local (and
; strengthened it to its current form).
(verify-termination-boot-strap chars-for-tilde-@-clause-id-phrase/periods)
(verify-termination-boot-strap chars-for-tilde-@-clause-id-phrase/primes)
(defthm pos-listp-forward-to-integer-listp
(implies (pos-listp x)
(integer-listp x))
:rule-classes :forward-chaining)
(verify-termination-boot-strap chars-for-tilde-@-clause-id-phrase)
(defthm true-listp-chars-for-tilde-@-clause-id-phrase/periods
(true-listp (chars-for-tilde-@-clause-id-phrase/periods lst))
:rule-classes :type-prescription)
(defthm true-listp-explode-atom
(true-listp (explode-atom n print-base))
:rule-classes :type-prescription)
(encapsulate
()
; The following local events create perfectly good rewrite rules, but we avoid
; the possibility of namespace clashes for existing books by making them local
; as we add them after Version_4.3.
(local
(defthm character-listp-explode-nonnegative-integer
(implies
(character-listp ans)
(character-listp (explode-nonnegative-integer n print-base ans)))))
(local
(defthm character-listp-explode-atom
(character-listp (explode-atom n print-base))
:hints ; need to disable this local lemma from axioms.lisp
(("Goal" :in-theory (disable character-listp-cdr)))))
(local
(defthm character-listp-chars-for-tilde-@-clause-id-phrase/periods
(character-listp (chars-for-tilde-@-clause-id-phrase/periods lst))))
(verify-termination-boot-strap string-for-tilde-@-clause-id-phrase))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; verify-termination and guard verification:
; strict-merge-symbol-<, strict-merge-sort-symbol-<, strict-symbol-<-sortedp,
; and sort-symbol-listp
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(verify-termination-boot-strap strict-merge-symbol-<
(declare (xargs :measure
(+ (len l1) (len l2)))))
(encapsulate
()
(local
(defthm len-strict-merge-symbol-<
(<= (len (strict-merge-symbol-< l1 l2 acc))
(+ (len l1) (len l2) (len acc)))
:rule-classes :linear))
(local
(defthm len-evens
(equal (len l)
(+ (len (evens l))
(len (odds l))))
:rule-classes :linear))
(local
(defthm symbol-listp-evens
(implies (symbol-listp x)
(symbol-listp (evens x)))
:hints (("Goal" :induct (evens x)))))
(local
(defthm symbol-listp-odds
(implies (symbol-listp x)
(symbol-listp (odds x)))))
(local
(defthm symbol-listp-strict-merge-symbol-<
(implies (and (symbol-listp l1)
(symbol-listp l2)
(symbol-listp acc))
(symbol-listp (strict-merge-symbol-< l1 l2 acc)))))
(verify-termination-boot-strap strict-merge-sort-symbol-<
(declare (xargs :measure (len l)
:verify-guards nil)))
(defthm symbol-listp-strict-merge-sort-symbol-<
; This lemma is non-local because it is needed for "make proofs", for
; guard-verification for new-verify-guards-fns1.
(implies (symbol-listp x)
(symbol-listp (strict-merge-sort-symbol-< x))))
(verify-guards strict-merge-sort-symbol-<)
(verify-termination-boot-strap strict-symbol-<-sortedp) ; and guards
(verify-termination-boot-strap sort-symbol-listp) ; and guards
)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Theories
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(deftheory definition-minimal-theory
(definition-runes
*definition-minimal-theory*
nil
world))
(deftheory executable-counterpart-minimal-theory
(definition-runes
*built-in-executable-counterparts*
t
world))
(deftheory minimal-theory
; Warning: The resulting value must be a runic-theoryp. See
; theory-fn-callp.
; Keep this definition in sync with translate-in-theory-hint.
(union-theories (theory 'definition-minimal-theory)
(union-theories
; Without the :executable-counterpart of force, the use of (theory
; 'minimal-theory) will produce the warning "Forcing has transitioned
; from enabled to disabled", at least if forcing is enabled (as is the
; default).
'((:executable-counterpart force))
(theory 'executable-counterpart-minimal-theory))))
; See the Essay on the Status of the Tau System During and After Bootstrapping
; in axioms.lisp where we discuss choices (1.a), (1.b), (2.a) and (2.b)
; related to the status of the tau system. Here is where we implement
; (2.a).
(in-theory (if (cadr *tau-status-boot-strap-settings*) ; (2.a)
(enable (:executable-counterpart tau-system))
(disable (:executable-counterpart tau-system))))
(deftheory ground-zero
; WARNING: Keep this near the end of *acl2-pass-2-files* in order for
; the ground-zero theory to be as expected.
(current-theory :here))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; meta-extract support
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(verify-termination-boot-strap formals) ; and guards
(verify-termination-boot-strap constraint-info) ; and guards
(defund meta-extract-formula (name state)
; This function supports meta-extract-global-fact+. It needs to be executable
; and in :logic mode (hence, as required by the ACL2 build process,
; guard-verified), since it may be called by meta functions.
; While this function can be viewed as a version of formula, it applies only to
; symbols (not runes), it is in :logic mode, and there are a few other
; differences as well. The present function requires name to be a symbol and
; only returns a normalp=nil form of body. (Otherwise, in order to put body in
; :logic mode, body would need to be guard-verified, which would probably take
; considerable effort.)
(declare (xargs :stobjs state
:guard (symbolp name)))
(let ((wrld (w state)))
(or (getprop name 'theorem nil 'current-acl2-world wrld)
(mv-let (flg prop)
(constraint-info name wrld)
(cond ((eq prop *unknown-constraints*)
*t*)
(flg (ec-call (conjoin prop)))
(t prop))))))
(verify-termination-boot-strap type-set-quote)
(verify-guards type-set-quote)
(defun typespec-check (ts x)
(declare (xargs :guard (integerp ts)))
(if (bad-atom x)
(< ts 0) ; bad-atom type intersects every complement type
; We would like to write
; (ts-subsetp (type-set-quote x) ts)
; here, but for that we need a stronger guard than (integerp ts), and we prefer
; to keep this simple.
(not (eql 0 (logand (type-set-quote x) ts)))))
(defun meta-extract-rw+-term (term alist equiv rhs state)
; This function supports the function meta-extract-contextual-fact. Neither of
; these functions is intended to be executed.
; Meta-extract-rw+-term creates (logically) a term claiming that term under
; alist is equiv to rhs, where equiv=nil represents 'equal and equiv=t
; represents 'iff. If equiv is not t, nil, or an equivalence relation, then
; *t* is returned.
; Note that this function does not support the use of a geneqv for the equiv
; argument.
(declare (xargs :mode :program ; becomes :logic with system-verify-guards
:stobjs state
:guard (and (symbol-alistp alist)
(pseudo-term-listp (strip-cdrs alist))
(pseudo-termp term))))
(non-exec
(let ((lhs (sublis-var alist term)))
(case equiv
((nil) `(equal ,lhs ,rhs))
((t) `(iff ,lhs ,rhs))
(otherwise
(if (symbolp equiv)
(if (equivalence-relationp equiv (w state))
`(,equiv ,lhs ,rhs)
; else bad equivalence relation
*t*)
*t*))))))
(defun meta-extract-contextual-fact (obj mfc state)
; This function is not intended to be executed.
; This function may be called in the hypothesis of a meta rule, because we know
; it always produces a term that evaluates to non-nil under the mfc where the
; metafunction is called, using the specific alist A for which we're proving
; (evl x a) = (evl (metafn x) a). The terms it produces reflect the
; correctness of certain prover operations -- currently, accessing type-alist
; and typeset information, rewriting, and linear arithmetic. See the Essay on
; Correctness of Meta Reasoning. Note that these operations use the state for
; heuristic purposes, and get their logical information from the world stored
; in mfc (not in state).
; This function avoids forcing and does not return a tag-tree.
(declare (xargs :mode :program ; becomes :logic with system-verify-guards
:stobjs state))
(non-exec
(case-match obj
((':typeset term . &) ; mfc-ts produces correct results
`(typespec-check
',(mfc-ts term mfc state :forcep nil :ttreep nil)
,term))
((':rw+ term alist obj equiv . &) ; result is equiv to term/alist.
(meta-extract-rw+-term term alist equiv
(mfc-rw+ term alist obj equiv mfc state
:forcep nil :ttreep nil)
state))
((':rw term obj equiv . &) ; as for :rw+, with alist of nil
(meta-extract-rw+-term term nil equiv
(mfc-rw term obj equiv mfc state
:forcep nil :ttreep nil)
state))
((':ap term . &) ; Can linear arithmetic can falsify term?
(if (mfc-ap term mfc state :forcep nil)
`(not ,term)
*t*))
((':relieve-hyp hyp alist rune target bkptr . &) ; hyp/alist proved?
(if (mfc-relieve-hyp hyp alist rune target bkptr mfc state
:forcep nil :ttreep nil)
(sublis-var alist hyp)
*t*))
(& *t*))))
(defun rewrite-rule-term (x)
; This function is not intended to be executed. It turns a rewrite-rule record
; into a term.
(declare (xargs :guard t))
(non-exec
(if (eq (access rewrite-rule x :subclass) 'meta)
*t*
`(implies ,(conjoin (access rewrite-rule x :hyps))
(,(access rewrite-rule x :equiv)
,(access rewrite-rule x :lhs)
,(access rewrite-rule x :rhs))))))
(defmacro meta-extract-global-fact (obj state)
; See meta-extract-global-fact+.
`(meta-extract-global-fact+ ,obj ,state ,state))
(defun fncall-term (fn arglist state)
(declare (xargs :stobjs state
:guard (true-listp arglist)))
(mv-let (erp val)
(magic-ev-fncall fn arglist state
t ; hard-error-returns-nilp
nil ; aok
)
(cond (erp *t*)
(t (fcons-term* 'equal
; As suggested by Sol Swords, we use fcons-term below in order to avoid having
; to reason about the application of an evaluator to (cons-term fn ...).
(fcons-term fn (kwote-lst arglist))
(kwote val))))))
(defun logically-equivalent-states (st1 st2)
(declare (xargs :guard t))
(non-exec (equal (w st1) (w st2))))
(defun meta-extract-global-fact+ (obj st state)
; This function is not intended to be executed.
; This function may be called in the hypothesis of a meta rule, because we know
; it always produces a term that evaluates to non-nil for any alist. The terms
; it produces reflect the correctness of certain facts stored in the world.
; See the Essay on Correctness of Meta Reasoning.
(declare (xargs :mode :program ; becomes :logic with system-verify-guards
:stobjs state))
(non-exec
(cond
((logically-equivalent-states st state)
(case-match obj
((':formula name)
(meta-extract-formula name st))
((':lemma fn n)
(let* ((lemmas (getprop fn 'lemmas nil 'current-acl2-world (w st)))
(rule (nth n lemmas)))
; The use of rewrite-rule-term below relies on the fact that the 'LEMMAS
; property of a symbol in the ACL2 world is a list of rewrite-rule records that
; reflect known facts.
(if (< (nfix n) (len lemmas))
(rewrite-rule-term rule)
*t*))) ; Fn doesn't exist or n is too big.
((':fncall fn arglist)
(non-exec ; avoid guard check
(fncall-term fn arglist st)))
(& *t*)))
(t *t*))))
(add-macro-alias meta-extract-global-fact meta-extract-global-fact+)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Support for system-verify-guards
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; This section supports a mechanism for users to extend the set of
; guard-verified functions. They do so in community books under books/system/,
; which are checked when building with feature :acl2-devel, for example
; building with `make' with ACL2_DEVEL=d. But normal builds will not set that
; feature, and will simply trust that functions marked in
; *system-verify-guards-alist* can be guard-verified.
; A flaw in our approach is that user-supplied guard verifications may depend
; on package axioms. Thus, we view such verifications as strong hints, rather
; than as ironclad guarantees that the functions can be guard-verified in
; definitional (or even conservative) extensions of the ground-zero theory. We
; consider this sufficient, as the event that some package axiom will cause
; such bogus marking as guard-verified seems much less likely than the event
; that our system has other serious bugs!
(verify-termination-boot-strap safe-access-command-tuple-form) ; and guards
(defun pair-fns-with-measured-subsets (fns wrld acc)
(declare (xargs :guard (and (symbol-listp fns)
(plist-worldp wrld)
(true-listp acc))))
(cond ((endp fns) (reverse acc))
(t (pair-fns-with-measured-subsets
(cdr fns)
wrld
(cons (let* ((fn (car fns))
(justification (getprop fn 'justification nil
'current-acl2-world wrld))
(ms (and (consp justification) ; for guard
(consp (cdr justification)) ; for guard
(access justification justification :subset))))
(cons fn ms))
acc)))))
(defun new-verify-guards-fns1 (wrld installed-wrld acc)
(declare (xargs :guard (and (plist-worldp wrld)
(plist-worldp installed-wrld)
(symbol-listp acc))))
(cond ((or (endp wrld)
(and (eq (caar wrld) 'command-landmark)
(eq (cadar wrld) 'global-value)
(equal (safe-access-command-tuple-form (cddar wrld))
'(exit-boot-strap-mode))))
(pair-fns-with-measured-subsets
(strict-merge-sort-symbol-< acc)
installed-wrld
nil))
((and (eq (cadar wrld) 'symbol-class)
(eq (cddar wrld) :COMMON-LISP-COMPLIANT)
(getprop (caar wrld) 'predefined nil 'current-acl2-world
installed-wrld))
(new-verify-guards-fns1 (cdr wrld)
installed-wrld
(cons (caar wrld) acc)))
(t (new-verify-guards-fns1 (cdr wrld) installed-wrld acc))))
(defun new-verify-guards-fns (state)
; It is important for performance that this function be guard-verified, because
; it is called inside an assert-event form in chk-new-verified-guards, which
; causes evaluation to be in safe-mode and would cause evaluation of
; plist-worldp on behalf of guard-checking for new-verify-guards-fns1.
(declare (xargs :stobjs state))
(let ((wrld (w state)))
(new-verify-guards-fns1 wrld wrld nil)))
(defconst *system-verify-guards-alist*
; Each cdr was produced by evaluating
; (new-verify-guards-fns state)
; after including the book indicated in the car in a build with feature
; :acl2-devel set (see discussion in the comment at the top of this section).
; For example, cdr of the entry for "system/top" is produced by evaluating:
; (include-book "system/top" :dir :system).
; The indicated books need to be certified using an ACL2 executable that was
; built with feature :acl2-devel set, but this takes about 2.5 minutes on a
; fast machine in Feb. 2013, as follows:
; make -j 8 regression ACL2_BOOK_DIRS=system ACL2=<:acl2-devel version>
; Each member of each cdr below is of the form (fn . measured-subset).
; Note that it is not necessary to do a full regression with an :acl2-devel
; executable; only the books in the keys of this alist need to be certified.
'(("system/top"
(ARGLISTP)
(ARGLISTP1 LST)
(CONS-TERM1-MV2)
(DUMB-NEGATE-LIT)
(FETCH-DCL-FIELD)
(FETCH-DCL-FIELDS LST)
(FETCH-DCL-FIELDS1 LST)
(FETCH-DCL-FIELDS2 KWD-LIST)
(FIND-DOT-DOT I FULL-PATHNAME)
(FIND-FIRST-BAD-ARG ARGS)
(LAMBDA-KEYWORDP)
(LEGAL-CONSTANTP1)
(LEGAL-VARIABLE-OR-CONSTANT-NAMEP)
(LEGAL-VARIABLEP)
(META-EXTRACT-CONTEXTUAL-FACT)
(META-EXTRACT-GLOBAL-FACT+)
(META-EXTRACT-RW+-TERM)
#+acl2-legacy-doc (MISSING-FMT-ALIST-CHARS)
#+acl2-legacy-doc (MISSING-FMT-ALIST-CHARS1 CHAR-TO-TILDE-S-STRING-ALIST)
(PLAUSIBLE-DCLSP LST)
(PLAUSIBLE-DCLSP1 LST)
(STRIP-DCLS LST)
(STRIP-DCLS1 LST)
(STRIP-KEYWORD-LIST LST)
(SUBCOR-VAR FORM)
(SUBCOR-VAR-LST FORMS)
(SUBCOR-VAR1 VARS)
(SUBLIS-VAR)
(SUBLIS-VAR-LST)
(SUBLIS-VAR1 FORM)
(SUBLIS-VAR1-LST L)
(SUBST-EXPR)
(SUBST-EXPR-ERROR)
(SUBST-EXPR1 TERM)
(SUBST-EXPR1-LST ARGS)
(SUBST-VAR FORM)
(SUBST-VAR-LST L))))
(defconst *len-system-verify-guards-alist*
(length *system-verify-guards-alist*))
(defmacro chk-new-verified-guards (n)
(cond
((or (not (natp n))
(> n *len-system-verify-guards-alist*))
`(er soft 'chk-new-verified-guards
"The index ~x0 is not a valid index for *system-verify-guards-alist*."
',n))
((eql n *len-system-verify-guards-alist*)
'(value-triple :CHK-NEW-VERIFIED-GUARDS-COMPLETE))
(t
(let* ((pair (nth n *system-verify-guards-alist*))
(user-book-name (car pair))
(fns (cdr pair)))
`(progn (include-book ,user-book-name
:DIR :SYSTEM
:UNCERTIFIED-OKP nil
:DEFAXIOMS-OKP nil
:SKIP-PROOFS-OKP nil
:TTAGS nil)
(assert-event
(equal ',fns
(new-verify-guards-fns state))
:msg (msg "ERROR: The set of newly guard-verified functions ~
from the ACL2 community book ~x0 does not match the ~
expected set from the constant ~
*system-verify-guards-alist*.~|~%From the ~
book:~|~X13~|~%Expected from ~
*system-verify-guards-alist*:~|~X23~|"
',user-book-name
(new-verify-guards-fns state)
',fns
nil))
(value-triple :CHK-NEW-VERIFIED-GUARDS-SUCCESS))))))
(defun system-verify-guards-fn-1 (fns-alist acc)
(declare (xargs :guard (symbol-alistp fns-alist)))
(cond ((endp fns-alist) acc)
(t (system-verify-guards-fn-1
(cdr fns-alist)
(cons `(skip-proofs (verify-termination-boot-strap ; and guards
,(caar fns-alist)
,@(let ((ms (cdar fns-alist)))
(and ms
`((declare (xargs :measure
(:? ,@ms))))))))
acc)))))
(defun cons-absolute-event-numbers (fns-alist wrld acc)
(declare (xargs :guard (and (symbol-alistp fns-alist)
(plist-worldp wrld)
(alistp acc))))
(cond ((endp fns-alist) acc)
(t (cons-absolute-event-numbers
(cdr fns-alist)
wrld
(acons (or (getprop (caar fns-alist) 'absolute-event-number nil
'current-acl2-world wrld)
(er hard? 'cons-absolute-event-numbers
"The 'absolute-event-number property is missing ~
for ~x0."
(caar fns-alist)))
(car fns-alist)
acc)))))
(defun sort->-absolute-event-number (fns-alist wrld)
(declare (xargs :mode :program)) ; because of merge-sort-car->
(strip-cdrs (merge-sort-car->
(cons-absolute-event-numbers fns-alist wrld nil))))
(defun system-verify-guards-fn (alist wrld acc)
(declare (xargs :mode :program)) ; because of sort->-absolute-event-number
(cond ((endp alist) acc)
(t (system-verify-guards-fn
(cdr alist)
wrld
(system-verify-guards-fn-1
(sort->-absolute-event-number (cdar alist) wrld)
acc)))))
(defmacro system-verify-guards ()
`(make-event
(let ((events (system-verify-guards-fn *system-verify-guards-alist*
(w state)
nil)))
(list* 'encapsulate
()
'(set-verify-guards-eagerness 2)
events))))
; Normally we go ahead and trust *system-verify-guards-alist*, installing
; guard-verified functions with the following form. But when feature
; :acl2-devel is set, then we do not do so, as we instead intend to run
; (chk-new-verified-guards i) for each i less than the length of
; *system-verify-guards-alist*, in order to check that the effect of
; system-verify-guards is sound. This check is performed by using `make' with
; target devel-check, for example as follows, where <acl2d> denotes a full
; pathname for a build of ACL2 using feature :acl2-devel (see comments above
; for how to make such a build):
; (time nice make -j 8 regression-fresh devel-check ACL2=<acl2d>)
#+(and acl2-loop-only ; Note that make-event can't be called here in raw Lisp.
(not acl2-devel))
(system-verify-guards)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Memoization
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
#+(and hons acl2-loop-only)
(progn
; We skip raw Lisp functions here; see *thread-unsafe-builtin-memoizations*.
(memoize 'fchecksum-obj :stats nil :forget t)
(memoize 'expansion-alist-pkg-names-memoize :stats nil :forget t)
; Comment on memoizing a worse-than function:
; In Version_7.0 and several preceding versions, we memoized a "worse-than"
; function as follows.
; (memoize 'worse-than-builtin-memoized :stats nil)
; We now use a clocked version of worse-than and avoid such memoization. See
; worse-than-builtin-clocked for comments about potential memoization.
; To restore such memoization, search for every occurrence of
; "Comment on memoizing a worse-than function".
; Below, we discuss some earlier experiments on memoizing worse-than-builtin or
; the like, on two particular community books:
; - books/coi/dtrees/base.lisp does not benefit from memoization of worse-than
; functions, and can be slowed down by it.
; - books/centaur/esim/stv/stv2c/stv2c.lisp requires memoization of
; worse-than-builtin (or the like) to avoid stalling out in a proof.
; Below we look at some results for the first of these books, using Version_7.0
; except (where indicated below) a development version that was close to
; Version_7.0.
; Except where indicated otherwise, we memoized worse-than-builtin for
; experiments below as follows.
; (memoize 'worse-than-builtin
; :stats nil
; :condition ; Sol Swords suggestion
; '(and (nvariablep term1)
; (not (fquotep term1))
; (nvariablep term2)
; (not (fquotep term2))))
; Specifically, we ran the following commands in the above book's directory.
; (ld "cert.acl2")
; (rebuild "base.lisp" t)
; (in-package "DTREE")
; (ubt! 'aux-domain-of-dtreemapfix)
; (skip-proofs (defthm lemma
; (implies (set::in a (aux-domain (dtreemapfix map)))
; (set::in a (aux-domain map)))))
; In some cases we also ran the following command or the following two commands
; after the commands above but before evaluating the defthm shown below:
; (acl2::unmemoize 'acl2::worse-than-builtin)
; #!acl2(memoize 'worse-than-builtin
; :stats nil
; :forget t
; :condition ; Sol Swords suggestion
; '(and (nvariablep term1)
; (not (fquotep term1))
; (nvariablep term2)
; (not (fquotep term2))))
; Then we submitted the following event.
; (defthm lemma2-for-aux-domain-of-dtreemapfix
; (implies (set::in a (aux-domain map))
; (set::in a (aux-domain (dtreemapfix map)))))
; Times and memory use (last two reports from top) from some experiments are
; shown below. The key is that all runs with worse-than unmemoized were
; significantly faster than all runs with worse-than memoized, regardless of
; various attempts to speed up that memoization.
; With GCL, out of the box:
; Time: 122.34 seconds (prove: 122.33, print: 0.01, other: 0.00)
; 11959 kaufmann 20 0 15.3g 2.8g 53m R 100 9.0 2:05.29 gcl-saved_acl2h
; 11959 kaufmann 20 0 15.3g 2.8g 53m S 21 9.0 2:05.92 gcl-saved_acl2h
; With GCL, after the above unmemoize form:
; Time: 78.72 seconds (prove: 78.72, print: 0.00, other: 0.00)
; 11934 kaufmann 20 0 13.2g 854m 53m R 100 2.7 1:18.68 gcl-saved_acl2h
; 11934 kaufmann 20 0 13.2g 854m 53m S 98 2.7 1:21.64 gcl-saved_acl2h
; With GCL, after the above sequence of unmemoize and memoize:
; Time: 94.45 seconds (prove: 94.44, print: 0.01, other: 0.00)
; 11995 kaufmann 20 0 13.8g 727m 53m R 100 2.3 1:35.62 gcl-saved_acl2h
; 11995 kaufmann 20 0 13.8g 727m 53m S 62 2.3 1:37.47 gcl-saved_acl2h
; With CCL, out of the box:
; Time: 131.46 seconds (prove: 131.42, print: 0.04, other: 0.00)
; 12044 kaufmann 20 0 512g 1.8g 17m S 100 5.6 2:10.31 lx86cl64
; 12044 kaufmann 20 0 512g 1.8g 17m S 81 5.6 2:12.73 lx86cl64
; With CCL, after the above unmemoize form:
; Time: 89.83 seconds (prove: 89.82, print: 0.00, other: 0.00)
; 12068 kaufmann 20 0 512g 1.3g 17m S 99 4.2 1:29.91 lx86cl64
; 12068 kaufmann 20 0 512g 1.4g 17m S 40 4.4 1:31.12 lx86cl64
; With CCL, after the above sequence of unmemoize and memoize:
; Time: 147.46 seconds (prove: 147.44, print: 0.02, other: 0.00)
; 12093 kaufmann 20 0 512g 804m 18m S 100 2.5 2:27.86 lx86cl64
; 12093 kaufmann 20 0 512g 1.0g 18m S 30 3.2 2:28.77 lx86cl64
; All of the above were run with EGC off (the default at the time). Now we
; repeat some of the above tests, but after turning EGC on as follows.
; (acl2::value :q) (ccl::egc t) (acl2::lp)
; With CCL, out of the box:
; Time: 1439.72 seconds (prove: 1439.71, print: 0.01, other: 0.00)
; 12127 kaufmann 20 0 512g 3.0g 35m S 100 9.4 23:58.68 lx86cl64
; 12127 kaufmann 20 0 512g 3.0g 35m S 78 9.4 24:01.03 lx86cl64
; With CCL, after the above unmemoize form:
; Time: 87.27 seconds (prove: 87.26, print: 0.01, other: 0.00)
; 12362 kaufmann 20 0 512g 407m 35m S 100 1.3 1:25.72 lx86cl64
; 12362 kaufmann 20 0 512g 417m 35m S 93 1.3 1:28.51 lx86cl64
; With CCL, after the above sequence of unmemoize and memoize:
; Time: 135.92 seconds (prove: 135.90, print: 0.02, other: 0.00)
; 12384 kaufmann 20 0 512g 705m 36m S 0 2.2 2:17.39 lx86cl64
; 12384 kaufmann 20 0 512g 705m 36m S 0 2.2 2:17.40 lx86cl64
; As just above, but after redefining waterfall1 in raw Lisp so that its
; body is (prog2$ (clear-memoize-table 'worse-than-builtin) <old-body>)
; Time: 134.38 seconds (prove: 134.37, print: 0.02, other: 0.00)
; 12631 kaufmann 20 0 512g 691m 36m S 99 2.1 2:14.64 lx86cl64
; 12631 kaufmann 20 0 512g 698m 36m S 38 2.2 2:15.79 lx86cl64
; All of the above used ACL2 Version_7.0. The tests below were run with a
; development copy as of 1/21/2015 (a mere 9 days after the release of 7.0).
; We continue to turn EGC on at the start, as above.
; With CCL, after the above sequence of unmemoize and memoize:
; Time: 135.80 seconds (prove: 135.79, print: 0.01, other: 0.00)
; 13018 kaufmann 20 0 512g 664m 36m S 99 2.1 2:15.91 lx86cl64
; 13018 kaufmann 20 0 512g 671m 36m S 42 2.1 2:17.16 lx86cl64
; With CCL executable built without start-sol-gc and with EGC on,
; after the above sequence of unmemoize and memoize:
; Time: 136.47 seconds (prove: 136.45, print: 0.02, other: 0.00)
; 13049 kaufmann 20 0 512g 59m 36m S 99 0.2 2:14.93 lx86cl64
; 13049 kaufmann 20 0 512g 59m 36m S 96 0.2 2:17.81 lx86cl64
; With CCL executable built without start-sol-gc and with EGC on,
; after the above unmemoize form:
; Time: 86.33 seconds (prove: 86.33, print: 0.01, other: 0.00)
; 13178 kaufmann 20 0 512g 58m 35m S 100 0.2 1:27.18 lx86cl64
; 13178 kaufmann 20 0 512g 58m 35m S 17 0.2 1:27.70 lx86cl64
; With CCL executable built without start-sol-gc and with EGC on, out of the
; box except for redefining waterfall1 in raw Lisp so that its body is (prog2$
; (clear-memoize-table 'worse-than-builtin) <old-body>); notice that :forget
; remains nil.
; Time: 182.61 seconds (prove: 182.58, print: 0.02, other: 0.00)
; 13135 kaufmann 20 0 512g 137m 17m S 100 0.4 3:02.78 lx86cl64
; 13135 kaufmann 20 0 512g 137m 17m S 37 0.4 3:03.90 lx86cl64
)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; End
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(deflabel
; WARNING: Put this at the end of the last file in
; *acl2-pass-2-files*.
end-of-pass-2)
|