Fri, 23 Sep 2005 22:58:50 +0200 new sat tactic imports resolution proofs from zChaff
webertj [Fri, 23 Sep 2005 22:58:50 +0200] rev 17618
new sat tactic imports resolution proofs from zChaff
Fri, 23 Sep 2005 22:49:25 +0200 fix
obua [Fri, 23 Sep 2005 22:49:25 +0200] rev 17617
fix
Fri, 23 Sep 2005 22:31:22 +0200 simprocs: pattern now "x" (the proc is supposed to discriminate faster than Pattern.match);
wenzelm [Fri, 23 Sep 2005 22:31:22 +0200] rev 17616
simprocs: pattern now "x" (the proc is supposed to discriminate faster than Pattern.match);
Fri, 23 Sep 2005 22:21:55 +0200 tuned msg;
wenzelm [Fri, 23 Sep 2005 22:21:55 +0200] rev 17615
tuned msg;
Fri, 23 Sep 2005 22:21:54 +0200 added mk_solver';
wenzelm [Fri, 23 Sep 2005 22:21:54 +0200] rev 17614
added mk_solver'; export revert_bounds; check_bounds if debug_simp;
Fri, 23 Sep 2005 22:21:53 +0200 Simplifier.inherit_bounds;
wenzelm [Fri, 23 Sep 2005 22:21:53 +0200] rev 17613
Simplifier.inherit_bounds;
Fri, 23 Sep 2005 22:21:52 +0200 adm_tac/cont_tacRs: proper simpset;
wenzelm [Fri, 23 Sep 2005 22:21:52 +0200] rev 17612
adm_tac/cont_tacRs: proper simpset;
Fri, 23 Sep 2005 22:21:51 +0200 Provers/Arith/fast_lin_arith.ML: Simplifier.inherit_bounds;
wenzelm [Fri, 23 Sep 2005 22:21:51 +0200] rev 17611
Provers/Arith/fast_lin_arith.ML: Simplifier.inherit_bounds;
Fri, 23 Sep 2005 22:21:50 +0200 tuned order of targets;
wenzelm [Fri, 23 Sep 2005 22:21:50 +0200] rev 17610
tuned order of targets;
Fri, 23 Sep 2005 22:21:49 +0200 Provers/cancel_sums.ML: Simplifier.inherit_bounds;
wenzelm [Fri, 23 Sep 2005 22:21:49 +0200] rev 17609
Provers/cancel_sums.ML: Simplifier.inherit_bounds;
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip