Thu, 25 Nov 2010 14:58:20 +0100 eta-reduce on the fly to prevent an exception
blanchet [Thu, 25 Nov 2010 14:58:20 +0100] rev 40697
eta-reduce on the fly to prevent an exception
Thu, 25 Nov 2010 14:36:51 +0100 merged
nipkow [Thu, 25 Nov 2010 14:36:51 +0100] rev 40696
merged
Thu, 25 Nov 2010 14:35:52 +0100 Added the simplest finite Ramsey theorem
nipkow [Thu, 25 Nov 2010 14:35:52 +0100] rev 40695
Added the simplest finite Ramsey theorem
Thu, 25 Nov 2010 14:13:48 +0100 reverted c059d550afec -- the triviality check had apparently nothing to do with spontaneous Interrupt exceptions
blanchet [Thu, 25 Nov 2010 14:13:48 +0100] rev 40694
reverted c059d550afec -- the triviality check had apparently nothing to do with spontaneous Interrupt exceptions
Thu, 25 Nov 2010 13:26:12 +0100 set Metis option on correct context, lest it be ignored
blanchet [Thu, 25 Nov 2010 13:26:12 +0100] rev 40693
set Metis option on correct context, lest it be ignored
Thu, 25 Nov 2010 12:11:12 +0100 make "debug" mode of Sledgehammer/SMT more liberal
blanchet [Thu, 25 Nov 2010 12:11:12 +0100] rev 40692
make "debug" mode of Sledgehammer/SMT more liberal
Thu, 25 Nov 2010 00:32:30 +0100 fix check for builtinness of 0 and 1 -- these aren't functions
blanchet [Thu, 25 Nov 2010 00:32:30 +0100] rev 40691
fix check for builtinness of 0 and 1 -- these aren't functions
Thu, 25 Nov 2010 00:17:16 +0100 added "no_atp" for fact that confuses the SMT normalizer and that doesn't help ATPs anyway
blanchet [Thu, 25 Nov 2010 00:17:16 +0100] rev 40690
added "no_atp" for fact that confuses the SMT normalizer and that doesn't help ATPs anyway
Wed, 24 Nov 2010 23:17:24 +0100 document requirement on theory import
blanchet [Wed, 24 Nov 2010 23:17:24 +0100] rev 40689
document requirement on theory import
Wed, 24 Nov 2010 19:15:00 +0100 corrected abd4e7358847 where SOMEthing went utterly wrong
haftmann [Wed, 24 Nov 2010 19:15:00 +0100] rev 40688
corrected abd4e7358847 where SOMEthing went utterly wrong
Wed, 24 Nov 2010 16:51:13 +0100 merged
boehmes [Wed, 24 Nov 2010 16:51:13 +0100] rev 40687
merged
Wed, 24 Nov 2010 15:33:35 +0100 swap names for built-in tester functions (to better reflect the intuition of what they do);
boehmes [Wed, 24 Nov 2010 15:33:35 +0100] rev 40686
swap names for built-in tester functions (to better reflect the intuition of what they do); eta-expand all built-in functions (even those which are only partially supported)
Wed, 24 Nov 2010 13:31:12 +0100 instantiate elimination rules (reduces number of quantified variables, and makes such theorems better amenable for SMT solvers)
boehmes [Wed, 24 Nov 2010 13:31:12 +0100] rev 40685
instantiate elimination rules (reduces number of quantified variables, and makes such theorems better amenable for SMT solvers)
Wed, 24 Nov 2010 16:15:15 +0100 more precise error handling in Sledgehammer/SMT for Z3 and remote SMT provers
blanchet [Wed, 24 Nov 2010 16:15:15 +0100] rev 40684
more precise error handling in Sledgehammer/SMT for Z3 and remote SMT provers
Wed, 24 Nov 2010 10:52:02 +0100 removing Enum.in_enum from the claset
bulwahn [Wed, 24 Nov 2010 10:52:02 +0100] rev 40683
removing Enum.in_enum from the claset
Wed, 24 Nov 2010 10:42:28 +0100 merged
boehmes [Wed, 24 Nov 2010 10:42:28 +0100] rev 40682
merged
Wed, 24 Nov 2010 10:39:58 +0100 be more precise: only treat constant 'distinct' applied to an explicit list as built-in
boehmes [Wed, 24 Nov 2010 10:39:58 +0100] rev 40681
be more precise: only treat constant 'distinct' applied to an explicit list as built-in
Wed, 24 Nov 2010 08:51:48 +0100 be more liberal in reconstructing congruences from Z3 (sometimes the symmetric version of a premise is needed)
boehmes [Wed, 24 Nov 2010 08:51:48 +0100] rev 40680
be more liberal in reconstructing congruences from Z3 (sometimes the symmetric version of a premise is needed)
Wed, 24 Nov 2010 10:23:52 +0100 announcing some latest change (d40b347d5b0b)
bulwahn [Wed, 24 Nov 2010 10:23:52 +0100] rev 40679
announcing some latest change (d40b347d5b0b)
Tue, 23 Nov 2010 23:44:11 +0100 merged
blanchet [Tue, 23 Nov 2010 23:44:11 +0100] rev 40678
merged
Tue, 23 Nov 2010 23:43:56 +0100 more precise characterization of built-in constants "number_of", "0", and "1"
blanchet [Tue, 23 Nov 2010 23:43:56 +0100] rev 40677
more precise characterization of built-in constants "number_of", "0", and "1"
Tue, 23 Nov 2010 23:11:06 +0100 merged
haftmann [Tue, 23 Nov 2010 23:11:06 +0100] rev 40676
merged
Mon, 22 Nov 2010 17:49:24 +0100 merged
haftmann [Mon, 22 Nov 2010 17:49:24 +0100] rev 40675
merged
Mon, 22 Nov 2010 17:48:35 +0100 adhere established Collect/mem convention more closely
haftmann [Mon, 22 Nov 2010 17:48:35 +0100] rev 40674
adhere established Collect/mem convention more closely
Mon, 22 Nov 2010 17:49:12 +0100 merged
haftmann [Mon, 22 Nov 2010 17:49:12 +0100] rev 40673
merged
Mon, 22 Nov 2010 17:46:51 +0100 replaced misleading Fset/fset name -- these do not stand for finite sets
haftmann [Mon, 22 Nov 2010 17:46:51 +0100] rev 40672
replaced misleading Fset/fset name -- these do not stand for finite sets
Mon, 22 Nov 2010 09:37:39 +0100 renamed slightly ambivalent crel to effect
haftmann [Mon, 22 Nov 2010 09:37:39 +0100] rev 40671
renamed slightly ambivalent crel to effect
Tue, 23 Nov 2010 23:10:13 +0100 disable triviality checking -- it might be the source of the spurious Interrupt exceptions that make it almost impossible to run Judgement Day
blanchet [Tue, 23 Nov 2010 23:10:13 +0100] rev 40670
disable triviality checking -- it might be the source of the spurious Interrupt exceptions that make it almost impossible to run Judgement Day
Tue, 23 Nov 2010 22:37:16 +0100 more precise error handling for Z3;
blanchet [Tue, 23 Nov 2010 22:37:16 +0100] rev 40669
more precise error handling for Z3; refactored some of the error handling code shared by ATP and SMT
Tue, 23 Nov 2010 21:54:03 +0100 use "Thm.transfer" in Sledgehammer to prevent theory merger issues in "SMT_Solver.smt_filter" later on
blanchet [Tue, 23 Nov 2010 21:54:03 +0100] rev 40668
use "Thm.transfer" in Sledgehammer to prevent theory merger issues in "SMT_Solver.smt_filter" later on
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip