more work on finite axiom detection

revert junk submitted by mistake

make sure minimizer facts go through "transform_elim_theorems"

use a smaller simpset in order to not solve refl-instances

allow for pre-simplification of lifted theorems

changed to a more convenient argument order

merged

split and enriched theory SetsAndFunctions

more concise characterization of of_nat operation and class semiring_char_0

inj_comp and inj_fun

tuned: less formal noise in Named_Target, more coherence in Class

remove trivial facts

unbreak "only" option of Sledgehammer

merged

improve "x = A | x = B | x = C"-style axiom detection

temporarily disable "fequal" handling in Metis; one proof fails in "HOL-Auth" because of the new rules

use "hypothesis" rather than "conjecture" for hypotheses in TPTP format; avoids relying on inconsistently implemented feature of TPTP format

merged

improve "x = A | x = B | x = C"-style fact discovery

transform elim theorems before filtering "bool" and "prop" variables out; another consequence of the transition to FOF

more fiddling with Sledgehammer's "add:" option

beta eta contract the Sledgehammer conjecture (and also the axioms, although this might not be needed), just like Metis does (implicitly); another consequence of the transition to FOF

generalize the "too general equality" code to handle facts like "x ~= A ==> x = B"

encode "fequal" reasoning rules in Metis problem, just as is done for Sledgehammer -- otherwise any proof that relies on "fequal" found by Sledgehammer can't be reconstructed

fix atomize

improve atomization

fix SInE's error handling + run "vampire" locally if either SPASS or E is missing

added entries

update docs

tuning

parse SNARK proofs

added remote SInE and remote SNARK

no spurious trailing "\n" at the end of Sledgehammer's output

don't get confused by wrong slice

make sure that "add:" doesn't influence the relevance filter too much

tuning of relevance filter

minor cleanup

bound variables can be just as evil as schematic variables and lead to unsound proofs (e.g. "all_bool_eq")

update docs

get rid of "minimize_timeout", now that there's an automatic adaptive timeout mechanism in "minimize"

added "max_relevant_per_iter" option to Sledgehammer

thank Andrei instead of Tanya

fix the relevance filter so that it ignores If, Ex1, Ball, Bex

tuning

reactivated -segprot options, just to make double-sure;

tuned Markup_Tree.+ : slightly more expensive version to rebuild rest avoids crash of RedBlack.scala:120 (version Scala 2.8.0), e.g. on the following input: ML {* fun f x = (x + 1, "aaa") *}

tuned;

tuned signature;

simplified Command.status again, reverting most of e5eed57913d0 (note that more complex information can be represented with full markup reports);

proper range for hyperlinks and tooltips, using original markup information;

tuned signature;

misc tuning and simplification;

renamed Markup_Tree.Node to Text.Info; Markup_Tree.select: body may depend on full Text.Info, including range; tuned;

removed obsolete Markup_Tree.flatten/filter;

Isabelle_Hyperlinks: select relevant information directly from Markup_Tree, without intermediate RefInfo;

Document_View.text_area_extension: select relevant information directly from Markup_Tree, without intermediate TypeInfo;