Wed, 20 Feb 2013 11:40:30 +0100 proper check of Proof.is_relevant (again, cf. c3e99efacb67 and df8fc0567a3d);
wenzelm [Wed, 20 Feb 2013 11:40:30 +0100] rev 51226
proper check of Proof.is_relevant (again, cf. c3e99efacb67 and df8fc0567a3d);
Wed, 20 Feb 2013 00:00:42 +0100 support nested Thy_Syntax.element;
wenzelm [Wed, 20 Feb 2013 00:00:42 +0100] rev 51225
support nested Thy_Syntax.element; more explicit Keyword.is_proof_body; tuned;
Tue, 19 Feb 2013 21:44:37 +0100 back to non-schematic 'sublocale' and 'interpretation' (despite df8fc0567a3d) for more potential parallelism;
wenzelm [Tue, 19 Feb 2013 21:44:37 +0100] rev 51224
back to non-schematic 'sublocale' and 'interpretation' (despite df8fc0567a3d) for more potential parallelism;
Tue, 19 Feb 2013 20:19:21 +0100 help JVM to cope with large symbolic structures;
wenzelm [Tue, 19 Feb 2013 20:19:21 +0100] rev 51223
help JVM to cope with large symbolic structures;
Tue, 19 Feb 2013 17:55:26 +0100 improved scheduling of forked proofs, based on elapsed time estimate (from last run via session log file);
wenzelm [Tue, 19 Feb 2013 17:55:26 +0100] rev 51222
improved scheduling of forked proofs, based on elapsed time estimate (from last run via session log file);
Tue, 19 Feb 2013 17:02:52 +0100 read logs from failed sessions as well;
wenzelm [Tue, 19 Feb 2013 17:02:52 +0100] rev 51221
read logs from failed sessions as well; proper output base directory (which is two steps upwards);
Tue, 19 Feb 2013 16:49:40 +0100 recover timing information from old log files;
wenzelm [Tue, 19 Feb 2013 16:49:40 +0100] rev 51220
recover timing information from old log files; use session timing for queue ordering; pass command timings to ML process (still unused);
Tue, 19 Feb 2013 14:47:57 +0100 suppress timing message in full PIDE protocol -- this is for batch build;
wenzelm [Tue, 19 Feb 2013 14:47:57 +0100] rev 51219
suppress timing message in full PIDE protocol -- this is for batch build;
Tue, 19 Feb 2013 13:57:13 +0100 support for build passing timings from Scala to ML;
wenzelm [Tue, 19 Feb 2013 13:57:13 +0100] rev 51218
support for build passing timings from Scala to ML;
Tue, 19 Feb 2013 12:58:32 +0100 support for prescient timing information within command transactions;
wenzelm [Tue, 19 Feb 2013 12:58:32 +0100] rev 51217
support for prescient timing information within command transactions;
Tue, 19 Feb 2013 10:55:11 +0100 emit command_timing properties into build log;
wenzelm [Tue, 19 Feb 2013 10:55:11 +0100] rev 51216
emit command_timing properties into build log; tuned;
Thu, 21 Feb 2013 12:22:26 +0100 generate Isar proof if Metis appears to be too slow
blanchet [Thu, 21 Feb 2013 12:22:26 +0100] rev 51215
generate Isar proof if Metis appears to be too slow
Thu, 21 Feb 2013 12:22:26 +0100 swap slices so that the last slice is more complete (for minimization)
blanchet [Thu, 21 Feb 2013 12:22:26 +0100] rev 51214
swap slices so that the last slice is more complete (for minimization)
Thu, 21 Feb 2013 12:22:26 +0100 tuning
blanchet [Thu, 21 Feb 2013 12:22:26 +0100] rev 51213
tuning
Wed, 20 Feb 2013 17:42:20 +0100 ensure all conjecture clauses are in the graph -- to prevent exceptions later
blanchet [Wed, 20 Feb 2013 17:42:20 +0100] rev 51212
ensure all conjecture clauses are in the graph -- to prevent exceptions later
Wed, 20 Feb 2013 17:31:28 +0100 generalize syntax of SPASS proofs
blanchet [Wed, 20 Feb 2013 17:31:28 +0100] rev 51211
generalize syntax of SPASS proofs
Wed, 20 Feb 2013 17:15:06 +0100 tweaked hack some more
blanchet [Wed, 20 Feb 2013 17:15:06 +0100] rev 51210
tweaked hack some more
Wed, 20 Feb 2013 17:12:21 +0100 more simplifying constructors
blanchet [Wed, 20 Feb 2013 17:12:21 +0100] rev 51209
more simplifying constructors
Wed, 20 Feb 2013 17:05:24 +0100 remove needless steps from refutation graph -- these confuse the proof redirection algorithm (and are needless)
blanchet [Wed, 20 Feb 2013 17:05:24 +0100] rev 51208
remove needless steps from refutation graph -- these confuse the proof redirection algorithm (and are needless)
Wed, 20 Feb 2013 16:21:04 +0100 more precise error
blanchet [Wed, 20 Feb 2013 16:21:04 +0100] rev 51207
more precise error
Wed, 20 Feb 2013 15:43:51 +0100 improved hack
blanchet [Wed, 20 Feb 2013 15:43:51 +0100] rev 51206
improved hack
Wed, 20 Feb 2013 15:26:19 +0100 upgraded to Alt-Ergo 0.95
blanchet [Wed, 20 Feb 2013 15:26:19 +0100] rev 51205
upgraded to Alt-Ergo 0.95
Wed, 20 Feb 2013 15:12:38 +0100 don't pass chained facts directly to SMT solvers -- this breaks various invariants and is never necessary
blanchet [Wed, 20 Feb 2013 15:12:38 +0100] rev 51204
don't pass chained facts directly to SMT solvers -- this breaks various invariants and is never necessary
Wed, 20 Feb 2013 14:47:19 +0100 trust preplayed proof in Mirabelle
blanchet [Wed, 20 Feb 2013 14:47:19 +0100] rev 51203
trust preplayed proof in Mirabelle
Wed, 20 Feb 2013 14:44:00 +0100 added case taken out by mistake
blanchet [Wed, 20 Feb 2013 14:44:00 +0100] rev 51202
added case taken out by mistake
Wed, 20 Feb 2013 14:21:17 +0100 tuning (removed redundant datatype)
blanchet [Wed, 20 Feb 2013 14:21:17 +0100] rev 51201
tuning (removed redundant datatype)
Wed, 20 Feb 2013 14:10:51 +0100 minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
blanchet [Wed, 20 Feb 2013 14:10:51 +0100] rev 51200
minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
Wed, 20 Feb 2013 13:04:03 +0100 honor linearization option also in the evaluation driver
blanchet [Wed, 20 Feb 2013 13:04:03 +0100] rev 51199
honor linearization option also in the evaluation driver
Wed, 20 Feb 2013 10:54:13 +0100 got rid of rump support for Vampire definitions
blanchet [Wed, 20 Feb 2013 10:54:13 +0100] rev 51198
got rid of rump support for Vampire definitions
Wed, 20 Feb 2013 10:45:23 +0100 optimize Isar output some more
blanchet [Wed, 20 Feb 2013 10:45:23 +0100] rev 51197
optimize Isar output some more
Wed, 20 Feb 2013 10:45:01 +0100 turn off more evil Vampire options to facilitate Isar proof generation
blanchet [Wed, 20 Feb 2013 10:45:01 +0100] rev 51196
turn off more evil Vampire options to facilitate Isar proof generation
Wed, 20 Feb 2013 09:58:28 +0100 fixed typo in option name
blanchet [Wed, 20 Feb 2013 09:58:28 +0100] rev 51195
fixed typo in option name
Wed, 20 Feb 2013 08:56:34 +0100 tuning
blanchet [Wed, 20 Feb 2013 08:56:34 +0100] rev 51194
tuning
Wed, 20 Feb 2013 08:44:24 +0100 use new skolemizer only if some skolems have two or more arguments -- otherwise the old skolemizer cannot get the arg order wrong
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51193
use new skolemizer only if some skolems have two or more arguments -- otherwise the old skolemizer cannot get the arg order wrong
Wed, 20 Feb 2013 08:44:24 +0100 slacker comparison for Skolems, to avoid trivial equations
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51192
slacker comparison for Skolems, to avoid trivial equations
Wed, 20 Feb 2013 08:44:24 +0100 auto-minimizer should respect "isar_proofs = true"
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51191
auto-minimizer should respect "isar_proofs = true"
Wed, 20 Feb 2013 08:44:24 +0100 made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51190
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
Wed, 20 Feb 2013 08:44:24 +0100 alias for people like me
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51189
alias for people like me
Tue, 19 Feb 2013 19:44:10 +0100 dropped spurious left-over from 0a2371e7ced3
haftmann [Tue, 19 Feb 2013 19:44:10 +0100] rev 51188
dropped spurious left-over from 0a2371e7ced3
Tue, 19 Feb 2013 17:01:06 +0100 avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet [Tue, 19 Feb 2013 17:01:06 +0100] rev 51187
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
Tue, 19 Feb 2013 15:37:42 +0100 interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices
blanchet [Tue, 19 Feb 2013 15:37:42 +0100] rev 51186
interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices
Tue, 19 Feb 2013 15:03:36 +0100 delete also predicates on relations when hiding an implementation of an abstract type
kuncar [Tue, 19 Feb 2013 15:03:36 +0100] rev 51185
delete also predicates on relations when hiding an implementation of an abstract type
Tue, 19 Feb 2013 13:37:07 +0100 reintroduced crucial sorting accidentally lost in 962190eab40d
blanchet [Tue, 19 Feb 2013 13:37:07 +0100] rev 51184
reintroduced crucial sorting accidentally lost in 962190eab40d
Tue, 19 Feb 2013 13:27:33 +0100 compile
blanchet [Tue, 19 Feb 2013 13:27:33 +0100] rev 51183
compile
Tue, 19 Feb 2013 13:21:49 +0100 provide two modes for MaSh driver: linearized or real visibility
blanchet [Tue, 19 Feb 2013 13:21:49 +0100] rev 51182
provide two modes for MaSh driver: linearized or real visibility
Mon, 18 Feb 2013 18:34:55 +0100 implement (more) accurate computation of parents
blanchet [Mon, 18 Feb 2013 18:34:55 +0100] rev 51181
implement (more) accurate computation of parents
Mon, 18 Feb 2013 18:34:54 +0100 tuning
blanchet [Mon, 18 Feb 2013 18:34:54 +0100] rev 51180
tuning
Mon, 18 Feb 2013 12:16:27 +0100 split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas [Mon, 18 Feb 2013 12:16:27 +0100] rev 51179
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
Mon, 18 Feb 2013 12:16:02 +0100 simplified byline, isar_qualifier
smolkas [Mon, 18 Feb 2013 12:16:02 +0100] rev 51178
simplified byline, isar_qualifier
Mon, 18 Feb 2013 11:33:43 +0100 tuned code: factored out parent computation
blanchet [Mon, 18 Feb 2013 11:33:43 +0100] rev 51177
tuned code: factored out parent computation
Mon, 18 Feb 2013 10:43:36 +0100 tuned code
blanchet [Mon, 18 Feb 2013 10:43:36 +0100] rev 51176
tuned code
Mon, 18 Feb 2013 08:52:23 +0100 simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
Andreas Lochbihler [Mon, 18 Feb 2013 08:52:23 +0100] rev 51175
simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
Sun, 17 Feb 2013 22:56:54 +0100 fundamentals about discrete logarithm and square root
haftmann [Sun, 17 Feb 2013 22:56:54 +0100] rev 51174
fundamentals about discrete logarithm and square root
Sun, 17 Feb 2013 21:29:30 +0100 Sieve of Eratosthenes
haftmann [Sun, 17 Feb 2013 21:29:30 +0100] rev 51173
Sieve of Eratosthenes
Sun, 17 Feb 2013 20:45:49 +0100 note on parallel computation
haftmann [Sun, 17 Feb 2013 20:45:49 +0100] rev 51172
note on parallel computation
Sun, 17 Feb 2013 19:39:00 +0100 corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
haftmann [Sun, 17 Feb 2013 19:39:00 +0100] rev 51171
corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
Sun, 17 Feb 2013 11:34:40 +0100 simplified construction of upto_aux
haftmann [Sun, 17 Feb 2013 11:34:40 +0100] rev 51170
simplified construction of upto_aux
Sun, 17 Feb 2013 11:06:10 +0100 merged
haftmann [Sun, 17 Feb 2013 11:06:10 +0100] rev 51169
merged
Sat, 16 Feb 2013 08:21:08 +0100 restored proper order of NEWS entries (lost due too long-waiting patches)
haftmann [Sat, 16 Feb 2013 08:21:08 +0100] rev 51168
restored proper order of NEWS entries (lost due too long-waiting patches)
Sun, 17 Feb 2013 10:40:53 +0100 CONTRIBUTORS
haftmann [Sun, 17 Feb 2013 10:40:53 +0100] rev 51167
CONTRIBUTORS
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip