| Thu, 17 Oct 2013 10:29:28 +0200 |
blanchet |
graceful handling of abort
|
changeset |
files
|
| Thu, 17 Oct 2013 10:06:48 +0200 |
panny |
generalized interface
|
changeset |
files
|
| Thu, 17 Oct 2013 02:29:49 +0200 |
blanchet |
choose facts to reprove more randomly, to avoid getting stuck with impossible problems at first
|
changeset |
files
|
| Thu, 17 Oct 2013 02:22:54 +0200 |
blanchet |
thread the goal through instead of relying on unreliable (possibly fake) state
|
changeset |
files
|
| Thu, 17 Oct 2013 01:34:34 +0200 |
blanchet |
added comment
|
changeset |
files
|
| Thu, 17 Oct 2013 01:22:15 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Thu, 17 Oct 2013 01:20:40 +0200 |
blanchet |
verbose minimization when learning from ATP proofs
|
changeset |
files
|
| Thu, 17 Oct 2013 01:10:08 +0200 |
blanchet |
if slicing is disabled, pick the maximum number of facts, not the number of facts in the last slice
|
changeset |
files
|
| Thu, 17 Oct 2013 01:04:00 +0200 |
blanchet |
if slicing is disabled, don't enforce last slice's "max_facts", but rather the maximum "max_facts"
|
changeset |
files
|
| Thu, 17 Oct 2013 01:03:59 +0200 |
blanchet |
fast track -- avoid domain error in 0 case
|
changeset |
files
|
| Thu, 17 Oct 2013 01:03:59 +0200 |
blanchet |
remove overloading of "max_facts" -- it already controls the number of facts passed to ATPs for 'learn_prover'
|
changeset |
files
|
| Wed, 16 Oct 2013 21:45:15 +0200 |
nipkow |
merged
|
changeset |
files
|
| Wed, 16 Oct 2013 21:44:56 +0200 |
nipkow |
tuned exercises
|
changeset |
files
|
| Wed, 16 Oct 2013 20:44:33 +0200 |
panny |
use Code.abort instead of undefined in auto-generated equations
|
changeset |
files
|
| Wed, 16 Oct 2013 19:55:23 +0200 |
blanchet |
have MaSh minimize
|
changeset |
files
|
| Tue, 15 Oct 2013 23:00:46 +0200 |
blanchet |
tweaked signature
|
changeset |
files
|
| Tue, 15 Oct 2013 22:55:01 +0200 |
blanchet |
strengthened tactic to deal with 'False ==> ...'
|
changeset |
files
|
| Tue, 15 Oct 2013 17:21:16 +0200 |
blanchet |
made theorem extraction code not delve too far when looking at local fact, by relying on 'strip_thm' instead of (wrongly) reverse-engineering proof terms
|
changeset |
files
|
| Tue, 15 Oct 2013 16:14:52 +0200 |
blanchet |
improved duplicate detection in "build_name_tables" by ensuring that the earliest occurrence of a duplicate (if it exists) gets picked as the canonical instance
|
changeset |
files
|
| Tue, 15 Oct 2013 15:31:32 +0200 |
blanchet |
updated S/H docs
|
changeset |
files
|
| Tue, 15 Oct 2013 15:31:18 +0200 |
blanchet |
use MePo with Auto Sledgehammer, because it's lighter than MaSh and always available
|
changeset |
files
|
| Tue, 15 Oct 2013 15:26:58 +0200 |
blanchet |
drop only real duplicates, not subsumed facts -- this confuses MaSh
|
changeset |
files
|
| Tue, 15 Oct 2013 11:49:39 +0100 |
paulson |
renamed relcomp_def to relcomp_unfold
|
changeset |
files
|
| Tue, 15 Oct 2013 12:25:45 +0200 |
nipkow |
fixed thm names
|
changeset |
files
|
| Tue, 15 Oct 2013 10:59:34 +0200 |
blanchet |
addressed rare case where the same symbol would be treated alternately as a function and as a predicate -- adding "top2I top_boolI" to a problem that didn't talk about "top" was a way to trigger the issue
|
changeset |
files
|
| Mon, 14 Oct 2013 11:14:14 +0200 |
blanchet |
added Nitpick limitations to docs
|
changeset |
files
|
| Mon, 14 Oct 2013 11:07:59 +0200 |
blanchet |
more defensive Nitpick setup -- exotic types of recursion are not supported yet in the model finder
|
changeset |
files
|
| Mon, 14 Oct 2013 10:55:49 +0200 |
blanchet |
keep temporary error handling in there until code equations are properly generated
|
changeset |
files
|