upgraded to Alt-Ergo 0.95

don't pass chained facts directly to SMT solvers -- this breaks various invariants and is never necessary

trust preplayed proof in Mirabelle

added case taken out by mistake

tuning (removed redundant datatype)

minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay

honor linearization option also in the evaluation driver

got rid of rump support for Vampire definitions

optimize Isar output some more

turn off more evil Vampire options to facilitate Isar proof generation

fixed typo in option name

tuning

use new skolemizer only if some skolems have two or more arguments -- otherwise the old skolemizer cannot get the arg order wrong

slacker comparison for Skolems, to avoid trivial equations

auto-minimizer should respect "isar_proofs = true"

made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired

alias for people like me

dropped spurious left-over from 0a2371e7ced3

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

interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices

delete also predicates on relations when hiding an implementation of an abstract type

reintroduced crucial sorting accidentally lost in 962190eab40d

compile

provide two modes for MaSh driver: linearized or real visibility

implement (more) accurate computation of parents

tuning

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

simplified byline, isar_qualifier

tuned code: factored out parent computation

tuned code

simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)

fundamentals about discrete logarithm and square root

Sieve of Eratosthenes

note on parallel computation

corrected and clarified Code_Binary_Nat vs. Code_Target_Nat

simplified construction of upto_aux

merged

restored proper order of NEWS entries (lost due too long-waiting patches)

CONTRIBUTORS

tail recursive code for function "upto"

tuning

repaired collateral damage from 4f0147ed8bcb

Backed out changeset: 3fe7242f8346, many proofs (e.g. in Extended_Real and Approximation) rely on coercions not being lifted over sets

dropped now obsolete hint; a few words on theory IArray; dropped reference to obsolete theory Efficient_Nat

attempt to re-establish conventions which theories are loaded into the grand unified library theory; four different code generation tests for different code setup constellations; augment code generation setup where necessary

systematic conversions between nat and nibble/char; more uniform approaches to execute operations on nibble/char

coercions between base types can be lifted to sets

annotate obtains with types

merge

made check for conjecture skolemization sound

use safe var index

merged

more type class instances for Numeral_Type (contributed by Jesus Aransay)

added lemma

merge

merge