Wed, 07 Apr 2010 20:40:42 +0200 shortened interface (do not export unused options and functions)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36085
shortened interface (do not export unused options and functions)
Wed, 07 Apr 2010 20:40:42 +0200 always unfold definitions of specific constants (including special binders)
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36084
always unfold definitions of specific constants (including special binders)
Wed, 07 Apr 2010 20:40:42 +0200 shorten the code by conditional function application
boehmes [Wed, 07 Apr 2010 20:40:42 +0200] rev 36083
shorten the code by conditional function application
Wed, 07 Apr 2010 20:38:11 +0200 fail for problems containg the universal sort (as those problems cannot be atomized)
boehmes [Wed, 07 Apr 2010 20:38:11 +0200] rev 36082
fail for problems containg the universal sort (as those problems cannot be atomized)
Wed, 07 Apr 2010 19:48:58 +0200 renamed "smt_record" to "smt_fixed" (somewhat more expressive) and inverted its semantics
boehmes [Wed, 07 Apr 2010 19:48:58 +0200] rev 36081
renamed "smt_record" to "smt_fixed" (somewhat more expressive) and inverted its semantics
Wed, 07 Apr 2010 17:24:44 +0200 Added Information theory and Example: dining cryptographers
hoelzl [Wed, 07 Apr 2010 17:24:44 +0200] rev 36080
Added Information theory and Example: dining cryptographers
Wed, 07 Apr 2010 11:05:11 +0200 simplified induction case in finite_psubset_induct; tuned the proof that uses this induction principle
Christian Urban <urbanc@in.tum.de> [Wed, 07 Apr 2010 11:05:11 +0200] rev 36079
simplified induction case in finite_psubset_induct; tuned the proof that uses this induction principle
Tue, 06 Apr 2010 11:00:57 +0200 removed (latex output) notation which is sometimes very ugly
krauss [Tue, 06 Apr 2010 11:00:57 +0200] rev 36078
removed (latex output) notation which is sometimes very ugly
Tue, 06 Apr 2010 10:48:16 +0200 merged
boehmes [Tue, 06 Apr 2010 10:48:16 +0200] rev 36077
merged
Tue, 06 Apr 2010 10:46:28 +0200 added missing mult_1_left to linarith simp rules
boehmes [Tue, 06 Apr 2010 10:46:28 +0200] rev 36076
added missing mult_1_left to linarith simp rules
Tue, 06 Apr 2010 09:27:03 +0200 tuned proof (no induction needed); removed unused lemma and fuzzy comment
krauss [Tue, 06 Apr 2010 09:27:03 +0200] rev 36075
tuned proof (no induction needed); removed unused lemma and fuzzy comment
Fri, 02 Apr 2010 17:20:43 +0200 isatest: basic setup for cygwin-poly on atbroy102;
wenzelm [Fri, 02 Apr 2010 17:20:43 +0200] rev 36074
isatest: basic setup for cygwin-poly on atbroy102;
Thu, 01 Apr 2010 15:37:30 +0200 slightly more standard dependencies;
wenzelm [Thu, 01 Apr 2010 15:37:30 +0200] rev 36073
slightly more standard dependencies;
Thu, 01 Apr 2010 12:19:37 +0200 merged
nipkow [Thu, 01 Apr 2010 12:19:37 +0200] rev 36072
merged
Thu, 01 Apr 2010 12:19:20 +0200 tuned many proofs a bit
nipkow [Thu, 01 Apr 2010 12:19:20 +0200] rev 36071
tuned many proofs a bit
Thu, 01 Apr 2010 09:31:58 +0200 merged
nipkow [Thu, 01 Apr 2010 09:31:58 +0200] rev 36070
merged
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
Mon, 29 Mar 2010 12:21:51 +0200 made "theory_const" a Sledgehammer option;
blanchet [Mon, 29 Mar 2010 12:21:51 +0200] rev 36059
made "theory_const" a Sledgehammer option; by default, it's true for SPASS and false for the others. This eliminates the need for the "spass_no_tc" ATP, which can be obtained by passing "no_theory_const" instead.
Mon, 29 Mar 2010 12:01:00 +0200 added "respect_no_atp" and "convergence" options to Sledgehammer;
blanchet [Mon, 29 Mar 2010 12:01:00 +0200] rev 36058
added "respect_no_atp" and "convergence" options to Sledgehammer; these were previously hard-coded in "sledgehammer_fact_filter.ML"
Wed, 31 Mar 2010 16:44:41 +0200 adding MREC induction rule in Imperative HOL
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36057
adding MREC induction rule in Imperative HOL
Wed, 31 Mar 2010 16:44:41 +0200 made smlnj happy
bulwahn [Wed, 31 Mar 2010 16:44:41 +0200] rev 36056
made smlnj happy
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip