| Fri, 04 Dec 2009 11:06:43 +0100 | Cezary Kaliszyk | compose_tac instead of rtac to avoid unification; some code cleaning. | changeset | files |
| Fri, 04 Dec 2009 10:36:35 +0100 | Cezary Kaliszyk | Got to about 5 seconds for the longest proof. APPLY_RSP_TAC' solves the quotient internally without instantiation resulting in a faster proof. | changeset | files |
| Fri, 04 Dec 2009 10:12:17 +0100 | Cezary Kaliszyk | Using APPLY_RSP1; again a little bit faster. | changeset | files |
| Fri, 04 Dec 2009 09:33:32 +0100 | Cezary Kaliszyk | Fixes after big merge. | changeset | files |
| Fri, 04 Dec 2009 09:25:27 +0100 | Cezary Kaliszyk | The big merge; probably non-functional. | changeset | files |
| Fri, 04 Dec 2009 09:08:51 +0100 | Cezary Kaliszyk | Testing the new tactic everywhere | changeset | files |
| Fri, 04 Dec 2009 09:01:13 +0100 | Cezary Kaliszyk | First version of the deterministic rep-abs-inj-tac. | changeset | files |
| Fri, 04 Dec 2009 09:18:46 +0100 | Cezary Kaliszyk | Changing = to \<equiv> in case if we want to use simp. | changeset | files |