Mon, 05 May 2014 09:30:20 +0200 simplify selectors in code views
blanchet [Mon, 05 May 2014 09:30:20 +0200] rev 56858
simplify selectors in code views
Mon, 05 May 2014 08:30:38 +0200 note correct induction schemes in 'primrec' (for N2M)
blanchet [Mon, 05 May 2014 08:30:38 +0200] rev 56857
note correct induction schemes in 'primrec' (for N2M)
Sun, 04 May 2014 21:35:04 +0200 use right meson tactic for preplaying
blanchet [Sun, 04 May 2014 21:35:04 +0200] rev 56856
use right meson tactic for preplaying
Sun, 04 May 2014 21:02:21 +0200 simplify unused universally quantified variables in Z3 proofs
blanchet [Sun, 04 May 2014 21:02:21 +0200] rev 56855
simplify unused universally quantified variables in Z3 proofs
Sun, 04 May 2014 19:27:28 +0200 fixed Waldmeister endgame w.r.t. "Trueprop"
blanchet [Sun, 04 May 2014 19:27:28 +0200] rev 56854
fixed Waldmeister endgame w.r.t. "Trueprop"
Sun, 04 May 2014 19:08:29 +0200 tuned structure name
blanchet [Sun, 04 May 2014 19:08:29 +0200] rev 56853
tuned structure name
Sun, 04 May 2014 19:01:36 +0200 added 'satx' to Sledgehammer's portfolio (cf. 'isar_try0')
blanchet [Sun, 04 May 2014 19:01:36 +0200] rev 56852
added 'satx' to Sledgehammer's portfolio (cf. 'isar_try0')
Sun, 04 May 2014 18:57:45 +0200 renamed 'dpll_p' to 'cdclite', to avoid confusion with the old 'dpll' and to reflect the idea that the new prover implements some ideas from CDCL not in DPLL -- this follows its author's, Sascha B.'s, wish
blanchet [Sun, 04 May 2014 18:57:45 +0200] rev 56851
renamed 'dpll_p' to 'cdclite', to avoid confusion with the old 'dpll' and to reflect the idea that the new prover implements some ideas from CDCL not in DPLL -- this follows its author's, Sascha B.'s, wish
Sun, 04 May 2014 18:53:58 +0200 added 'satx' proof method to Try0
blanchet [Sun, 04 May 2014 18:53:58 +0200] rev 56850
added 'satx' proof method to Try0
Sun, 04 May 2014 18:50:42 +0200 make 'dpll_p' the default SAT solver, rather than the hard-to-get zChaff-with-proofs
blanchet [Sun, 04 May 2014 18:50:42 +0200] rev 56849
make 'dpll_p' the default SAT solver, rather than the hard-to-get zChaff-with-proofs
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip