gps1 :: [Int] -> Maybe Int
-- testing 4 combinations of argument values
-- pruning with 11/21 rules
-- 0 candidates of size 1
-- 0 candidates of size 2
-- 0 candidates of size 3
-- 1 candidates of size 4
-- 0 candidates of size 5
-- 0 candidates of size 6
-- 1 candidates of size 7
-- 0 candidates of size 8
-- 1 candidates of size 9
-- 2 candidates of size 10
-- tested 5 candidates
gps1 xs  =  findIndex (0 >) (map (foldr (+) 0) (tail (inits xs)))

gps1 :: [Int] -> Maybe Int
-- testing 4 combinations of argument values
-- pruning with 11/21 rules
-- 0 candidates of size 1
-- 0 candidates of size 2
-- 0 candidates of size 3
-- 1 candidates of size 4
-- 1 candidates of size 5
-- 0 candidates of size 6
-- 1 candidates of size 7
-- 4 candidates of size 8
-- tested 6 candidates
gps1 xs  =  findIndex (0 >) (map sum (tail (inits xs)))

gps1 :: Int -> [Int] -> Int
-- testing 6 combinations of argument values
-- pruning with 8/9 rules
-- 4 candidates of size 1
-- 0 candidates of size 2
-- 11 candidates of size 3
-- 29 candidates of size 4
-- tested 44 candidates
cannot conjure

gps2 :: Double -> Double -> Int -> Double
-- testing 5 combinations of argument values
-- pruning with 2/6 rules
-- 2 candidates of size 1
-- 2 candidates of size 2
-- 16 candidates of size 3
-- 64 candidates of size 4
-- 256 candidates of size 5
-- 1252 candidates of size 6
-- tested 1592 candidates
cannot conjure

gps3 :: [Char] -> Int
-- pruning with 0/0 rules
-- 0 candidates of size 1
-- 0 candidates of size 2
-- tested 0 candidates
cannot conjure

gps4 :: [Char] -> [Char]
-- pruning with 13/21 rules
-- 2 candidates of size 1
-- 3 candidates of size 2
-- 8 candidates of size 3
-- 20 candidates of size 4
-- 51 candidates of size 5
-- 119 candidates of size 6
-- tested 203 candidates
cannot conjure

gps5 :: Int -> [Int]
-- testing 6 combinations of argument values
-- pruning with 0/0 rules
-- 0 candidates of size 1
-- tested 0 candidates
cannot conjure

tell :: [Int] -> Int -> [Int]
-- pruning with 0/0 rules
-- 2 candidates of size 1
-- 1 candidates of size 2
-- 2 candidates of size 3
-- 6 candidates of size 4
-- 6 candidates of size 5
-- 39 candidates of size 6
-- 26 candidates of size 7
-- 328 candidates of size 8
-- 134 candidates of size 9
-- 3229 candidates of size 10
-- tested 783 candidates
tell [] x  =  []
tell (x:xs) y  =  y `div` x:tell xs (y `mod` x)

gps5 :: Int -> [Int]
-- testing 6 combinations of argument values
-- pruning with 0/0 rules
-- 1 candidates of size 1
-- 0 candidates of size 2
-- 1 candidates of size 3
-- tested 2 candidates
gps5 x  =  tell [25,10,5,1] x

gps5 :: Int -> [Int]
-- testing 6 combinations of argument values
-- pruning with 12/12 rules
-- 1 candidates of size 1
-- 0 candidates of size 2
-- 5 candidates of size 3
-- 9 candidates of size 4
-- 45 candidates of size 5
-- 82 candidates of size 6
-- 428 candidates of size 7
-- 882 candidates of size 8
-- 4350 candidates of size 9
-- 9232 candidates of size 10
-- 43847 candidates of size 11
-- tested 32290 candidates
gps5 x  =  tell [25,10,5,1] x

gps6 :: [Int] -> Int
-- testing 360 combinations of argument values
-- pruning with 0/0 rules
-- 0 candidates of size 1
-- 0 candidates of size 2
-- tested 0 candidates
cannot conjure

gps7 :: Integer -> Integer -> Ratio Integer
-- testing 6 combinations of argument values
-- pruning with 0/0 rules
-- 0 candidates of size 1
-- tested 0 candidates
cannot conjure

gps8 :: Int -> [Int] -> (Int,Int)
-- testing 3 combinations of argument values
-- pruning with 0/0 rules
-- 0 candidates of size 1
-- 0 candidates of size 2
-- tested 0 candidates
cannot conjure

gps9 :: Int -> [Char]
-- testing 7 combinations of argument values
-- pruning with 0/0 rules
-- 0 candidates of size 1
-- tested 0 candidates
cannot conjure

gps10 :: [Int] -> Int
-- testing 7 combinations of argument values
-- pruning with 67/100 rules
-- 4 candidates of size 1
-- 0 candidates of size 2
-- 0 candidates of size 3
-- 0 candidates of size 4
-- 80 candidates of size 5
-- 8 candidates of size 6
-- 1428 candidates of size 7
-- 432 candidates of size 8
-- 30712 candidates of size 9
-- tested 7064 candidates
gps10 []  =  0
gps10 (x:xs)  =  gps10 xs + (x `div` 3 - 2)

gcd :: Int -> Int -> Int
-- testing 11 combinations of argument values
-- pruning with 0/0 rules
-- 3 candidates of size 1
-- 6 candidates of size 2
-- 11 candidates of size 3
-- 50 candidates of size 4
-- 98 candidates of size 5
-- 330 candidates of size 6
-- tested 172 candidates
gcd x 0  =  x
gcd x y  =  gcd y (x `mod` y)

gps12 :: [Char] -> [Char] -> [Int]
-- testing 5 combinations of argument values
-- pruning with 1/2 rules
-- 0 candidates of size 1
-- 0 candidates of size 2
-- 0 candidates of size 3
-- 0 candidates of size 4
-- 4 candidates of size 5
-- tested 3 candidates
gps12 cs ds  =  findIndices (ds `isPrefixOf`) (tails cs)

gps13_leaders :: [Int] -> [Int]
-- testing 4 combinations of argument values
-- pruning with 5/5 rules
-- 2 candidates of size 1
-- 0 candidates of size 2
-- 0 candidates of size 3
-- 0 candidates of size 4
-- 1 candidates of size 5
-- 0 candidates of size 6
-- 1 candidates of size 7
-- 0 candidates of size 8
-- 7 candidates of size 9
-- 4 candidates of size 10
-- 33 candidates of size 11
-- 18 candidates of size 12
-- tested 53 candidates
gps13_leaders []  =  []
gps13_leaders (x:xs)  =  if all (x >) xs
                         then x:gps13_leaders xs
                         else gps13_leaders xs

gps14_luhn :: [Int] -> Int
-- pruning with 0/0 rules
-- 0 candidates of size 1
-- 0 candidates of size 2
-- tested 0 candidates
cannot conjure

gps15_mastermind :: () -> ()
-- pruning with 0/1 rules
-- 1 candidates of size 1
-- tested 1 candidates
gps15_mastermind u  =  u

gps16_middle :: [Char] -> [Char]
-- testing 7 combinations of argument values
-- pruning with 10/11 rules
-- 2 candidates of size 1
-- 2 candidates of size 2
-- 2 candidates of size 3
-- 3 candidates of size 4
-- 6 candidates of size 5
-- 11 candidates of size 6
-- 23 candidates of size 7
-- 62 candidates of size 8
-- 175 candidates of size 9
-- 489 candidates of size 10
-- 1346 candidates of size 11
-- 3709 candidates of size 12
-- tested 2390 candidates
gps16_middle ""  =  ""
gps16_middle (c:cs)  =  if length cs <= 1
                        then c:cs
                        else gps16_middle (init cs)

gps17_pds :: [Int] -> Int
-- testing 5 combinations of argument values
-- pruning with 29/40 rules
-- 1 candidates of size 1
-- 1 candidates of size 2
-- 0 candidates of size 3
-- 0 candidates of size 4
-- 2 candidates of size 5
-- tested 4 candidates
cannot conjure

gps18_price :: [Double] -> [Double] -> Double
-- testing 4 combinations of argument values
-- pruning with 26/35 rules
-- 2 candidates of size 1
-- 0 candidates of size 2
-- 2 candidates of size 3
-- 0 candidates of size 4
-- 33 candidates of size 5
-- 176 candidates of size 6
-- tested 213 candidates
cannot conjure

gps19_snowday :: Int -> Double -> Double -> Double -> Double
-- testing 7 combinations of argument values
-- pruning with 6/19 rules
-- 3 candidates of size 1
-- 2 candidates of size 2
-- 21 candidates of size 3
-- 39 candidates of size 4
-- 312 candidates of size 5
-- 659 candidates of size 6
-- tested 1036 candidates
cannot conjure

gps20 :: [Char] -> Bool
-- pruning with 0/0 rules
-- 0 candidates of size 1
-- 0 candidates of size 2
-- tested 0 candidates
cannot conjure

spin :: [Char] -> [Char]
-- pruning with 6/6 rules
-- reasoning produced 1 incorrect properties, please re-run with more tests for faster results
-- 1 candidates of size 1
-- 1 candidates of size 2
-- 0 candidates of size 3
-- 0 candidates of size 4
-- 0 candidates of size 5
-- 0 candidates of size 6
-- 0 candidates of size 7
-- 4 candidates of size 8
-- tested 3 candidates
spin cs  =  if length cs >= 5
            then reverse cs
            else cs

gps21_spinwords :: [Char] -> [Char]
-- pruning with 16/16 rules
-- reasoning produced 2 incorrect properties, please re-run with more tests for faster results
-- 1 candidates of size 1
-- 2 candidates of size 2
-- 2 candidates of size 3
-- 3 candidates of size 4
-- 5 candidates of size 5
-- tested 12 candidates
gps21_spinwords cs  =  unwords (map spin (words cs))

digits :: Int -> [Int]
-- testing 5 combinations of argument values
-- pruning with 7/7 rules
-- 1 candidates of size 1
-- 0 candidates of size 2
-- 2 candidates of size 3
-- 3 candidates of size 4
-- 11 candidates of size 5
-- 13 candidates of size 6
-- 91 candidates of size 7
-- 104 candidates of size 8
-- 850 candidates of size 9
-- 923 candidates of size 10
-- 8902 candidates of size 11
-- tested 10900 candidates
cannot conjure

gps22 :: Int -> [Char]
-- pruning with 0/0 rules
-- 0 candidates of size 1
-- tested 0 candidates
cannot conjure

gps23 :: [Char] -> [Char] -> [Char] -> [Char]
-- pruning with 0/0 rules
-- 3 candidates of size 1
-- 12 candidates of size 2
-- 33 candidates of size 3
-- 36 candidates of size 4
-- 127 candidates of size 5
-- 507 candidates of size 6
-- 839 candidates of size 7
-- 784 candidates of size 8
-- 600 candidates of size 9
-- 2722 candidates of size 10
-- 5292 candidates of size 11
-- tested 10955 candidates
cannot conjure

gps24 :: [Char] -> Twitter
-- pruning with 4/8 rules
-- reasoning produced 4 incorrect properties, please re-run with more tests for faster results
-- 2 candidates of size 1
-- 3 candidates of size 2
-- 6 candidates of size 3
-- 6 candidates of size 4
-- 3 candidates of size 5
-- 5 candidates of size 6
-- 10 candidates of size 7
-- 48 candidates of size 8
-- 134 candidates of size 9
-- 216 candidates of size 10
-- 308 candidates of size 11
-- 466 candidates of size 12
-- tested 881 candidates
gps24 ""  =  Empty
gps24 (c:cs)  =  if 140 > length cs
                 then Tweet (length (c:cs))
                 else TooMany

gps25 :: [Double] -> [Double] -> Double
-- testing 6 combinations of argument values
-- pruning with 31/59 rules
-- 2 candidates of size 1
-- 1 candidates of size 2
-- 5 candidates of size 3
-- 10 candidates of size 4
-- 76 candidates of size 5
-- 438 candidates of size 6
-- tested 532 candidates
cannot conjure