Fri, 23 Apr 2010 23:35:43 +0200 wenzelm mark schematic statements explicitly;
Fri, 23 Apr 2010 23:33:48 +0200 wenzelm eliminated spurious schematic statements;
Fri, 23 Apr 2010 22:48:07 +0200 wenzelm explicit 'schematic_theorem' etc. for schematic theorem statements;
Fri, 23 Apr 2010 22:39:49 +0200 wenzelm collapse category "schematic goal" in keyword table -- Proof General does not know about this;
Fri, 23 Apr 2010 21:00:28 +0200 wenzelm added keyword category "schematic goal", which prevents any attempt to fork the proof;
Fri, 23 Apr 2010 19:36:23 +0200 wenzelm merged
Fri, 23 Apr 2010 19:32:37 +0200 haftmann merged
Fri, 23 Apr 2010 16:45:53 +0200 haftmann separated instantiation of division_by_zero
Fri, 23 Apr 2010 16:38:51 +0200 haftmann epheremal replacement of field_simps by field_eq_simps; dropped old division_by_zero instance
Fri, 23 Apr 2010 16:17:25 +0200 haftmann adapted to new times_divide_eq simp situation
Fri, 23 Apr 2010 16:17:25 +0200 haftmann epheremal replacement of field_simps by field_eq_simps
Fri, 23 Apr 2010 16:17:24 +0200 haftmann dequalified fact name
Fri, 23 Apr 2010 15:18:00 +0200 haftmann sharpened constraint (c.f. 4e7f5b22dd7d); explicit is better than implicit
Fri, 23 Apr 2010 15:18:00 +0200 haftmann separated instantiation of division_by_zero
Fri, 23 Apr 2010 15:17:59 +0200 haftmann dequalified fact name
Fri, 23 Apr 2010 15:17:59 +0200 haftmann less special treatment of times_divide_eq [simp]
Fri, 23 Apr 2010 15:17:59 +0200 haftmann sharpened constraint (c.f. 4e7f5b22dd7d)
Fri, 23 Apr 2010 13:58:15 +0200 haftmann more localization; tuned proofs
Fri, 23 Apr 2010 13:58:14 +0200 haftmann more localization; factored out lemmas for division_ring
Fri, 23 Apr 2010 13:58:14 +0200 haftmann modernized abstract algebra theories
Fri, 23 Apr 2010 10:50:17 +0200 haftmann merged
Thu, 22 Apr 2010 12:07:00 +0200 haftmann swapped generic code generator and SML code generator
Fri, 23 Apr 2010 19:36:04 +0200 wenzelm removed obsolete Named_Thm_Set -- Named_Thms provides efficient member operation;
Fri, 23 Apr 2010 18:30:01 +0200 wenzelm Item_Net/Named_Thms: export efficient member operation;
Fri, 23 Apr 2010 16:12:57 +0200 bulwahn initialized atps reference with standard setup in the atp manager
Fri, 23 Apr 2010 12:24:30 +0200 blanchet compile
Fri, 23 Apr 2010 12:07:12 +0200 blanchet handle SPASS's equality predicate correctly in Isar proof reconstruction
Fri, 23 Apr 2010 11:34:49 +0200 blanchet merged
Fri, 23 Apr 2010 11:32:36 +0200 blanchet added Isar proof reconstruction support for SPASS -- which means all provers can now yield Isar proofs;
Thu, 22 Apr 2010 16:30:54 +0200 blanchet remove hack that is no longer necessary now that "ATP_Wrapper" properly detects which ATPs are installed
Thu, 22 Apr 2010 16:30:04 +0200 blanchet set "atps" reference's default value to "(remote_)e (remote_)spass (remote_)vampire", based on what is installed
Thu, 22 Apr 2010 15:01:36 +0200 blanchet minor code cleanup
Thu, 22 Apr 2010 14:47:52 +0200 blanchet if Isar proof reconstruction is not supported, tell the user so they don't wonder why their "isar_proof" option did nothing
Thu, 22 Apr 2010 13:50:58 +0200 blanchet "remote_e" and "remote_vampire" support TSTP proof output + fix "overlord" mode ATP output postprocessing
Thu, 22 Apr 2010 10:54:56 +0200 blanchet Isar proof reconstruction: type variables introduced by the ATP should be treated as type parameters for type inference purposes;
Thu, 22 Apr 2010 10:13:02 +0200 blanchet postprocess ATP output in "overlord" mode to make it more readable
Wed, 21 Apr 2010 17:06:26 +0200 blanchet failure of reconstructing the Isar proof (e.g., exception) should not prevent Sledgehammer from showing the short one-liner proof -- but in "debug" mode we do want to know what the exception is
Wed, 21 Apr 2010 16:38:03 +0200 blanchet generate command-line in addition to timestamp in ATP output file, for debugging purposes
Wed, 21 Apr 2010 16:21:19 +0200 blanchet pass relevant options from "sledgehammer" to "sledgehammer minimize";
Fri, 23 Apr 2010 10:00:53 +0200 Cezary Kaliszyk Finite set theory
Thu, 22 Apr 2010 22:12:12 +0200 wenzelm merged
Thu, 22 Apr 2010 20:39:48 +0100 paulson Tidied up using s/l
Thu, 22 Apr 2010 22:01:06 +0200 wenzelm split Class.thy into parts to conserve a bit of memory and increase the chance of making it work on Cygwin with only 2 GB available;
Thu, 22 Apr 2010 11:55:19 +0200 Cezary Kaliszyk fun_rel introduction and list_rel elimination for quotient package
Thu, 22 Apr 2010 09:30:39 +0200 haftmann lemmas concerning remdups
Thu, 22 Apr 2010 09:30:36 +0200 haftmann lemma dlist_ext
Wed, 21 Apr 2010 21:11:26 +0200 haftmann merged
Wed, 21 Apr 2010 15:20:59 +0200 haftmann optionally ignore errors during translation of equations; tuned representation of abstraction points
Wed, 21 Apr 2010 15:20:57 +0200 haftmann optionally ignore errors during translation of equations
Wed, 21 Apr 2010 15:45:33 +0200 krauss tolerate eta-variants in f_graph.cases (from inductive package); added test case;
Wed, 21 Apr 2010 15:37:39 +0200 krauss simplified example
Wed, 21 Apr 2010 14:46:29 +0200 blanchet use only one thread in "Manual_Nits";
Wed, 21 Apr 2010 14:02:34 +0200 blanchet merged
Wed, 21 Apr 2010 14:02:19 +0200 blanchet clarify error message
Wed, 21 Apr 2010 12:22:04 +0200 blanchet distinguish between the different ATP errors in the user interface;
Wed, 21 Apr 2010 11:03:35 +0200 blanchet added "spass_tptp" prover, which requires SPASS x.y > 3.0;
Tue, 20 Apr 2010 17:41:00 +0200 blanchet use "Proof.goal" in Sledgehammer's minimizer (just like everywhere else in Sledgehammer), not "Proof.raw_goal"
Wed, 21 Apr 2010 12:11:48 +0200 bulwahn merged
Wed, 21 Apr 2010 12:10:53 +0200 bulwahn make profiling depend on reference Quickcheck.timing
Wed, 21 Apr 2010 12:10:52 +0200 bulwahn added examples for detecting switches
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip