-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlist.txt
37 lines (33 loc) · 839 Bytes
/
list.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
max expr size = 5
|- on conds = 4
max #-tests = 500
min #-tests = 25 (to consider p ==> q true)
max #-vars = 3 (for inequational and conditional laws)
_ :: Int
_ :: [Int]
[] :: [Int]
(:) :: Int -> [Int] -> [Int]
(++) :: [Int] -> [Int] -> [Int]
head :: [Int] -> Int
tail :: [Int] -> [Int]
head (x:xs) == x
xs ++ [] == xs
[] ++ xs == xs
tail (x:xs) == xs
(xs ++ ys) ++ zs == xs ++ (ys ++ zs)
(x:xs) ++ ys == x:(xs ++ ys)
[] <= xs
xs <= x:xs
xs <= xs ++ ys
xs <= ys ++ xs
xs <= tail (xs ++ xs)
[x] <= x:xs
xs <= head xs:tail xs
x:xs <= x:y:xs
xs ++ ys <= xs ++ (ys ++ zs)
xs ++ ys <= xs ++ (zs ++ ys)
x:xs <= x:(xs ++ ys)
x:xs <= x:(ys ++ xs)
xs ++ ys <= xs ++ (x:ys)
[x,y] <= x:y:xs
xs ++ [x] <= xs ++ (x:ys)