Thu, 22 Oct 2009 16:24:02 +0200 res_forall_rsp_tac further simplifies the proof
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 22 Oct 2009 16:24:02 +0200] rev 158
res_forall_rsp_tac further simplifies the proof
Thu, 22 Oct 2009 16:10:06 +0200 Working on the proof and the tactic.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 22 Oct 2009 16:10:06 +0200] rev 157
Working on the proof and the tactic.
Thu, 22 Oct 2009 15:45:05 +0200 The proof gets simplified
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 22 Oct 2009 15:45:05 +0200] rev 156
The proof gets simplified
Thu, 22 Oct 2009 15:44:16 +0200 Removed an assumption
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 22 Oct 2009 15:44:16 +0200] rev 155
Removed an assumption
Thu, 22 Oct 2009 15:02:01 +0200 The proof now including manually unfolded higher-order RES_FORALL_RSP.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 22 Oct 2009 15:02:01 +0200] rev 154
The proof now including manually unfolded higher-order RES_FORALL_RSP.
Thu, 22 Oct 2009 13:45:48 +0200 The problems with 'abs' term.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 22 Oct 2009 13:45:48 +0200] rev 153
The problems with 'abs' term.
Thu, 22 Oct 2009 11:43:12 +0200 Simplified the proof with some tactic... Still hangs sometimes.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 22 Oct 2009 11:43:12 +0200] rev 152
Simplified the proof with some tactic... Still hangs sometimes.
(0) -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 +3000 tip