--- Agda-2.3.0.1-orig/Agda.cabal	2012-04-12 01:24:54.004394444 +1000
+++ Agda-2.3.0.1/Agda.cabal	2012-07-08 12:59:51.280014442 +1000
@@ -76,7 +76,7 @@
   if flag(epic)
     build-depends:  epic >= 0.1.13 && < 0.10
   build-depends:    mtl >= 2.0 && < 2.2,
-                    QuickCheck >= 2.3 && < 2.5,
+                    QuickCheck >= 2.3 && < 2.6,
                     haskell-src-exts >= 1.9.6 && < 1.14,
                     containers >= 0.1 && < 0.5,
                     pretty >= 1.0 && < 1.2,
--- Agda-2.3.0.1-orig/src/full/Agda/Termination/Lexicographic.hs	2012-11-09 03:23:20.938830800 +0900
+++ Agda-2.3.0.1/src/full/Agda/Termination/Lexicographic.hs	2012-11-09 03:22:25.918728273 +0900
@@ -1,3 +1,4 @@
+{-# LANGUAGE CPP #-}
 -- | Lexicographic order search, more or less as defined in
 --      \"A Predicative Analysis of Structural Recursion\" by
 --      Andreas Abel and Thorsten Altenkirch.
@@ -230,7 +231,11 @@
   , quickCheck' prop_fromDiagonals
   , quickCheck' prop_newBehaviour
   , quickCheckWith' stdArgs{ maxSuccess = 50
+#if MIN_VERSION_QuickCheck(2,5,0)
+                           , maxDiscardRatio = 4
+#else
                            , maxDiscard = 200
+#endif
                            , maxSize    = 20
                            }
                     prop_lexOrder