Mon, 29 Mar 2010 09:47:21 +0200 documented [[trace_simp=true]]
nipkow [Mon, 29 Mar 2010 09:47:21 +0200] rev 36069
documented [[trace_simp=true]]
Thu, 01 Apr 2010 11:12:08 +0200 add missing goal argument
blanchet [Thu, 01 Apr 2010 11:12:08 +0200] rev 36068
add missing goal argument
Thu, 01 Apr 2010 10:54:21 +0200 adapt syntax of Sledgehammer options in examples
blanchet [Thu, 01 Apr 2010 10:54:21 +0200] rev 36067
adapt syntax of Sledgehammer options in examples
Thu, 01 Apr 2010 10:27:06 +0200 merged
blanchet [Thu, 01 Apr 2010 10:27:06 +0200] rev 36066
merged
Thu, 01 Apr 2010 10:26:45 +0200 fixed layout of Sledgehammer output
blanchet [Thu, 01 Apr 2010 10:26:45 +0200] rev 36065
fixed layout of Sledgehammer output
Mon, 29 Mar 2010 19:49:57 +0200 added "modulus" and "sorts" options to control Sledgehammer's Isar proof output
blanchet [Mon, 29 Mar 2010 19:49:57 +0200] rev 36064
added "modulus" and "sorts" options to control Sledgehammer's Isar proof output
Mon, 29 Mar 2010 18:44:24 +0200 make Sledgehammer output "by" vs. "apply", "qed" vs. "next", and any necessary "prefer"
blanchet [Mon, 29 Mar 2010 18:44:24 +0200] rev 36063
make Sledgehammer output "by" vs. "apply", "qed" vs. "next", and any necessary "prefer"
Mon, 29 Mar 2010 15:50:18 +0200 get rid of Polyhash, since it's no longer used
blanchet [Mon, 29 Mar 2010 15:50:18 +0200] rev 36062
get rid of Polyhash, since it's no longer used
Mon, 29 Mar 2010 15:26:19 +0200 remove use of Polyhash;
blanchet [Mon, 29 Mar 2010 15:26:19 +0200] rev 36061
remove use of Polyhash; the new code is slightly faster. Also, "subtract_cls" now has canonical argument ordering.
Mon, 29 Mar 2010 14:49:53 +0200 reintroduce efficient set structure to collect "no_atp" theorems
blanchet [Mon, 29 Mar 2010 14:49:53 +0200] rev 36060
reintroduce efficient set structure to collect "no_atp" theorems
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip