Tue, 20 Feb 2001 11:27:04 +0100 *** empty log message ***
nipkow [Tue, 20 Feb 2001 11:27:04 +0100] rev 11160
*** empty log message ***
Tue, 20 Feb 2001 10:37:12 +0100 *** empty log message ***
nipkow [Tue, 20 Feb 2001 10:37:12 +0100] rev 11159
*** empty log message ***
Tue, 20 Feb 2001 10:18:26 +0100 *** empty log message ***
nipkow [Tue, 20 Feb 2001 10:18:26 +0100] rev 11158
*** empty log message ***
Sat, 17 Feb 2001 10:43:53 +0100 *** empty log message ***
nipkow [Sat, 17 Feb 2001 10:43:53 +0100] rev 11157
*** empty log message ***
Fri, 16 Feb 2001 18:51:19 +0100 fixed the obvious errors Tobias found
paulson [Fri, 16 Feb 2001 18:51:19 +0100] rev 11156
fixed the obvious errors Tobias found
Fri, 16 Feb 2001 18:50:09 +0100 Least_def now refers to LeastM
paulson [Fri, 16 Feb 2001 18:50:09 +0100] rev 11155
Least_def now refers to LeastM
Fri, 16 Feb 2001 13:47:06 +0100 for the change to LEAST
paulson [Fri, 16 Feb 2001 13:47:06 +0100] rev 11154
for the change to LEAST
Fri, 16 Feb 2001 13:37:21 +0100 Blast bug fix made old proof too slow
paulson [Fri, 16 Feb 2001 13:37:21 +0100] rev 11153
Blast bug fix made old proof too slow
Fri, 16 Feb 2001 13:29:07 +0100 Blast bug fix: now always duplicates when applying a haz rule,
paulson [Fri, 16 Feb 2001 13:29:07 +0100] rev 11152
Blast bug fix: now always duplicates when applying a haz rule, whether or not new variables are added. Can now prove theorems such as these: val prems = Goal "[|P==>Q; P==>~Q|] ==> ~P"; by (blast_tac (claset() addDs prems) 1); val prems = Goal "[|Q==>P; ~Q==>P|] ==> P"; by (blast_tac (claset() addIs prems) 1);
Fri, 16 Feb 2001 13:27:56 +0100 Blast bug fix made old proof too slow
paulson [Fri, 16 Feb 2001 13:27:56 +0100] rev 11151
Blast bug fix made old proof too slow
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip