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
Tue, 23 Nov 2010 19:01:21 +0100 make Mirabelle take into consideration whether the SMT solver proof should be reconstructed with Metis or SMT
blanchet [Tue, 23 Nov 2010 19:01:21 +0100] rev 40667
make Mirabelle take into consideration whether the SMT solver proof should be reconstructed with Metis or SMT
Tue, 23 Nov 2010 18:28:09 +0100 try Metis to reconstruct SMT proofs, to increase success rate and reduce dependency on (often remote) SMT solvers or certificates
blanchet [Tue, 23 Nov 2010 18:28:09 +0100] rev 40666
try Metis to reconstruct SMT proofs, to increase success rate and reduce dependency on (often remote) SMT solvers or certificates
Tue, 23 Nov 2010 18:26:56 +0100 added "verbose" option to Metis to shut up its warnings if necessary
blanchet [Tue, 23 Nov 2010 18:26:56 +0100] rev 40665
added "verbose" option to Metis to shut up its warnings if necessary
Mon, 22 Nov 2010 23:37:00 +0100 added support for quantifier weight annotations
boehmes [Mon, 22 Nov 2010 23:37:00 +0100] rev 40664
added support for quantifier weight annotations
Mon, 22 Nov 2010 15:45:43 +0100 share and use more utility functions;
boehmes [Mon, 22 Nov 2010 15:45:43 +0100] rev 40663
share and use more utility functions; slightly reduced complexity for Z3 proof rule 'rewrite'
Mon, 22 Nov 2010 15:45:42 +0100 added prove reconstruction for injective functions;
boehmes [Mon, 22 Nov 2010 15:45:42 +0100] rev 40662
added prove reconstruction for injective functions; added SMT_Utils to collect frequently used functions
Mon, 22 Nov 2010 14:27:42 +0100 generous timeout gives more breath in parallel run on less luxury machines
haftmann [Mon, 22 Nov 2010 14:27:42 +0100] rev 40661
generous timeout gives more breath in parallel run on less luxury machines
Mon, 22 Nov 2010 14:19:03 +0100 adding setup for exhaustive testing in example file
bulwahn [Mon, 22 Nov 2010 14:19:03 +0100] rev 40660
adding setup for exhaustive testing in example file
Mon, 22 Nov 2010 11:35:11 +0100 hiding enum
bulwahn [Mon, 22 Nov 2010 11:35:11 +0100] rev 40659
hiding enum
Mon, 22 Nov 2010 11:35:09 +0100 adapting example in Predicate_Compile_Examples
bulwahn [Mon, 22 Nov 2010 11:35:09 +0100] rev 40658
adapting example in Predicate_Compile_Examples
Mon, 22 Nov 2010 11:35:07 +0100 hiding the constants
bulwahn [Mon, 22 Nov 2010 11:35:07 +0100] rev 40657
hiding the constants
Mon, 22 Nov 2010 11:35:06 +0100 improving function is_iterable in quickcheck
bulwahn [Mon, 22 Nov 2010 11:35:06 +0100] rev 40656
improving function is_iterable in quickcheck
Mon, 22 Nov 2010 11:35:02 +0100 adding temporary options to the quickcheck examples
bulwahn [Mon, 22 Nov 2010 11:35:02 +0100] rev 40655
adding temporary options to the quickcheck examples
Mon, 22 Nov 2010 11:35:00 +0100 adapting the quickcheck examples
bulwahn [Mon, 22 Nov 2010 11:35:00 +0100] rev 40654
adapting the quickcheck examples
Mon, 22 Nov 2010 11:34:59 +0100 adding AFP tests to Mutabelle_Extra; adopting mutabelle to recent quickcheck changes; filtering strange mutants; adding solvers to mutabelle; restructuring mutabelle
bulwahn [Mon, 22 Nov 2010 11:34:59 +0100] rev 40653
adding AFP tests to Mutabelle_Extra; adopting mutabelle to recent quickcheck changes; filtering strange mutants; adding solvers to mutabelle; restructuring mutabelle
Mon, 22 Nov 2010 11:34:58 +0100 adding code equations for EX1 on finite types
bulwahn [Mon, 22 Nov 2010 11:34:58 +0100] rev 40652
adding code equations for EX1 on finite types
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip