Mon, 07 Dec 2009 11:44:49 +0100 better error message in Refute when specifying a non-existing SAT solver
blanchet [Mon, 07 Dec 2009 11:44:49 +0100] rev 34017
better error message in Refute when specifying a non-existing SAT solver
Mon, 07 Dec 2009 11:18:44 +0100 merged
wenzelm [Mon, 07 Dec 2009 11:18:44 +0100] rev 34016
merged
Mon, 07 Dec 2009 09:35:18 +0100 updated certificate
boehmes [Mon, 07 Dec 2009 09:35:18 +0100] rev 34015
updated certificate
Mon, 07 Dec 2009 09:21:14 +0100 merged
haftmann [Mon, 07 Dec 2009 09:21:14 +0100] rev 34014
merged
Mon, 07 Dec 2009 09:16:27 +0100 repaired read_const_expr, broken in 1e7ca47c6c3d
haftmann [Mon, 07 Dec 2009 09:16:27 +0100] rev 34013
repaired read_const_expr, broken in 1e7ca47c6c3d
Mon, 07 Dec 2009 09:14:12 +0100 merged
boehmes [Mon, 07 Dec 2009 09:14:12 +0100] rev 34012
merged
Mon, 07 Dec 2009 09:12:16 +0100 verbose output of loaded data makes a clear distinction between new and already existing data (types, constants, axioms)
boehmes [Mon, 07 Dec 2009 09:12:16 +0100] rev 34011
verbose output of loaded data makes a clear distinction between new and already existing data (types, constants, axioms)
Thu, 03 Dec 2009 15:56:06 +0100 faster preprocessing: before applying a step, test if it is applicable (normalization of binders, unfolding of abs/min/max definitions, lambda lifting, explicit application, monomorphization),
boehmes [Thu, 03 Dec 2009 15:56:06 +0100] rev 34010
faster preprocessing: before applying a step, test if it is applicable (normalization of binders, unfolding of abs/min/max definitions, lambda lifting, explicit application, monomorphization), custom-made (top-down) atomize_conv, store predicate and function symbols in a table instead of a list for faster lookup, updated certificates
Sun, 06 Dec 2009 08:28:36 +0100 merged
haftmann [Sun, 06 Dec 2009 08:28:36 +0100] rev 34009
merged
Sun, 06 Dec 2009 08:06:03 +0100 tuned proofs
haftmann [Sun, 06 Dec 2009 08:06:03 +0100] rev 34008
tuned proofs
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip