Thu, 16 Dec 2010 15:12:17 +0100 fixed more issues with the Vampire output parser, and added support for Vampire's TSTP output (--proof tptp)
blanchet [Thu, 16 Dec 2010 15:12:17 +0100] rev 41203
fixed more issues with the Vampire output parser, and added support for Vampire's TSTP output (--proof tptp)
Thu, 16 Dec 2010 15:12:17 +0100 make it more likely that induction rules are picked up by Sledgehammer
blanchet [Thu, 16 Dec 2010 15:12:17 +0100] rev 41202
make it more likely that induction rules are picked up by Sledgehammer
Thu, 16 Dec 2010 15:12:17 +0100 generalize the Vampire parser some more to cope with things like "{2, 3\}" seen in some proofs
blanchet [Thu, 16 Dec 2010 15:12:17 +0100] rev 41201
generalize the Vampire parser some more to cope with things like "{2, 3\}" seen in some proofs
Thu, 16 Dec 2010 15:12:17 +0100 add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet [Thu, 16 Dec 2010 15:12:17 +0100] rev 41200
add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
Thu, 16 Dec 2010 15:12:17 +0100 instantiate induction rules automatically
blanchet [Thu, 16 Dec 2010 15:12:17 +0100] rev 41199
instantiate induction rules automatically
Thu, 16 Dec 2010 13:54:17 +0100 merged
boehmes [Thu, 16 Dec 2010 13:54:17 +0100] rev 41198
merged
Thu, 16 Dec 2010 13:34:28 +0100 fix lambda-lifting: take level of bound variables into account and also apply bound variables from outer scope
boehmes [Thu, 16 Dec 2010 13:34:28 +0100] rev 41197
fix lambda-lifting: take level of bound variables into account and also apply bound variables from outer scope
Thu, 16 Dec 2010 12:33:06 +0100 fixed introduction of explicit application function: bound variables always need explicit application if they are applied to some term
boehmes [Thu, 16 Dec 2010 12:33:06 +0100] rev 41196
fixed introduction of explicit application function: bound variables always need explicit application if they are applied to some term
Thu, 16 Dec 2010 12:07:36 +0100 fixed eta-expansion: introduce a couple of abstractions at once
boehmes [Thu, 16 Dec 2010 12:07:36 +0100] rev 41195
fixed eta-expansion: introduce a couple of abstractions at once
Thu, 16 Dec 2010 12:19:00 +0000 merged
paulson [Thu, 16 Dec 2010 12:19:00 +0000] rev 41194
merged
Thu, 16 Dec 2010 12:05:00 +0000 made sml/nj happy
paulson [Thu, 16 Dec 2010 12:05:00 +0000] rev 41193
made sml/nj happy
Thu, 16 Dec 2010 11:31:22 +0100 removing file refute_isar.ML that was missed in 4006f5c3f421
bulwahn [Thu, 16 Dec 2010 11:31:22 +0100] rev 41192
removing file refute_isar.ML that was missed in 4006f5c3f421
Thu, 16 Dec 2010 11:31:07 +0100 added nitpick to mutabelle script
bulwahn [Thu, 16 Dec 2010 11:31:07 +0100] rev 41191
added nitpick to mutabelle script
Thu, 16 Dec 2010 11:31:06 +0100 reactivating nitpick in Mutabelle
bulwahn [Thu, 16 Dec 2010 11:31:06 +0100] rev 41190
reactivating nitpick in Mutabelle
Thu, 16 Dec 2010 09:40:15 +0100 more appropriate closures for static evaluation
haftmann [Thu, 16 Dec 2010 09:40:15 +0100] rev 41189
more appropriate closures for static evaluation
Thu, 16 Dec 2010 09:28:19 +0100 more uniform naming
haftmann [Thu, 16 Dec 2010 09:28:19 +0100] rev 41188
more uniform naming
(0) -30000 -10000 -3000 -1000 -300 -100 -16 +16 +100 +300 +1000 +3000 +10000 +30000 tip