build packages.x86_64-linux.ghc963_all

Reproduce this run
  1. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  2. 1159.17 s [algebraic-graphs] OK: replaceVertex x x == id
  3. 1159.17 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  4. 1159.17 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  5. 1159.17 s [algebraic-graphs]
  6. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  7. 1159.17 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  8. 1159.17 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  9. 1159.17 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  10. 1159.17 s [algebraic-graphs]
  11. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  12. 1159.17 s [algebraic-graphs] OK: transpose empty == empty
  13. 1159.17 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  14. 1159.17 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  15. 1159.17 s [algebraic-graphs] OK: transpose . transpose == id
  16. 1159.17 s [algebraic-graphs]
  17. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  18. 1159.17 s [algebraic-graphs] OK: gmap f empty == empty
  19. 1159.17 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20. 1159.17 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  21. 1159.17 s [algebraic-graphs] OK: gmap id == id
  22. 1159.17 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23. 1159.17 s [algebraic-graphs]
  24. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  25. 1159.17 s [algebraic-graphs] OK: emap h empty == empty
  26. 1159.17 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  27. 1159.17 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  28. 1159.17 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  29. 1159.17 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  30. 1159.17 s [algebraic-graphs] OK: emap id == id
  31. 1159.17 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  32. 1159.17 s [algebraic-graphs]
  33. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  34. 1159.17 s [algebraic-graphs] OK: induce (const True ) x == x
  35. 1159.17 s [algebraic-graphs] OK: induce (const False) x == empty
  36. 1159.17 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  37. 1159.17 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  38. 1159.17 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  39. 1159.17 s [algebraic-graphs]
  40. 1159.17 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  41. 1161.03 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  42. 1161.03 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  43. 1161.12 s [algebraic-graphs] OK: induceJust . gmap Just == id
  44. 1161.12 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  45. 1161.12 s [algebraic-graphs]
  46. 1161.12 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  47. 1161.13 s [algebraic-graphs] OK: closure empty == empty
  48. 1161.13 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  49. 1161.13 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  50. 1161.13 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  51. 1161.13 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  52. 1161.13 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  53. 1161.13 s [algebraic-graphs] OK: closure . closure == closure
  54. 1161.13 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  55. 1161.13 s [algebraic-graphs]
  56. 1161.13 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  57. 1161.13 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  58. 1161.13 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  59. 1161.13 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  60. 1161.13 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  61. 1161.13 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  62. 1161.13 s [algebraic-graphs]
  63. 1161.13 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  64. 1161.13 s [algebraic-graphs] OK: symmetricClosure empty == empty
  65. 1161.13 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  66. 1161.13 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  67. 1161.13 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  68. 1161.13 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  69. 1161.13 s [algebraic-graphs]
  70. 1161.13 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  71. 1161.13 s [algebraic-graphs] OK: transitiveClosure empty == empty
  72. 1161.13 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  73. 1161.13 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  74. 1161.13 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  75. 1161.13 s [algebraic-graphs]
  76. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  77. 1161.13 s [algebraic-graphs] OK: isEmpty empty == True
  78. 1161.13 s [algebraic-graphs] OK: hasVertex x empty == False
  79. 1161.13 s [algebraic-graphs] OK: vertexCount empty == 0
  80. 1161.13 s [algebraic-graphs] OK: edgeCount empty == 0
  81. 1161.13 s [algebraic-graphs]
  82. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  83. 1161.13 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  84. 1161.13 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  85. 1161.13 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  86. 1161.13 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  87. 1161.13 s [algebraic-graphs]
  88. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  89. 1161.13 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  90. 1161.13 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  91. 1161.13 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  92. 1161.13 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  93. 1161.13 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  94. 1161.13 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  95. 1161.13 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  96. 1161.13 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  97. 1161.13 s [algebraic-graphs]
  98. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  99. 1161.13 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  100. 1161.13 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  101. 1161.13 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  102. 1161.13 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  103. 1161.13 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  104. 1161.13 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  105. 1161.13 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  106. 1161.13 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  107. 1161.13 s [algebraic-graphs]
  108. 1161.13 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  109. 1161.13 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  110. 1161.13 s [algebraic-graphs]
  111. 1161.13 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  112. 1161.13 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  113. 1161.13 s [algebraic-graphs]
  114. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  115. 1161.13 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  116. 1161.13 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  117. 1161.13 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  118. 1161.13 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  119. 1161.13 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  120. 1161.13 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  121. 1161.13 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  122. 1161.13 s [algebraic-graphs]
  123. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  124. 1161.13 s [algebraic-graphs] OK: vertices [] == empty
  125. 1161.13 s [algebraic-graphs] OK: vertices [x] == vertex x
  126. 1161.13 s [algebraic-graphs] OK: vertices == overlays . map vertex
  127. 1161.13 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  128. 1161.13 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  129. 1161.13 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  130. 1161.13 s [algebraic-graphs]
  131. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  132. 1161.13 s [algebraic-graphs] OK: edges [] == empty
  133. 1161.13 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  134. 1161.13 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  135. 1161.13 s [algebraic-graphs]
  136. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  137. 1161.13 s [algebraic-graphs] OK: overlays [] == empty
  138. 1161.13 s [algebraic-graphs] OK: overlays [x] == x
  139. 1161.13 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  140. 1161.13 s [algebraic-graphs] OK: overlays == foldr overlay empty
  141. 1161.13 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  142. 1161.13 s [algebraic-graphs]
  143. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  144. 1161.13 s [algebraic-graphs] OK: foldg empty vertex connect == id
  145. 1161.13 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  146. 1161.13 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  147. 1161.13 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  148. 1161.13 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  149. 1161.13 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  150. 1161.13 s [algebraic-graphs]
  151. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  152. 1161.13 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  153. 1161.13 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  154. 1161.13 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  155. 1161.13 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  156. 1161.13 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  157. 1161.13 s [algebraic-graphs]
  158. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  159. 1161.13 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  160. 1161.13 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  161. 1161.13 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  162. 1161.13 s [algebraic-graphs]
  163. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  164. 1161.13 s [algebraic-graphs] OK: isEmpty empty == True
  165. 1161.13 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  166. 1161.13 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  167. 1161.13 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  168. 1161.13 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  169. 1161.13 s [algebraic-graphs]
  170. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.size ============
  171. 1161.13 s [algebraic-graphs] OK: size empty == 1
  172. 1161.13 s [algebraic-graphs] OK: size (vertex x) == 1
  173. 1161.13 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  174. 1161.13 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  175. 1161.13 s [algebraic-graphs] OK: size x >= 1
  176. 1161.13 s [algebraic-graphs] OK: size x >= vertexCount x
  177. 1161.13 s [algebraic-graphs]
  178. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  179. 1161.13 s [algebraic-graphs] OK: hasVertex x empty == False
  180. 1161.13 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  181. 1161.13 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  182. 1161.13 s [algebraic-graphs]
  183. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  184. 1161.13 s [algebraic-graphs] OK: hasEdge x y empty == False
  185. 1161.13 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  186. 1161.13 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  187. 1161.13 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  188. 1161.13 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  189. 1161.13 s [algebraic-graphs]
  190. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  191. 1161.13 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  192. 1161.13 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  193. 1161.13 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  194. 1161.13 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  195. 1161.13 s [algebraic-graphs]
  196. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  197. 1161.13 s [algebraic-graphs] OK: vertexCount empty == 0
  198. 1161.13 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  199. 1161.13 s [algebraic-graphs] OK: vertexCount == length . vertexList
  200. 1161.13 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  201. 1161.13 s [algebraic-graphs]
  202. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  203. 1161.13 s [algebraic-graphs] OK: edgeCount empty == 0
  204. 1161.13 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  205. 1161.13 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  206. 1161.13 s [algebraic-graphs] OK: edgeCount == length . edgeList
  207. 1161.13 s [algebraic-graphs]
  208. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  209. 1161.13 s [algebraic-graphs] OK: vertexList empty == []
  210. 1161.13 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  211. 1161.13 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  212. 1161.13 s [algebraic-graphs]
  213. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  214. 1161.13 s [algebraic-graphs] OK: edgeList empty == []
  215. 1161.13 s [algebraic-graphs] OK: edgeList (vertex x) == []
  216. 1161.13 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  217. 1161.13 s [algebraic-graphs]
  218. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  219. 1161.13 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  220. 1161.13 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  221. 1161.13 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  222. 1161.13 s [algebraic-graphs]
  223. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  224. 1161.13 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  225. 1161.13 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  226. 1161.13 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  227. 1161.13 s [algebraic-graphs]
  228. 1161.13 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  229. 1161.13 s [algebraic-graphs] OK: preSet x empty == Set.empty
  230. 1161.13 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  231. 1165.53 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  232. 1165.53 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  233. 1165.53 s [algebraic-graphs]
  234. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  235. 1165.53 s [algebraic-graphs] OK: postSet x empty == Set.empty
  236. 1165.53 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  237. 1165.53 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  238. 1165.53 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  239. 1165.53 s [algebraic-graphs]
  240. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  241. 1165.53 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  242. 1165.53 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  243. 1165.53 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  244. 1165.53 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  245. 1165.53 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  246. 1165.53 s [algebraic-graphs]
  247. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  248. 1165.53 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  249. 1165.53 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  250. 1165.53 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  251. 1165.53 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  252. 1165.53 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  253. 1165.53 s [algebraic-graphs]
  254. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  255. 1165.53 s [algebraic-graphs] OK: replaceVertex x x == id
  256. 1165.53 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  257. 1165.53 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  258. 1165.53 s [algebraic-graphs]
  259. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  260. 1165.53 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  261. 1165.53 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  262. 1165.53 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  263. 1165.53 s [algebraic-graphs]
  264. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  265. 1165.53 s [algebraic-graphs] OK: transpose empty == empty
  266. 1165.53 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  267. 1165.53 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  268. 1165.53 s [algebraic-graphs] OK: transpose . transpose == id
  269. 1165.53 s [algebraic-graphs]
  270. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  271. 1165.53 s [algebraic-graphs] OK: fmap f empty == empty
  272. 1165.53 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  273. 1165.53 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  274. 1165.53 s [algebraic-graphs] OK: fmap id == id
  275. 1165.53 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  276. 1165.53 s [algebraic-graphs]
  277. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  278. 1165.53 s [algebraic-graphs] OK: emap h empty == empty
  279. 1165.53 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  280. 1165.53 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  281. 1165.53 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  282. 1165.53 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  283. 1165.53 s [algebraic-graphs] OK: emap id == id
  284. 1165.53 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  285. 1165.53 s [algebraic-graphs]
  286. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  287. 1165.53 s [algebraic-graphs] OK: induce (const True ) x == x
  288. 1165.53 s [algebraic-graphs] OK: induce (const False) x == empty
  289. 1165.53 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  290. 1165.53 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  291. 1165.53 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  292. 1165.53 s [algebraic-graphs]
  293. 1165.53 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  294. 1165.54 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  295. 1165.54 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  296. 1165.54 s [algebraic-graphs] OK: induceJust . gmap Just == id
  297. 1165.54 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  298. 1165.54 s [algebraic-graphs]
  299. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  300. 1165.54 s [algebraic-graphs] OK: closure empty == empty
  301. 1165.54 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  302. 1165.54 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  303. 1165.54 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  304. 1165.54 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  305. 1165.54 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  306. 1165.54 s [algebraic-graphs] OK: closure . closure == closure
  307. 1165.54 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  308. 1165.54 s [algebraic-graphs]
  309. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  310. 1165.54 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  311. 1165.54 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  312. 1165.54 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  313. 1165.54 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  314. 1165.54 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  315. 1165.54 s [algebraic-graphs]
  316. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  317. 1165.54 s [algebraic-graphs] OK: symmetricClosure empty == empty
  318. 1165.54 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  319. 1165.54 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  320. 1165.54 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  321. 1165.54 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  322. 1165.54 s [algebraic-graphs]
  323. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  324. 1165.54 s [algebraic-graphs] OK: transitiveClosure empty == empty
  325. 1165.54 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  326. 1165.54 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  327. 1165.54 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  328. 1165.54 s [algebraic-graphs]
  329. 1165.54 s [algebraic-graphs] ============ Labelled.Graph.context ============
  330. 1165.54 s [algebraic-graphs] OK: context (const False) x == Nothing
  331. 1165.54 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  332. 1165.54 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  333. 1165.54 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  334. 1165.54 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  335. 1165.54 s [algebraic-graphs]
  336. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  337. 1165.54 s [algebraic-graphs] OK: Axioms of non-empty graphs
  338. 1165.54 s [algebraic-graphs] OK: Theorems of non-empty graphs
  339. 1165.54 s [algebraic-graphs]
  340. 1165.54 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  341. 1165.54 s [algebraic-graphs] OK: vertex 1 < vertex 2
  342. 1165.54 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  343. 1165.54 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  344. 1165.54 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  345. 1165.54 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  346. 1165.54 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  347. 1165.54 s [algebraic-graphs] OK: x <= x + y
  348. 1165.54 s [algebraic-graphs] OK: x + y <= x * y
  349. 1165.54 s [algebraic-graphs]
  350. 1165.54 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  351. 1165.54 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  352. 1165.54 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  353. 1165.54 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  354. 1165.54 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  355. 1165.54 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  356. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  357. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  358. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  359. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  360. 1165.54 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  361. 1165.54 s [algebraic-graphs]
  362. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  363. 1165.54 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  364. 1165.54 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  365. 1165.54 s [algebraic-graphs]
  366. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  367. 1165.54 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  368. 1165.54 s [algebraic-graphs]
  369. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  370. 1165.54 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  371. 1165.54 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  372. 1165.54 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  373. 1165.54 s [algebraic-graphs]
  374. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  375. 1165.54 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  376. 1165.54 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  377. 1165.54 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  378. 1165.54 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  379. 1165.54 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  380. 1165.54 s [algebraic-graphs]
  381. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  382. 1165.54 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  383. 1165.54 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  384. 1165.54 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  385. 1165.54 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  386. 1165.54 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  387. 1165.54 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  388. 1165.54 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  389. 1165.54 s [algebraic-graphs]
  390. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  391. 1165.54 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  392. 1165.54 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  393. 1165.54 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  394. 1165.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  395. 1165.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  396. 1165.54 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  397. 1165.54 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  398. 1165.54 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  399. 1165.54 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  400. 1165.54 s [algebraic-graphs]
  401. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  402. 1165.54 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  403. 1165.54 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  404. 1165.54 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  405. 1165.54 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  406. 1165.54 s [algebraic-graphs]
  407. 1165.54 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  408. 1165.54 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  409. 1165.54 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  410. 1165.54 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  411. 1165.54 s [algebraic-graphs]
  412. 1169.83 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  413. 1169.83 s [algebraic-graphs] OK: overlays1 [x] == x
  414. 1169.94 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  415. 1169.94 s [algebraic-graphs]
  416. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  417. 1169.94 s [algebraic-graphs] OK: connects1 [x] == x
  418. 1169.94 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  419. 1169.94 s [algebraic-graphs]
  420. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  421. 1169.94 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  422. 1169.94 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  423. 1169.94 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  424. 1169.94 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  425. 1169.94 s [algebraic-graphs]
  426. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  427. 1169.94 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  428. 1169.94 s [algebraic-graphs]
  429. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  430. 1169.94 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  431. 1169.94 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  432. 1169.94 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  433. 1169.94 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  434. 1169.94 s [algebraic-graphs]
  435. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  436. 1169.94 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  437. 1169.94 s [algebraic-graphs] OK: vertexCount x >= 1
  438. 1169.94 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  439. 1169.94 s [algebraic-graphs]
  440. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  441. 1169.94 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  442. 1169.94 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  443. 1169.94 s [algebraic-graphs] OK: edgeCount == length . edgeList
  444. 1169.94 s [algebraic-graphs]
  445. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  446. 1169.94 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  447. 1169.94 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  448. 1169.94 s [algebraic-graphs]
  449. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  450. 1169.94 s [algebraic-graphs] OK: edgeList (vertex x) == []
  451. 1169.94 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  452. 1169.94 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  453. 1169.94 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  454. 1169.94 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  455. 1169.94 s [algebraic-graphs]
  456. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  457. 1169.94 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  458. 1169.94 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  459. 1169.94 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  460. 1169.94 s [algebraic-graphs]
  461. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  462. 1169.94 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  463. 1169.94 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  464. 1169.94 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  465. 1169.94 s [algebraic-graphs]
  466. 1169.94 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  467. 1169.94 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  468. 1169.94 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  469. 1169.94 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  470. 1169.95 s [algebraic-graphs]
  471. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  472. 1169.95 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  473. 1169.95 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  474. 1169.95 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  475. 1169.95 s [algebraic-graphs]
  476. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  477. 1169.95 s [algebraic-graphs] OK: path1 [x] == vertex x
  478. 1169.95 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  479. 1169.95 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  480. 1169.95 s [algebraic-graphs]
  481. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  482. 1169.95 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  483. 1169.95 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  484. 1169.95 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  485. 1169.95 s [algebraic-graphs]
  486. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  487. 1169.95 s [algebraic-graphs] OK: clique1 [x] == vertex x
  488. 1169.95 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  489. 1169.95 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  490. 1169.95 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  491. 1169.95 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  492. 1169.95 s [algebraic-graphs]
  493. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  494. 1169.95 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  495. 1169.95 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  496. 1169.95 s [algebraic-graphs]
  497. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  498. 1169.95 s [algebraic-graphs] OK: star x [] == vertex x
  499. 1169.95 s [algebraic-graphs] OK: star x [y] == edge x y
  500. 1169.95 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  501. 1169.95 s [algebraic-graphs]
  502. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  503. 1169.95 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  504. 1169.95 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  505. 1169.95 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  506. 1169.95 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  507. 1169.95 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  508. 1169.95 s [algebraic-graphs]
  509. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  510. 1169.95 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  511. 1169.95 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  512. 1169.95 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  513. 1169.95 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  514. 1169.95 s [algebraic-graphs]
  515. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  516. 1169.95 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  517. 1169.95 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  518. 1169.95 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  519. 1169.95 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  520. 1169.95 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  521. 1169.95 s [algebraic-graphs]
  522. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  523. 1169.95 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  524. 1169.95 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  525. 1169.95 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  526. 1169.95 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  527. 1169.95 s [algebraic-graphs]
  528. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  529. 1169.95 s [algebraic-graphs] OK: replaceVertex x x == id
  530. 1169.95 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  531. 1169.95 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  532. 1169.95 s [algebraic-graphs]
  533. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  534. 1169.95 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  535. 1169.95 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  536. 1169.95 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  537. 1169.95 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  538. 1169.95 s [algebraic-graphs]
  539. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  540. 1169.95 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  541. 1169.95 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  542. 1169.95 s [algebraic-graphs] OK: transpose . transpose == id
  543. 1169.95 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  544. 1169.95 s [algebraic-graphs]
  545. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  546. 1169.95 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  547. 1169.95 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  548. 1169.95 s [algebraic-graphs] OK: gmap id == id
  549. 1169.95 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  550. 1169.95 s [algebraic-graphs]
  551. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  552. 1169.95 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  553. 1169.95 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  554. 1169.95 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  555. 1169.95 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  556. 1169.95 s [algebraic-graphs]
  557. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  558. 1169.95 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  559. 1169.95 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  560. 1169.95 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  561. 1169.95 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  562. 1169.95 s [algebraic-graphs]
  563. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  564. 1169.95 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  565. 1169.95 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  566. 1169.95 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  567. 1169.95 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  568. 1169.95 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  569. 1169.95 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  570. 1169.95 s [algebraic-graphs] OK: closure . closure == closure
  571. 1169.95 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  572. 1169.95 s [algebraic-graphs]
  573. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  574. 1169.95 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  575. 1169.95 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  576. 1169.95 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  577. 1169.95 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  578. 1169.95 s [algebraic-graphs]
  579. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  580. 1169.95 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  581. 1169.95 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  582. 1169.95 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  583. 1169.95 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  584. 1169.95 s [algebraic-graphs]
  585. 1169.95 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  586. 1169.95 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  587. 1169.95 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  588. 1169.95 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  589. 1169.95 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  590. 1169.95 s [algebraic-graphs]
  591. 1169.95 s [algebraic-graphs] ============ NonEmpty.Graph.============
  592. 1169.95 s [algebraic-graphs] OK: Axioms of non-empty graphs
  593. 1169.95 s [algebraic-graphs] OK: Theorems of non-empty graphs
  594. 1169.95 s [algebraic-graphs]
  595. 1169.95 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  596. 1169.95 s [algebraic-graphs] OK: vertex 1 < vertex 2
  597. 1169.95 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  598. 1169.95 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  599. 1169.95 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  600. 1169.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  601. 1169.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  602. 1169.95 s [algebraic-graphs] OK: x <= x + y
  603. 1169.95 s [algebraic-graphs] OK: x + y <= x * y
  604. 1169.95 s [algebraic-graphs]
  605. 1169.95 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  606. 1169.95 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  607. 1169.95 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  608. 1169.95 s [algebraic-graphs] OK: fmap id == id
  609. 1169.95 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  610. 1169.95 s [algebraic-graphs]
  611. 1169.95 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  612. 1169.95 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  613. 1172.11 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  614. 1172.11 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  615. 1172.11 s [algebraic-graphs] OK: (x >>= vertex) == x
  616. 1172.11 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  617. 1172.11 s [algebraic-graphs]
  618. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  619. 1172.11 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  620. 1172.11 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  621. 1172.11 s [algebraic-graphs]
  622. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  623. 1172.11 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  624. 1172.11 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  625. 1172.11 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  626. 1172.11 s [algebraic-graphs] OK: size (vertex x) == 1
  627. 1172.11 s [algebraic-graphs]
  628. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  629. 1172.11 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  630. 1172.11 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  631. 1172.11 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  632. 1172.11 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  633. 1172.11 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  634. 1172.11 s [algebraic-graphs]
  635. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  636. 1172.11 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  637. 1172.11 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  638. 1172.11 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  639. 1172.11 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  640. 1172.11 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  641. 1172.11 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  642. 1172.11 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  643. 1172.11 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  644. 1172.11 s [algebraic-graphs]
  645. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  646. 1172.11 s [algebraic-graphs] OK: overlay1 empty x == x
  647. 1172.11 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  648. 1172.11 s [algebraic-graphs]
  649. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  650. 1172.11 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  651. 1172.11 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  652. 1172.11 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  653. 1172.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  654. 1172.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  655. 1172.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  656. 1172.11 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  657. 1172.11 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  658. 1172.11 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  659. 1172.11 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  660. 1172.11 s [algebraic-graphs]
  661. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  662. 1172.11 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  663. 1172.11 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  664. 1172.11 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  665. 1172.11 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  666. 1172.11 s [algebraic-graphs]
  667. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  668. 1172.11 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  669. 1172.11 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  670. 1172.11 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  671. 1172.11 s [algebraic-graphs]
  672. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  673. 1172.11 s [algebraic-graphs] OK: overlays1 [x] == x
  674. 1172.11 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  675. 1172.11 s [algebraic-graphs]
  676. 1172.11 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  677. 1172.11 s [algebraic-graphs] OK: connects1 [x] == x
  678. 1172.12 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  679. 1172.12 s [algebraic-graphs]
  680. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  681. 1172.12 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  682. 1172.12 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  683. 1172.12 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  684. 1172.12 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  685. 1172.12 s [algebraic-graphs]
  686. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  687. 1172.12 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  688. 1172.12 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  689. 1172.12 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  690. 1172.12 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  691. 1172.12 s [algebraic-graphs]
  692. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  693. 1172.12 s [algebraic-graphs] OK: x === x == True
  694. 1172.12 s [algebraic-graphs] OK: x + y === x + y == True
  695. 1172.12 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  696. 1172.12 s [algebraic-graphs] OK: x + y === x * y == False
  697. 1172.12 s [algebraic-graphs]
  698. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  699. 1172.12 s [algebraic-graphs] OK: size (vertex x) == 1
  700. 1172.12 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  701. 1172.12 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  702. 1172.12 s [algebraic-graphs] OK: size x >= 1
  703. 1172.12 s [algebraic-graphs] OK: size x >= vertexCount x
  704. 1172.12 s [algebraic-graphs]
  705. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  706. 1172.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  707. 1172.12 s [algebraic-graphs]
  708. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  709. 1172.12 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  710. 1172.12 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  711. 1172.12 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  712. 1172.12 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  713. 1172.12 s [algebraic-graphs]
  714. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  715. 1172.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  716. 1172.12 s [algebraic-graphs] OK: vertexCount x >= 1
  717. 1172.12 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  718. 1172.12 s [algebraic-graphs]
  719. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  720. 1172.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  721. 1172.12 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  722. 1172.12 s [algebraic-graphs] OK: edgeCount == length . edgeList
  723. 1172.12 s [algebraic-graphs]
  724. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  725. 1172.12 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  726. 1172.12 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  727. 1172.12 s [algebraic-graphs]
  728. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  729. 1172.12 s [algebraic-graphs] OK: edgeList (vertex x) == []
  730. 1172.12 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  731. 1172.12 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  732. 1172.12 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  733. 1172.12 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  734. 1172.12 s [algebraic-graphs]
  735. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  736. 1172.12 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  737. 1172.12 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  738. 1172.12 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  739. 1172.12 s [algebraic-graphs]
  740. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  741. 1172.12 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  742. 1172.12 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  743. 1172.12 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  744. 1172.12 s [algebraic-graphs]
  745. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  746. 1172.12 s [algebraic-graphs] OK: path1 [x] == vertex x
  747. 1172.12 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  748. 1172.12 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  749. 1172.12 s [algebraic-graphs]
  750. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  751. 1172.12 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  752. 1172.12 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  753. 1172.12 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  754. 1172.12 s [algebraic-graphs]
  755. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  756. 1172.12 s [algebraic-graphs] OK: clique1 [x] == vertex x
  757. 1172.12 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  758. 1172.12 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  759. 1172.12 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  760. 1172.12 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  761. 1172.12 s [algebraic-graphs]
  762. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  763. 1172.12 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  764. 1172.12 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  765. 1172.12 s [algebraic-graphs]
  766. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  767. 1172.12 s [algebraic-graphs] OK: star x [] == vertex x
  768. 1172.12 s [algebraic-graphs] OK: star x [y] == edge x y
  769. 1172.12 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  770. 1172.12 s [algebraic-graphs]
  771. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  772. 1172.12 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  773. 1172.12 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  774. 1172.12 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  775. 1172.12 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  776. 1172.12 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  777. 1172.12 s [algebraic-graphs]
  778. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  779. 1172.12 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  780. 1172.12 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  781. 1172.12 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  782. 1172.12 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  783. 1172.12 s [algebraic-graphs]
  784. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  785. 1172.12 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  786. 1172.12 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  787. 1172.12 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  788. 1172.12 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  789. 1172.12 s [algebraic-graphs]
  790. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  791. 1172.12 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  792. 1172.12 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  793. 1172.12 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  794. 1172.12 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  795. 1172.12 s [algebraic-graphs]
  796. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  797. 1172.12 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  798. 1172.12 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  799. 1172.12 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  800. 1172.12 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  801. 1172.12 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  802. 1172.12 s [algebraic-graphs]
  803. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  804. 1172.12 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  805. 1172.12 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  806. 1172.12 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  807. 1172.12 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  808. 1172.12 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  809. 1172.12 s [algebraic-graphs]
  810. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  811. 1172.12 s [algebraic-graphs] OK: replaceVertex x x == id
  812. 1172.12 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  813. 1172.12 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  814. 1172.12 s [algebraic-graphs]
  815. 1172.12 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  816. 1172.12 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  817. 1181.02 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  818. 1181.02 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  819. 1181.06 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  820. 1181.06 s [algebraic-graphs]
  821. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  822. 1181.06 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  823. 1181.06 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  824. 1181.06 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  825. 1181.06 s [algebraic-graphs]
  826. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  827. 1181.06 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  828. 1181.06 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  829. 1181.06 s [algebraic-graphs] OK: transpose . transpose == id
  830. 1181.06 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  831. 1181.06 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  832. 1181.06 s [algebraic-graphs]
  833. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  834. 1181.06 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  835. 1181.06 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  836. 1181.06 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  837. 1181.06 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  838. 1181.06 s [algebraic-graphs]
  839. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  840. 1181.06 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  841. 1181.06 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  842. 1181.06 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  843. 1181.06 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  844. 1181.06 s [algebraic-graphs]
  845. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  846. 1181.06 s [algebraic-graphs] OK: simplify == id
  847. 1181.06 s [algebraic-graphs] OK: size (simplify x) <= size x
  848. 1181.06 s [algebraic-graphs] OK: simplify 1 === 1
  849. 1181.06 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  850. 1181.06 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  851. 1181.06 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  852. 1181.06 s [algebraic-graphs]
  853. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  854. 1181.06 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  855. 1181.06 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  856. 1181.06 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  857. 1181.06 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  858. 1181.06 s [algebraic-graphs]
  859. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  860. 1181.06 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  861. 1181.06 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  862. 1181.06 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  863. 1181.06 s [algebraic-graphs]
  864. 1181.06 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  865. 1181.06 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  866. 1181.06 s [algebraic-graphs] OK: box x y ~~ box y x
  867. 1181.06 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  868. 1181.06 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  869. 1181.06 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  870. 1181.06 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  871. 1181.06 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  872. 1181.06 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  873. 1181.06 s [algebraic-graphs]
  874. 1181.06 s [algebraic-graphs] ============ Relation ============
  875. 1181.06 s [algebraic-graphs] OK: Axioms of graphs
  876. 1181.06 s [algebraic-graphs]
  877. 1181.06 s [algebraic-graphs] ============ Relation.consistent ============
  878. 1181.06 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  879. 1181.06 s [algebraic-graphs]
  880. 1181.06 s [algebraic-graphs] OK: consistent empty == True
  881. 1181.06 s [algebraic-graphs] OK: consistent (vertex x) == True
  882. 1181.06 s [algebraic-graphs] OK: consistent (overlay x y) == True
  883. 1181.06 s [algebraic-graphs] OK: consistent (connect x y) == True
  884. 1181.06 s [algebraic-graphs] OK: consistent (edge x y) == True
  885. 1181.06 s [algebraic-graphs] OK: consistent (edges xs) == True
  886. 1181.06 s [algebraic-graphs] OK: consistent (stars xs) == True
  887. 1181.06 s [algebraic-graphs]
  888. 1181.06 s [algebraic-graphs] ============ Relation.Show ============
  889. 1181.06 s [algebraic-graphs] OK: show (empty ) == "empty"
  890. 1181.06 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  891. 1181.06 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  892. 1181.06 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  893. 1181.06 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  894. 1181.06 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  895. 1181.06 s [algebraic-graphs]
  896. 1181.06 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  897. 1181.06 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  898. 1181.06 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  899. 1181.06 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  900. 1181.06 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  901. 1181.06 s [algebraic-graphs]
  902. 1181.06 s [algebraic-graphs] ============ Relation.Ord ============
  903. 1181.06 s [algebraic-graphs] OK: vertex 1 < vertex 2
  904. 1181.06 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  905. 1181.06 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  906. 1181.06 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  907. 1181.06 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  908. 1181.06 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  909. 1181.06 s [algebraic-graphs] OK: x <= x + y
  910. 1181.06 s [algebraic-graphs] OK: x + y <= x * y
  911. 1181.06 s [algebraic-graphs]
  912. 1181.06 s [algebraic-graphs] ============ Relation.empty ============
  913. 1181.06 s [algebraic-graphs] OK: isEmpty empty == True
  914. 1181.06 s [algebraic-graphs] OK: hasVertex x empty == False
  915. 1181.06 s [algebraic-graphs] OK: vertexCount empty == 0
  916. 1181.06 s [algebraic-graphs] OK: edgeCount empty == 0
  917. 1181.06 s [algebraic-graphs]
  918. 1181.06 s [algebraic-graphs] ============ Relation.vertex ============
  919. 1181.06 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  920. 1181.06 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  921. 1181.06 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  922. 1181.06 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  923. 1181.06 s [algebraic-graphs]
  924. 1181.06 s [algebraic-graphs] ============ Relation.edge ============
  925. 1181.06 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  926. 1181.06 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  927. 1181.06 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  928. 1181.06 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  929. 1181.06 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  930. 1181.06 s [algebraic-graphs]
  931. 1181.06 s [algebraic-graphs] ============ Relation.overlay ============
  932. 1181.06 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  933. 1181.06 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  934. 1181.06 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  935. 1181.06 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  936. 1181.06 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  937. 1181.06 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  938. 1181.06 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  939. 1181.06 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  940. 1181.06 s [algebraic-graphs]
  941. 1181.06 s [algebraic-graphs] ============ Relation.connect ============
  942. 1181.06 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  943. 1181.06 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  944. 1181.06 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  945. 1181.06 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  946. 1181.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  947. 1181.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  948. 1181.06 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  949. 1181.06 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  950. 1181.06 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  951. 1181.06 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  952. 1181.06 s [algebraic-graphs]
  953. 1181.07 s [algebraic-graphs] ============ Relation.vertices ============
  954. 1181.07 s [algebraic-graphs] OK: vertices [] == empty
  955. 1181.07 s [algebraic-graphs] OK: vertices [x] == vertex x
  956. 1181.07 s [algebraic-graphs] OK: vertices == overlays . map vertex
  957. 1181.07 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  958. 1181.07 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  959. 1181.07 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  960. 1181.07 s [algebraic-graphs]
  961. 1181.07 s [algebraic-graphs] ============ Relation.edges ============
  962. 1181.07 s [algebraic-graphs] OK: edges [] == empty
  963. 1181.07 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  964. 1181.07 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  965. 1181.07 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  966. 1181.07 s [algebraic-graphs]
  967. 1181.07 s [algebraic-graphs] ============ Relation.overlays ============
  968. 1181.07 s [algebraic-graphs] OK: overlays [] == empty
  969. 1181.07 s [algebraic-graphs] OK: overlays [x] == x
  970. 1181.07 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  971. 1181.07 s [algebraic-graphs] OK: overlays == foldr overlay empty
  972. 1181.07 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  973. 1181.07 s [algebraic-graphs]
  974. 1181.07 s [algebraic-graphs] ============ Relation.connects ============
  975. 1181.07 s [algebraic-graphs] OK: connects [] == empty
  976. 1181.07 s [algebraic-graphs] OK: connects [x] == x
  977. 1181.07 s [algebraic-graphs] OK: connects [x,y] == connect x y
  978. 1181.07 s [algebraic-graphs] OK: connects == foldr connect empty
  979. 1181.07 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  980. 1181.07 s [algebraic-graphs]
  981. 1181.07 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  982. 1181.07 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  983. 1181.07 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  984. 1181.07 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  985. 1181.07 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  986. 1181.07 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  987. 1181.07 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  988. 1181.07 s [algebraic-graphs]
  989. 1181.07 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  990. 1181.07 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  991. 1181.07 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  992. 1181.07 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  993. 1181.07 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  994. 1181.07 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  995. 1181.07 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  996. 1181.07 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  997. 1181.07 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  998. 1181.07 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  999. 1181.07 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  1000. 1181.07 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  1001. 1181.07 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  1002. 1181.07 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  1003. 1181.07 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  1004. 1181.07 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  1005. 1181.07 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  1006. 1181.07 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  1007. 1185.07 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  1008. 1185.08 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  1009. 1185.08 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  1010. 1185.08 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  1011. 1185.08 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  1012. 1185.08 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  1013. 1185.08 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  1014. 1185.08 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  1015. 1185.08 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  1016. 1185.08 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  1017. 1185.08 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  1018. 1185.08 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1019. 1185.08 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  1020. 1185.08 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  1021. 1185.08 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  1022. 1185.08 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  1023. 1185.08 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  1024. 1185.08 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1025. 1185.08 s [algebraic-graphs]
  1026. 1185.08 s [algebraic-graphs] ============ Relation.foldg ============
  1027. 1185.08 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  1028. 1185.08 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  1029. 1185.08 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  1030. 1185.08 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  1031. 1185.08 s [algebraic-graphs]
  1032. 1185.08 s [algebraic-graphs] ============ Relation.isEmpty ============
  1033. 1185.08 s [algebraic-graphs] OK: isEmpty empty == True
  1034. 1185.08 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1035. 1185.08 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1036. 1185.08 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1037. 1185.08 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1038. 1185.08 s [algebraic-graphs]
  1039. 1185.08 s [algebraic-graphs] ============ Relation.hasVertex ============
  1040. 1185.08 s [algebraic-graphs] OK: hasVertex x empty == False
  1041. 1185.08 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1042. 1185.08 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1043. 1185.08 s [algebraic-graphs]
  1044. 1185.08 s [algebraic-graphs] ============ Relation.hasEdge ============
  1045. 1185.08 s [algebraic-graphs] OK: hasEdge x y empty == False
  1046. 1185.08 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1047. 1185.08 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1048. 1185.08 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1049. 1185.08 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  1050. 1185.08 s [algebraic-graphs]
  1051. 1185.08 s [algebraic-graphs] ============ Relation.vertexCount ============
  1052. 1185.08 s [algebraic-graphs] OK: vertexCount empty == 0
  1053. 1185.08 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1054. 1185.08 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1055. 1185.08 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1056. 1185.08 s [algebraic-graphs]
  1057. 1185.08 s [algebraic-graphs] ============ Relation.edgeCount ============
  1058. 1185.08 s [algebraic-graphs] OK: edgeCount empty == 0
  1059. 1185.08 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1060. 1185.08 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1061. 1185.08 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1062. 1185.08 s [algebraic-graphs]
  1063. 1185.08 s [algebraic-graphs] ============ Relation.vertexList ============
  1064. 1185.08 s [algebraic-graphs] OK: vertexList empty == []
  1065. 1185.08 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1066. 1185.08 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1067. 1185.08 s [algebraic-graphs]
  1068. 1185.08 s [algebraic-graphs] ============ Relation.vertexSet ============
  1069. 1185.08 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1070. 1185.08 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1071. 1185.08 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1072. 1185.08 s [algebraic-graphs]
  1073. 1185.08 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  1074. 1185.08 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1075. 1185.08 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1076. 1185.08 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1077. 1185.08 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1078. 1185.08 s [algebraic-graphs]
  1079. 1185.08 s [algebraic-graphs] ============ Relation.edgeList ============
  1080. 1185.08 s [algebraic-graphs] OK: edgeList empty == []
  1081. 1185.08 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1082. 1185.08 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  1083. 1185.08 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  1084. 1185.08 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  1085. 1185.08 s [algebraic-graphs]
  1086. 1185.08 s [algebraic-graphs] ============ Relation.edgeSet ============
  1087. 1185.08 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1088. 1185.08 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1089. 1185.08 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  1090. 1185.08 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  1091. 1185.08 s [algebraic-graphs]
  1092. 1185.08 s [algebraic-graphs] ============ Relation.adjacencyList ============
  1093. 1185.08 s [algebraic-graphs] OK: adjacencyList empty == []
  1094. 1185.08 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1095. 1185.08 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  1096. 1185.08 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  1097. 1185.08 s [algebraic-graphs]
  1098. 1185.08 s [algebraic-graphs] ============ Relation.preSet ============
  1099. 1185.08 s [algebraic-graphs] OK: preSet x empty == Set.empty
  1100. 1185.08 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  1101. 1185.08 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  1102. 1185.08 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  1103. 1185.08 s [algebraic-graphs]
  1104. 1185.08 s [algebraic-graphs] ============ Relation.preIntSet ============
  1105. 1185.08 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  1106. 1185.08 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  1107. 1185.08 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  1108. 1185.08 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  1109. 1185.08 s [algebraic-graphs]
  1110. 1185.08 s [algebraic-graphs] ============ Relation.postSet ============
  1111. 1185.08 s [algebraic-graphs] OK: postSet x empty == Set.empty
  1112. 1185.08 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  1113. 1185.08 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  1114. 1185.08 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  1115. 1185.08 s [algebraic-graphs]
  1116. 1185.08 s [algebraic-graphs] ============ Relation.postIntSet ============
  1117. 1185.08 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  1118. 1185.08 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  1119. 1185.08 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  1120. 1185.08 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  1121. 1185.08 s [algebraic-graphs]
  1122. 1185.08 s [algebraic-graphs] ============ Relation.path ============
  1123. 1185.08 s [algebraic-graphs] OK: path [] == empty
  1124. 1185.08 s [algebraic-graphs] OK: path [x] == vertex x
  1125. 1185.08 s [algebraic-graphs] OK: path [x,y] == edge x y
  1126. 1185.08 s [algebraic-graphs]
  1127. 1185.08 s [algebraic-graphs] ============ Relation.circuit ============
  1128. 1185.08 s [algebraic-graphs] OK: circuit [] == empty
  1129. 1185.08 s [algebraic-graphs] OK: circuit [x] == edge x x
  1130. 1185.08 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1131. 1185.08 s [algebraic-graphs]
  1132. 1185.08 s [algebraic-graphs] ============ Relation.clique ============
  1133. 1185.08 s [algebraic-graphs] OK: clique [] == empty
  1134. 1185.08 s [algebraic-graphs] OK: clique [x] == vertex x
  1135. 1185.08 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1136. 1185.08 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1137. 1185.08 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1138. 1185.08 s [algebraic-graphs]
  1139. 1185.08 s [algebraic-graphs] ============ Relation.biclique ============
  1140. 1185.08 s [algebraic-graphs] OK: biclique [] [] == empty
  1141. 1185.08 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1142. 1185.08 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1143. 1185.08 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1144. 1185.08 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1145. 1185.08 s [algebraic-graphs]
  1146. 1185.08 s [algebraic-graphs] ============ Relation.star ============
  1147. 1185.08 s [algebraic-graphs] OK: star x [] == vertex x
  1148. 1185.08 s [algebraic-graphs] OK: star x [y] == edge x y
  1149. 1185.08 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1150. 1185.08 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1151. 1185.08 s [algebraic-graphs]
  1152. 1185.08 s [algebraic-graphs] ============ Relation.stars ============
  1153. 1185.08 s [algebraic-graphs] OK: stars [] == empty
  1154. 1185.08 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1155. 1185.08 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1156. 1185.08 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1157. 1185.08 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1158. 1185.08 s [algebraic-graphs] OK: stars . adjacencyList == id
  1159. 1185.08 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1160. 1185.08 s [algebraic-graphs]
  1161. 1185.08 s [algebraic-graphs] ============ Relation.tree ============
  1162. 1185.08 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1163. 1185.08 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1164. 1185.08 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1165. 1185.08 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1166. 1185.08 s [algebraic-graphs]
  1167. 1185.08 s [algebraic-graphs] ============ Relation.forest ============
  1168. 1185.08 s [algebraic-graphs] OK: forest [] == empty
  1169. 1185.08 s [algebraic-graphs] OK: forest [x] == tree x
  1170. 1185.08 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1171. 1185.08 s [algebraic-graphs] OK: forest == overlays . map tree
  1172. 1185.08 s [algebraic-graphs]
  1173. 1185.08 s [algebraic-graphs] ============ Relation.removeVertex ============
  1174. 1185.08 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1175. 1185.08 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1176. 1185.08 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1177. 1185.08 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1178. 1185.08 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1179. 1185.08 s [algebraic-graphs]
  1180. 1185.08 s [algebraic-graphs] ============ Relation.removeEdge ============
  1181. 1185.08 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1182. 1185.08 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1183. 1185.08 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1184. 1185.08 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1185. 1185.08 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1186. 1185.08 s [algebraic-graphs]
  1187. 1185.08 s [algebraic-graphs] ============ Relation.replaceVertex ============
  1188. 1185.08 s [algebraic-graphs] OK: replaceVertex x x == id
  1189. 1185.08 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1190. 1185.08 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1191. 1185.08 s [algebraic-graphs]
  1192. 1185.08 s [algebraic-graphs] ============ Relation.mergeVertices ============
  1193. 1185.08 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1194. 1220.75 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1195. 1220.75 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1196. 1220.80 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1197. 1220.80 s [algebraic-graphs]
  1198. 1220.80 s [algebraic-graphs] ============ Relation.transpose ============
  1199. 1220.80 s [algebraic-graphs] OK: transpose empty == empty
  1200. 1220.80 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  1201. 1220.80 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  1202. 1220.80 s [algebraic-graphs] OK: transpose . transpose == id
  1203. 1220.80 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  1204. 1220.80 s [algebraic-graphs]
  1205. 1220.80 s [algebraic-graphs] ============ Relation.gmap ============
  1206. 1220.80 s [algebraic-graphs] OK: gmap f empty == empty
  1207. 1220.80 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1208. 1220.80 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1209. 1220.80 s [algebraic-graphs] OK: gmap id == id
  1210. 1220.80 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1211. 1220.80 s [algebraic-graphs]
  1212. 1220.80 s [algebraic-graphs] ============ Relation.induce ============
  1213. 1220.80 s [algebraic-graphs] OK: induce (const True ) x == x
  1214. 1220.80 s [algebraic-graphs] OK: induce (const False) x == empty
  1215. 1220.80 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1216. 1220.80 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1217. 1220.80 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1218. 1220.80 s [algebraic-graphs]
  1219. 1220.80 s [algebraic-graphs] ============ Relation.compose ============
  1220. 1220.80 s [algebraic-graphs] OK: compose empty x == empty
  1221. 1220.80 s [algebraic-graphs] OK: compose x empty == empty
  1222. 1220.80 s [algebraic-graphs] OK: compose (vertex x) y == empty
  1223. 1220.80 s [algebraic-graphs] OK: compose x (vertex y) == empty
  1224. 1220.80 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  1225. 1220.80 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  1226. 1220.80 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  1227. 1220.80 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  1228. 1220.80 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  1229. 1220.80 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  1230. 1220.80 s [algebraic-graphs]
  1231. 1220.80 s [algebraic-graphs] ============ Relation.closure ============
  1232. 1220.80 s [algebraic-graphs] OK: closure empty == empty
  1233. 1220.80 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  1234. 1220.80 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  1235. 1220.80 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  1236. 1220.80 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  1237. 1220.80 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  1238. 1220.80 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  1239. 1220.80 s [algebraic-graphs] OK: closure . closure == closure
  1240. 1220.80 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  1241. 1220.80 s [algebraic-graphs]
  1242. 1220.80 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  1243. 1220.80 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  1244. 1220.80 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  1245. 1220.80 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  1246. 1220.80 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  1247. 1220.80 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  1248. 1220.80 s [algebraic-graphs]
  1249. 1220.80 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  1250. 1220.80 s [algebraic-graphs] OK: symmetricClosure empty == empty
  1251. 1220.80 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  1252. 1220.80 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  1253. 1220.80 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  1254. 1220.80 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  1255. 1220.80 s [algebraic-graphs]
  1256. 1220.80 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  1257. 1220.80 s [algebraic-graphs] OK: transitiveClosure empty == empty
  1258. 1220.80 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  1259. 1220.80 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  1260. 1220.80 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  1261. 1220.80 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  1262. 1220.80 s [algebraic-graphs]
  1263. 1220.80 s [algebraic-graphs] ============ Relation.induceJust ============
  1264. 1220.80 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1265. 1220.80 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1266. 1220.80 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1267. 1220.80 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1268. 1220.80 s [algebraic-graphs]
  1269. 1220.80 s [algebraic-graphs] ============ ReflexiveRelation ============
  1270. 1220.80 s [algebraic-graphs] OK: Axioms of reflexive graphs
  1271. 1220.80 s [algebraic-graphs]
  1272. 1220.80 s [algebraic-graphs] ============ TransitiveRelation ============
  1273. 1220.80 s [algebraic-graphs] OK: Axioms of transitive graphs
  1274. 1220.80 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  1275. 1220.80 s [algebraic-graphs]
  1276. 1220.80 s [algebraic-graphs] ============ PreorderRelation ============
  1277. 1220.80 s [algebraic-graphs] OK: Axioms of preorder graphs
  1278. 1220.80 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  1279. 1220.80 s [algebraic-graphs]
  1280. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation ============
  1281. 1220.80 s [algebraic-graphs] OK: Axioms of undirected graphs
  1282. 1220.80 s [algebraic-graphs]
  1283. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  1284. 1220.80 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  1285. 1220.80 s [algebraic-graphs]
  1286. 1220.80 s [algebraic-graphs] OK: consistent empty == True
  1287. 1220.80 s [algebraic-graphs] OK: consistent (vertex x) == True
  1288. 1220.80 s [algebraic-graphs] OK: consistent (overlay x y) == True
  1289. 1220.80 s [algebraic-graphs] OK: consistent (connect x y) == True
  1290. 1220.80 s [algebraic-graphs] OK: consistent (edge x y) == True
  1291. 1220.80 s [algebraic-graphs] OK: consistent (edges xs) == True
  1292. 1220.80 s [algebraic-graphs] OK: consistent (stars xs) == True
  1293. 1220.80 s [algebraic-graphs]
  1294. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  1295. 1220.80 s [algebraic-graphs] OK: show (empty ) == "empty"
  1296. 1220.80 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1297. 1220.80 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1298. 1220.80 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1299. 1220.80 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1300. 1220.80 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1301. 1220.80 s [algebraic-graphs]
  1302. 1220.80 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1303. 1220.80 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1304. 1220.80 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1305. 1220.80 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1306. 1220.80 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1307. 1220.80 s [algebraic-graphs]
  1308. 1220.80 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1309. 1220.80 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1310. 1220.80 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1311. 1220.80 s [algebraic-graphs]
  1312. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  1313. 1220.80 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  1314. 1220.80 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  1315. 1220.80 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  1316. 1220.80 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  1317. 1220.80 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  1318. 1220.80 s [algebraic-graphs]
  1319. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  1320. 1220.80 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  1321. 1220.80 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  1322. 1220.80 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  1323. 1220.80 s [algebraic-graphs]
  1324. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  1325. 1220.80 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1326. 1220.80 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1327. 1220.80 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1328. 1220.80 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1329. 1220.80 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1330. 1220.80 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1331. 1220.80 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1332. 1220.80 s [algebraic-graphs] OK: x <= x + y
  1333. 1220.80 s [algebraic-graphs] OK: x + y <= x * y
  1334. 1220.80 s [algebraic-graphs]
  1335. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  1336. 1220.80 s [algebraic-graphs] OK: isEmpty empty == True
  1337. 1220.80 s [algebraic-graphs] OK: hasVertex x empty == False
  1338. 1220.80 s [algebraic-graphs] OK: vertexCount empty == 0
  1339. 1220.80 s [algebraic-graphs] OK: edgeCount empty == 0
  1340. 1220.80 s [algebraic-graphs]
  1341. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  1342. 1220.80 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1343. 1220.80 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1344. 1220.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1345. 1220.80 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1346. 1220.80 s [algebraic-graphs]
  1347. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  1348. 1220.80 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1349. 1220.80 s [algebraic-graphs] OK: edge x y == edge y x
  1350. 1220.80 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1351. 1220.80 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1352. 1220.80 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1353. 1220.80 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1354. 1220.80 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1355. 1220.80 s [algebraic-graphs]
  1356. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  1357. 1220.80 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1358. 1220.80 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1359. 1220.80 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1360. 1220.80 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1361. 1220.80 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1362. 1220.80 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1363. 1220.80 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1364. 1220.80 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1365. 1220.80 s [algebraic-graphs]
  1366. 1220.80 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  1367. 1220.80 s [algebraic-graphs] OK: connect x y == connect y x
  1368. 1220.80 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1369. 1220.80 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1370. 1220.80 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1371. 1220.80 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1372. 1220.80 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1373. 1220.80 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1374. 1220.80 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1375. 1220.81 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1376. 1220.81 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1377. 1220.81 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1378. 1220.81 s [algebraic-graphs]
  1379. 1220.81 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  1380. 1220.81 s [algebraic-graphs] OK: vertices [] == empty
  1381. 1220.81 s [algebraic-graphs] OK: vertices [x] == vertex x
  1382. 1220.81 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1383. 1220.81 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1384. 1220.81 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1385. 1220.81 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1386. 1220.81 s [algebraic-graphs]
  1387. 1220.81 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  1388. 1220.81 s [algebraic-graphs] OK: edges [] == empty
  1389. 1220.81 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1390. 1220.81 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1391. 1220.81 s [algebraic-graphs]
  1392. 1220.81 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  1393. 1220.81 s [algebraic-graphs] OK: overlays [] == empty
  1394. 1239.01 s [algebraic-graphs] OK: overlays [x] == x
  1395. 1239.09 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1396. 1239.09 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1397. 1239.09 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1398. 1239.09 s [algebraic-graphs]
  1399. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  1400. 1239.09 s [algebraic-graphs] OK: connects [] == empty
  1401. 1239.09 s [algebraic-graphs] OK: connects [x] == x
  1402. 1239.09 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1403. 1239.09 s [algebraic-graphs] OK: connects == foldr connect empty
  1404. 1239.09 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1405. 1239.09 s [algebraic-graphs] OK: connects == connects . reverse
  1406. 1239.09 s [algebraic-graphs]
  1407. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  1408. 1239.09 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1409. 1239.09 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1410. 1239.09 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1411. 1239.09 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1412. 1239.09 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1413. 1239.09 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1414. 1239.09 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1415. 1239.09 s [algebraic-graphs]
  1416. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  1417. 1239.09 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  1418. 1239.09 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  1419. 1239.09 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  1420. 1239.09 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  1421. 1239.09 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  1422. 1239.09 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  1423. 1239.09 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  1424. 1239.09 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  1425. 1239.09 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  1426. 1239.09 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  1427. 1239.09 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  1428. 1239.09 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  1429. 1239.09 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  1430. 1239.09 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  1431. 1239.09 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  1432. 1239.09 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  1433. 1239.09 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  1434. 1239.09 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  1435. 1239.09 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  1436. 1239.09 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  1437. 1239.09 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  1438. 1239.09 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  1439. 1239.09 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  1440. 1239.09 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1441. 1239.09 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  1442. 1239.09 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  1443. 1239.09 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  1444. 1239.09 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  1445. 1239.09 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  1446. 1239.09 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  1447. 1239.09 s [algebraic-graphs]
  1448. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  1449. 1239.09 s [algebraic-graphs] OK: isEmpty empty == True
  1450. 1239.09 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  1451. 1239.09 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1452. 1239.09 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  1453. 1239.09 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  1454. 1239.09 s [algebraic-graphs]
  1455. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  1456. 1239.09 s [algebraic-graphs] OK: hasVertex x empty == False
  1457. 1239.09 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1458. 1239.09 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  1459. 1239.09 s [algebraic-graphs]
  1460. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  1461. 1239.09 s [algebraic-graphs] OK: hasEdge x y empty == False
  1462. 1239.09 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  1463. 1239.09 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1464. 1239.09 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  1465. 1239.09 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  1466. 1239.09 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  1467. 1239.09 s [algebraic-graphs]
  1468. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  1469. 1239.09 s [algebraic-graphs] OK: vertexCount empty == 0
  1470. 1239.09 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1471. 1239.09 s [algebraic-graphs] OK: vertexCount == length . vertexList
  1472. 1239.09 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  1473. 1239.09 s [algebraic-graphs]
  1474. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  1475. 1239.09 s [algebraic-graphs] OK: edgeCount empty == 0
  1476. 1239.09 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1477. 1239.09 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1478. 1239.09 s [algebraic-graphs] OK: edgeCount == length . edgeList
  1479. 1239.09 s [algebraic-graphs]
  1480. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  1481. 1239.09 s [algebraic-graphs] OK: vertexList empty == []
  1482. 1239.09 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  1483. 1239.09 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  1484. 1239.09 s [algebraic-graphs]
  1485. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  1486. 1239.09 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  1487. 1239.09 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  1488. 1239.09 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1489. 1239.09 s [algebraic-graphs]
  1490. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  1491. 1239.09 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  1492. 1239.09 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  1493. 1239.09 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  1494. 1239.09 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  1495. 1239.09 s [algebraic-graphs]
  1496. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  1497. 1239.09 s [algebraic-graphs] OK: edgeList empty == []
  1498. 1239.09 s [algebraic-graphs] OK: edgeList (vertex x) == []
  1499. 1239.09 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  1500. 1239.09 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  1501. 1239.09 s [algebraic-graphs]
  1502. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  1503. 1239.09 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  1504. 1239.09 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  1505. 1239.09 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  1506. 1239.09 s [algebraic-graphs]
  1507. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  1508. 1239.09 s [algebraic-graphs] OK: adjacencyList empty == []
  1509. 1239.09 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  1510. 1239.09 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  1511. 1239.09 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  1512. 1239.09 s [algebraic-graphs]
  1513. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  1514. 1239.09 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  1515. 1239.09 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  1516. 1239.09 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  1517. 1239.09 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  1518. 1239.09 s [algebraic-graphs]
  1519. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  1520. 1239.09 s [algebraic-graphs] OK: path [] == empty
  1521. 1239.09 s [algebraic-graphs] OK: path [x] == vertex x
  1522. 1239.09 s [algebraic-graphs] OK: path [x,y] == edge x y
  1523. 1239.09 s [algebraic-graphs] OK: path == path . reverse
  1524. 1239.09 s [algebraic-graphs]
  1525. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  1526. 1239.09 s [algebraic-graphs] OK: circuit [] == empty
  1527. 1239.09 s [algebraic-graphs] OK: circuit [x] == edge x x
  1528. 1239.09 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1529. 1239.09 s [algebraic-graphs] OK: circuit == circuit . reverse
  1530. 1239.09 s [algebraic-graphs]
  1531. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  1532. 1239.09 s [algebraic-graphs] OK: clique [] == empty
  1533. 1239.09 s [algebraic-graphs] OK: clique [x] == vertex x
  1534. 1239.09 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1535. 1239.09 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1536. 1239.09 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1537. 1239.09 s [algebraic-graphs] OK: clique == clique . reverse
  1538. 1239.09 s [algebraic-graphs]
  1539. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  1540. 1239.09 s [algebraic-graphs] OK: biclique [] [] == empty
  1541. 1239.09 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1542. 1239.09 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1543. 1239.09 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1544. 1239.09 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1545. 1239.09 s [algebraic-graphs]
  1546. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  1547. 1239.09 s [algebraic-graphs] OK: star x [] == vertex x
  1548. 1239.09 s [algebraic-graphs] OK: star x [y] == edge x y
  1549. 1239.09 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1550. 1239.09 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1551. 1239.09 s [algebraic-graphs]
  1552. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  1553. 1239.09 s [algebraic-graphs] OK: stars [] == empty
  1554. 1239.09 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1555. 1239.09 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1556. 1239.09 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1557. 1239.09 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1558. 1239.09 s [algebraic-graphs] OK: stars . adjacencyList == id
  1559. 1239.09 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1560. 1239.09 s [algebraic-graphs]
  1561. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  1562. 1239.09 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1563. 1239.09 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1564. 1239.09 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1565. 1239.09 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1566. 1239.09 s [algebraic-graphs]
  1567. 1239.09 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  1568. 1239.09 s [algebraic-graphs] OK: forest [] == empty
  1569. 1246.69 s [algebraic-graphs] OK: forest [x] == tree x
  1570. 1246.69 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1571. 1246.73 s [algebraic-graphs] OK: forest == overlays . map tree
  1572. 1246.73 s [algebraic-graphs]
  1573. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  1574. 1246.73 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1575. 1246.73 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1576. 1246.73 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1577. 1246.73 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1578. 1246.73 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1579. 1246.73 s [algebraic-graphs]
  1580. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  1581. 1246.73 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1582. 1246.73 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1583. 1246.73 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1584. 1246.73 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1585. 1246.73 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1586. 1246.73 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1587. 1246.73 s [algebraic-graphs]
  1588. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  1589. 1246.73 s [algebraic-graphs] OK: replaceVertex x x == id
  1590. 1246.73 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1591. 1246.73 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1592. 1246.73 s [algebraic-graphs]
  1593. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  1594. 1246.73 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1595. 1246.73 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1596. 1246.73 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1597. 1246.73 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1598. 1246.73 s [algebraic-graphs]
  1599. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  1600. 1246.73 s [algebraic-graphs] OK: gmap f empty == empty
  1601. 1246.73 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1602. 1246.73 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1603. 1246.73 s [algebraic-graphs] OK: gmap id == id
  1604. 1246.73 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1605. 1246.73 s [algebraic-graphs]
  1606. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  1607. 1246.73 s [algebraic-graphs] OK: induce (const True ) x == x
  1608. 1246.73 s [algebraic-graphs] OK: induce (const False) x == empty
  1609. 1246.73 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1610. 1246.73 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1611. 1246.73 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1612. 1246.73 s [algebraic-graphs]
  1613. 1246.73 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  1614. 1246.73 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1615. 1246.73 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1616. 1246.73 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1617. 1246.73 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1618. 1246.73 s [algebraic-graphs]
  1619. 1246.73 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  1620. 1246.73 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  1621. 1246.73 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  1622. 1246.73 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  1623. 1246.73 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  1624. 1246.73 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  1625. 1246.73 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  1626. 1246.73 s [algebraic-graphs]
  1627. 1246.73 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  1628. 1246.73 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  1629. 1246.73 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  1630. 1246.73 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  1631. 1246.73 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  1632. 1246.73 s [algebraic-graphs]
  1633. 1246.74 s [algebraic-graphs] ============ Typed ============
  1634. 1246.74 s [algebraic-graphs]
  1635. 1246.74 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  1636. 1246.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1637. 1246.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1638. 1246.74 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  1639. 1246.74 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1640. 1246.74 s [algebraic-graphs]
  1641. 1246.74 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  1642. 1246.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  1643. 1246.74 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  1644. 1246.74 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  1645. 1246.74 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  1646. 1246.74 s [algebraic-graphs]
  1647. 1246.74 s [algebraic-graphs] ============ Typed.dfsForest ============
  1648. 1246.74 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  1649. 1246.74 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  1650. 1246.74 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  1651. 1246.74 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  1652. 1246.74 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  1653. 1246.74 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  1654. 1246.74 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  1655. 1246.74 s [algebraic-graphs]
  1656. 1246.74 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  1657. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  1658. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  1659. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  1660. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  1661. 1246.74 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  1662. 1246.74 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  1663. 1246.74 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  1664. 1246.74 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  1665. 1246.74 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  1666. 1246.74 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  1667. 1246.74 s [algebraic-graphs]
  1668. 1246.74 s [algebraic-graphs] ============ Typed.dfs ============
  1669. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  1670. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  1671. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  1672. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  1673. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  1674. 1246.74 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  1675. 1246.74 s [algebraic-graphs] OK: dfs % x $ [] == []
  1676. 1246.74 s [algebraic-graphs]
  1677. 1246.74 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  1678. 1246.74 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  1679. 1246.74 s [algebraic-graphs]
  1680. 1246.74 s [algebraic-graphs] ============ Typed.topSort ============
  1681. 1246.74 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  1682. 1246.74 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  1683. 1246.74 s [algebraic-graphs]
  1684. 1246.74 s [algebraic-graphs] ============ Graph.Undirected ============
  1685. 1246.74 s [algebraic-graphs] OK: Axioms of undirected graphs
  1686. 1246.74 s [algebraic-graphs]
  1687. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  1688. 1246.74 s [algebraic-graphs] OK: show (empty ) == "empty"
  1689. 1246.74 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  1690. 1246.74 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  1691. 1246.74 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  1692. 1246.74 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  1693. 1246.74 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  1694. 1246.74 s [algebraic-graphs]
  1695. 1246.74 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  1696. 1246.74 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  1697. 1246.74 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  1698. 1246.74 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  1699. 1246.74 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  1700. 1246.74 s [algebraic-graphs]
  1701. 1246.74 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  1702. 1246.74 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  1703. 1246.74 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  1704. 1246.74 s [algebraic-graphs]
  1705. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  1706. 1246.74 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  1707. 1246.74 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1708. 1246.74 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  1709. 1246.74 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  1710. 1246.74 s [algebraic-graphs]
  1711. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  1712. 1246.74 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  1713. 1246.74 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  1714. 1246.74 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  1715. 1246.74 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  1716. 1246.74 s [algebraic-graphs]
  1717. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  1718. 1246.74 s [algebraic-graphs] OK: complement empty == empty
  1719. 1246.74 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  1720. 1246.74 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  1721. 1246.74 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  1722. 1246.74 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  1723. 1246.74 s [algebraic-graphs] OK: complement . complement == id
  1724. 1246.74 s [algebraic-graphs]
  1725. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  1726. 1246.74 s [algebraic-graphs] OK: vertex 1 < vertex 2
  1727. 1246.74 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  1728. 1246.74 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  1729. 1246.74 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  1730. 1246.74 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  1731. 1246.74 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  1732. 1246.74 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  1733. 1246.74 s [algebraic-graphs] OK: x <= x + y
  1734. 1246.74 s [algebraic-graphs] OK: x + y <= x * y
  1735. 1246.74 s [algebraic-graphs]
  1736. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  1737. 1246.74 s [algebraic-graphs] OK: isEmpty empty == True
  1738. 1246.74 s [algebraic-graphs] OK: hasVertex x empty == False
  1739. 1246.74 s [algebraic-graphs] OK: vertexCount empty == 0
  1740. 1246.74 s [algebraic-graphs] OK: edgeCount empty == 0
  1741. 1246.74 s [algebraic-graphs]
  1742. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  1743. 1246.74 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  1744. 1246.74 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  1745. 1246.74 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  1746. 1246.74 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  1747. 1246.74 s [algebraic-graphs]
  1748. 1246.74 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  1749. 1246.74 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  1750. 1246.74 s [algebraic-graphs] OK: edge x y == edge y x
  1751. 1256.33 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  1752. 1256.33 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  1753. 1256.33 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  1754. 1256.37 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  1755. 1256.37 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  1756. 1256.37 s [algebraic-graphs]
  1757. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  1758. 1256.37 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  1759. 1256.37 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  1760. 1256.37 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  1761. 1256.37 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  1762. 1256.37 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  1763. 1256.37 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  1764. 1256.37 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  1765. 1256.37 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  1766. 1256.37 s [algebraic-graphs]
  1767. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  1768. 1256.37 s [algebraic-graphs] OK: connect x y == connect y x
  1769. 1256.37 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  1770. 1256.37 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  1771. 1256.37 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  1772. 1256.37 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  1773. 1256.37 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  1774. 1256.37 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  1775. 1256.37 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  1776. 1256.37 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  1777. 1256.37 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  1778. 1256.37 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  1779. 1256.37 s [algebraic-graphs]
  1780. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  1781. 1256.37 s [algebraic-graphs] OK: vertices [] == empty
  1782. 1256.37 s [algebraic-graphs] OK: vertices [x] == vertex x
  1783. 1256.37 s [algebraic-graphs] OK: vertices == overlays . map vertex
  1784. 1256.37 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  1785. 1256.37 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  1786. 1256.37 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  1787. 1256.37 s [algebraic-graphs]
  1788. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  1789. 1256.37 s [algebraic-graphs] OK: edges [] == empty
  1790. 1256.37 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  1791. 1256.37 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  1792. 1256.37 s [algebraic-graphs]
  1793. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  1794. 1256.37 s [algebraic-graphs] OK: overlays [] == empty
  1795. 1256.37 s [algebraic-graphs] OK: overlays [x] == x
  1796. 1256.37 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  1797. 1256.37 s [algebraic-graphs] OK: overlays == foldr overlay empty
  1798. 1256.37 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  1799. 1256.37 s [algebraic-graphs]
  1800. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  1801. 1256.37 s [algebraic-graphs] OK: connects [] == empty
  1802. 1256.37 s [algebraic-graphs] OK: connects [x] == x
  1803. 1256.37 s [algebraic-graphs] OK: connects [x,y] == connect x y
  1804. 1256.37 s [algebraic-graphs] OK: connects == foldr connect empty
  1805. 1256.37 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  1806. 1256.37 s [algebraic-graphs] OK: connects == connects . reverse
  1807. 1256.37 s [algebraic-graphs]
  1808. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  1809. 1256.37 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  1810. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  1811. 1256.37 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  1812. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  1813. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  1814. 1256.37 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  1815. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  1816. 1256.37 s [algebraic-graphs]
  1817. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.path ============
  1818. 1256.37 s [algebraic-graphs] OK: path [] == empty
  1819. 1256.37 s [algebraic-graphs] OK: path [x] == vertex x
  1820. 1256.37 s [algebraic-graphs] OK: path [x,y] == edge x y
  1821. 1256.37 s [algebraic-graphs] OK: path == path . reverse
  1822. 1256.37 s [algebraic-graphs]
  1823. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  1824. 1256.37 s [algebraic-graphs] OK: circuit [] == empty
  1825. 1256.37 s [algebraic-graphs] OK: circuit [x] == edge x x
  1826. 1256.37 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  1827. 1256.37 s [algebraic-graphs] OK: circuit == circuit . reverse
  1828. 1256.37 s [algebraic-graphs]
  1829. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  1830. 1256.37 s [algebraic-graphs] OK: clique [] == empty
  1831. 1256.37 s [algebraic-graphs] OK: clique [x] == vertex x
  1832. 1256.37 s [algebraic-graphs] OK: clique [x,y] == edge x y
  1833. 1256.37 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  1834. 1256.37 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  1835. 1256.37 s [algebraic-graphs] OK: clique == clique . reverse
  1836. 1256.37 s [algebraic-graphs]
  1837. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  1838. 1256.37 s [algebraic-graphs] OK: biclique [] [] == empty
  1839. 1256.37 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  1840. 1256.37 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  1841. 1256.37 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  1842. 1256.37 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  1843. 1256.37 s [algebraic-graphs]
  1844. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.star ============
  1845. 1256.37 s [algebraic-graphs] OK: star x [] == vertex x
  1846. 1256.37 s [algebraic-graphs] OK: star x [y] == edge x y
  1847. 1256.37 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  1848. 1256.37 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  1849. 1256.37 s [algebraic-graphs]
  1850. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  1851. 1256.37 s [algebraic-graphs] OK: stars [] == empty
  1852. 1256.37 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  1853. 1256.37 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  1854. 1256.37 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  1855. 1256.37 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  1856. 1256.37 s [algebraic-graphs] OK: stars . adjacencyList == id
  1857. 1256.37 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  1858. 1256.37 s [algebraic-graphs]
  1859. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  1860. 1256.37 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  1861. 1256.37 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  1862. 1256.37 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  1863. 1256.37 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  1864. 1256.37 s [algebraic-graphs]
  1865. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  1866. 1256.37 s [algebraic-graphs] OK: forest [] == empty
  1867. 1256.37 s [algebraic-graphs] OK: forest [x] == tree x
  1868. 1256.37 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  1869. 1256.37 s [algebraic-graphs] OK: forest == overlays . map tree
  1870. 1256.37 s [algebraic-graphs]
  1871. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  1872. 1256.37 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  1873. 1256.37 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  1874. 1256.37 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  1875. 1256.37 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  1876. 1256.37 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  1877. 1256.37 s [algebraic-graphs]
  1878. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  1879. 1256.37 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  1880. 1256.37 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  1881. 1256.37 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  1882. 1256.37 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  1883. 1256.37 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  1884. 1256.37 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  1885. 1256.37 s [algebraic-graphs]
  1886. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  1887. 1256.37 s [algebraic-graphs] OK: replaceVertex x x == id
  1888. 1256.37 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  1889. 1256.37 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  1890. 1256.37 s [algebraic-graphs]
  1891. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  1892. 1256.37 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  1893. 1256.37 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  1894. 1256.37 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  1895. 1256.37 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  1896. 1256.37 s [algebraic-graphs]
  1897. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  1898. 1256.37 s [algebraic-graphs] OK: gmap f empty == empty
  1899. 1256.37 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  1900. 1256.37 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  1901. 1256.37 s [algebraic-graphs] OK: gmap id == id
  1902. 1256.37 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  1903. 1256.37 s [algebraic-graphs]
  1904. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  1905. 1256.37 s [algebraic-graphs] OK: induce (const True ) x == x
  1906. 1256.37 s [algebraic-graphs] OK: induce (const False) x == empty
  1907. 1256.37 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  1908. 1256.37 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  1909. 1256.37 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  1910. 1256.37 s [algebraic-graphs]
  1911. 1256.37 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  1912. 1256.37 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  1913. 1256.37 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  1914. 1256.37 s [algebraic-graphs] OK: induceJust . gmap Just == id
  1915. 1256.37 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  1916. 1256.37 s [algebraic-graphs] Test suite main: PASS
  1917. 1256.37 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  1918. 1256.37 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  1919. 1256.37 s [algebraic-graphs] checkPhase completed in 3 minutes 1 seconds
  1920. 1256.37 s [algebraic-graphs] Phase: haddockPhase
  1921. 1256.50 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  1922. 1256.51 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  1923. 1256.56 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  1924. 1256.96 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  1925. 1257.08 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  1926. 1257.27 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1927. 1257.27 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1928. 1257.27 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1929. 1257.27 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1930. 1257.27 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  1931. 1257.27 s [algebraic-graphs] Missing documentation for:
  1932. 1257.27 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  1933. 1257.32 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  1934. 1257.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1935. 1257.32 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  1936. 1257.42 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  1937. 1257.58 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  1938. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1939. 1257.58 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  1940. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1941. 1257.58 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  1942. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1943. 1257.58 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  1944. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1945. 1257.58 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1946. 1257.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1947. 1257.59 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  1948. 1257.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1949. 1257.59 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1950. 1257.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1951. 1257.59 s [algebraic-graphs] Warning: 'box' is out of scope.
  1952. 1257.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1953. 1257.59 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  1954. 1257.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1955. 1257.59 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  1956. 1257.68 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1957. 1257.68 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1958. 1257.70 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  1959. 1257.81 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  1960. 1257.81 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1961. 1257.81 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  1962. 1258.09 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  1963. 1258.24 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  1964. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1965. 1258.24 s [algebraic-graphs] Warning: 'empty' is out of scope.
  1966. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1967. 1258.24 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  1968. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1969. 1258.24 s [algebraic-graphs] Warning: 'edges' is out of scope.
  1970. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1971. 1258.24 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  1972. 1258.24 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1973. 1258.25 s [algebraic-graphs] Warning: 'stars' is out of scope.
  1974. 1258.25 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1975. 1258.25 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  1976. 1258.37 s [algebraic-graphs] Warning: 'nub' is out of scope.
  1977. 1258.37 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1978. 1258.37 s [algebraic-graphs] Warning: 'sort' is out of scope.
  1979. 1258.37 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  1980. 1258.38 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  1981. 1258.38 s [algebraic-graphs] Missing documentation for:
  1982. 1258.38 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  1983. 1258.62 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  1984. 1258.68 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  1985. 1258.75 s [algebraic-graphs]
  1986. 1258.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1987. 1258.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1988. 1258.76 s [algebraic-graphs] will become an error in a future GHC release.
  1989. 1258.76 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1990. 1258.76 s [algebraic-graphs] |
  1991. 1258.76 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  1992. 1258.76 s [algebraic-graphs] | ^
  1993. 1258.76 s [algebraic-graphs]
  1994. 1258.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  1995. 1258.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  1996. 1258.76 s [algebraic-graphs] will become an error in a future GHC release.
  1997. 1258.76 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  1998. 1258.76 s [algebraic-graphs] |
  1999. 1258.76 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  2000. 1258.76 s [algebraic-graphs] | ^
  2001. 1258.76 s [algebraic-graphs]
  2002. 1258.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2003. 1258.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2004. 1258.76 s [algebraic-graphs] will become an error in a future GHC release.
  2005. 1258.76 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2006. 1258.76 s [algebraic-graphs] |
  2007. 1258.76 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  2008. 1258.76 s [algebraic-graphs] | ^
  2009. 1258.76 s [algebraic-graphs]
  2010. 1258.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2011. 1258.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2012. 1258.76 s [algebraic-graphs] will become an error in a future GHC release.
  2013. 1258.76 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2014. 1258.76 s [algebraic-graphs] |
  2015. 1258.76 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  2016. 1258.77 s [algebraic-graphs] | ^
  2017. 1258.77 s [algebraic-graphs]
  2018. 1258.77 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2019. 1258.77 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2020. 1258.77 s [algebraic-graphs] will become an error in a future GHC release.
  2021. 1258.77 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2022. 1258.77 s [algebraic-graphs] |
  2023. 1258.77 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  2024. 1258.77 s [algebraic-graphs] | ^
  2025. 1258.77 s [algebraic-graphs]
  2026. 1258.77 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2027. 1258.77 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2028. 1258.77 s [algebraic-graphs] will become an error in a future GHC release.
  2029. 1258.77 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2030. 1258.77 s [algebraic-graphs] |
  2031. 1258.77 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  2032. 1258.77 s [algebraic-graphs] | ^
  2033. 1258.77 s [algebraic-graphs]
  2034. 1258.77 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2035. 1258.77 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2036. 1258.77 s [algebraic-graphs] will become an error in a future GHC release.
  2037. 1258.77 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2038. 1258.77 s [algebraic-graphs] |
  2039. 1258.77 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  2040. 1258.77 s [algebraic-graphs] | ^
  2041. 1258.86 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  2042. 1258.86 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2043. 1258.87 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  2044. 1259.02 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  2045. 1259.26 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  2046. 1259.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2047. 1259.28 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  2048. 1259.48 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  2049. 1259.64 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  2050. 1259.81 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  2051. 1259.84 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  2052. 1259.89 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  2053. 1259.89 s [algebraic-graphs]
  2054. 1259.90 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2055. 1259.90 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2056. 1259.90 s [algebraic-graphs] will become an error in a future GHC release.
  2057. 1259.90 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2058. 1259.90 s [algebraic-graphs] |
  2059. 1259.90 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  2060. 1259.90 s [algebraic-graphs] | ^
  2061. 1259.93 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  2062. 1259.93 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2063. 1259.94 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  2064. 1259.96 s [algebraic-graphs]
  2065. 1259.96 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2066. 1259.96 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2067. 1259.96 s [algebraic-graphs] will become an error in a future GHC release.
  2068. 1259.96 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2069. 1259.96 s [algebraic-graphs] |
  2070. 1259.96 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  2071. 1259.96 s [algebraic-graphs] | ^
  2072. 1259.96 s [algebraic-graphs]
  2073. 1259.96 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  2074. 1259.96 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  2075. 1259.96 s [algebraic-graphs] will become an error in a future GHC release.
  2076. 1259.96 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  2077. 1259.96 s [algebraic-graphs] |
  2078. 1259.96 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  2079. 1259.96 s [algebraic-graphs] | ^
  2080. 1260.07 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  2081. 1260.21 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  2082. 1260.32 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  2083. 1260.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2084. 1260.32 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  2085. 1260.35 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  2086. 1260.35 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2087. 1260.35 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  2088. 1260.38 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  2089. 1260.38 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2090. 1260.38 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  2091. 1260.42 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  2092. 1260.42 s [algebraic-graphs] Missing documentation for:
  2093. 1260.42 s [algebraic-graphs] Module header
  2094. 1260.42 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  2095. 1260.42 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  2096. 1260.42 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  2097. 1260.42 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  2098. 1260.42 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  2099. 1260.42 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  2100. 1260.42 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  2101. 1260.45 s [algebraic-graphs] Warning: 'array' is out of scope.
  2102. 1260.45 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  2103. 1260.46 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  2104. 1260.46 s [algebraic-graphs] Missing documentation for:
  2105. 1260.46 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  2106. 1266.07 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/index.html,
  2107. 1266.07 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  2108. 1266.16 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  2109. 1266.18 s [algebraic-graphs] Phase: installPhase
  2110. 1266.26 s [algebraic-graphs] Installing library in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  2111. 1267.07 s [algebraic-graphs] Phase: fixupPhase
  2112. 1267.09 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7
  2113. 1267.09 s [algebraic-graphs] shrinking /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSalgebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj-ghc9.6.3.so
  2114. 1267.12 s [algebraic-graphs] checking for references to /build/ in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7...
  2115. 1267.14 s [algebraic-graphs] patching script interpreter paths in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7
  2116. 1267.15 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/lib
  2117. 1267.45 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc
  2118. 1267.47 s [algebraic-graphs] checking for references to /build/ in /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc...
  2119. 1267.49 s [algebraic-graphs] patching script interpreter paths in /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc
  2120. 1267.63 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7
  2121. 1268.18 s [algebraic-graphs:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  2122. 1268.18 s [algebraic-graphs:post-build]
  2123. 1268.61 s [algebraic-graphs:post-build] Pushing /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7 (24.31 MiB)
  2124. 1268.70 s [algebraic-graphs:post-build] Pushing /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc (10.39 MiB)
  2125. 1270.08 s [algebraic-graphs:post-build]
  2126. 1270.08 s [algebraic-graphs:post-build] All done.
  2127. 1270.10 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7
  2128. 1270.14 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2129. 1270.45 s [algebraic-graphs:post-build] copying 2 paths...
  2130. 1270.45 s [algebraic-graphs:post-build] copying path '/nix/store/8p5g6pgfw2pqrw3nfycm509knp7k828h-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  2131. 1272.01 s [algebraic-graphs:post-build] copying path '/nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  2132. 1278.51 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2133. 1278.76 s [algebraic-graphs:post-build] copying 1 paths...
  2134. 1278.80 s [algebraic-graphs:post-build] copying path '/nix/store/hkmvcq18gdpc2h5crjzvsb77mzn2gj9k-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  2135. 1279.01 s Progress: 108 of 113 built, 172 of 172 downloaded from cache
  2136. 1279.07 s Building /nix/store/sn6sxdxi7j5g095cvnrnq2xqgzrvlrjm-algebraic-graph-duoids-0.0.1.0.drv
  2137. 1279.24 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  2138. 1279.25 s [algebraic-graph-duoids] Build with /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3.
  2139. 1279.46 s [algebraic-graph-duoids] Phase: unpackPhase
  2140. 1279.46 s [algebraic-graph-duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./algebraic-graphs
  2141. 1279.47 s [algebraic-graph-duoids] source root is algebraic-graphs
  2142. 1279.48 s [algebraic-graph-duoids] Phase: patchPhase
  2143. 1279.49 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  2144. 1279.49 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.WveZHtOhFG/setup-package.conf.d -threaded
  2145. 1279.54 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.WveZHtOhFG/Main.o )
  2146. 1279.60 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  2147. 1280.84 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  2148. 1280.86 s [algebraic-graph-duoids] Phase: configurePhase
  2149. 1280.86 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.WveZHtOhFG/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/lib
  2150. 1280.87 s [algebraic-graph-duoids] Using Parsec parser
  2151. 1280.87 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  2152. 1281.17 s [algebraic-graph-duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  2153. 1281.46 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  2154. 1281.47 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2155. 1281.47 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.18.1.0
  2156. 1281.47 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  2157. 1281.47 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  2158. 1281.47 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  2159. 1281.47 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2160. 1281.47 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.18.1.0
  2161. 1281.47 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  2162. 1281.47 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  2163. 1281.47 s [algebraic-graph-duoids] hedgehog-1.5
  2164. 1281.47 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  2165. 1281.47 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  2166. 1281.47 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.18.1.0
  2167. 1281.47 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  2168. 1281.47 s [algebraic-graph-duoids] <0.25: using doctest-0.22.6
  2169. 1281.47 s [algebraic-graph-duoids] Source component graph:
  2170. 1281.47 s [algebraic-graph-duoids] component lib
  2171. 1281.47 s [algebraic-graph-duoids] component test:doctests dependency lib
  2172. 1281.47 s [algebraic-graph-duoids] component test:laws dependency lib
  2173. 1281.47 s [algebraic-graph-duoids] Configured component graph:
  2174. 1281.47 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2175. 1281.47 s [algebraic-graph-duoids] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  2176. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  2177. 1281.47 s [algebraic-graph-duoids] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  2178. 1281.47 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-95mgeXNOyDA41E2CAEEDWO-doctests
  2179. 1281.47 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2180. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  2181. 1281.47 s [algebraic-graph-duoids] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  2182. 1281.47 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-3O037TAv3cT3C4RWSEk3FL-laws
  2183. 1281.47 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2184. 1281.47 s [algebraic-graph-duoids] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  2185. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  2186. 1281.47 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  2187. 1281.47 s [algebraic-graph-duoids] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2188. 1281.47 s [algebraic-graph-duoids] Linked component graph:
  2189. 1281.47 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2190. 1281.47 s [algebraic-graph-duoids] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  2191. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  2192. 1281.47 s [algebraic-graph-duoids] include duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  2193. 1281.47 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu:Algebra.Graph.Duoid.Orphans
  2194. 1281.47 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-95mgeXNOyDA41E2CAEEDWO-doctests
  2195. 1281.47 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2196. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  2197. 1281.47 s [algebraic-graph-duoids] include doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  2198. 1281.47 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-3O037TAv3cT3C4RWSEk3FL-laws
  2199. 1281.47 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2200. 1281.47 s [algebraic-graph-duoids] include algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  2201. 1281.47 s [algebraic-graph-duoids] include base-4.18.1.0
  2202. 1281.47 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  2203. 1281.47 s [algebraic-graph-duoids] include hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2204. 1281.47 s [algebraic-graph-duoids] Ready component graph:
  2205. 1281.47 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2206. 1281.47 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  2207. 1281.47 s [algebraic-graph-duoids] depends base-4.18.1.0
  2208. 1281.47 s [algebraic-graph-duoids] depends duoids-0.0.1.0-2HWpA7zVKhqApnK5WQoOuM
  2209. 1281.47 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-3O037TAv3cT3C4RWSEk3FL-laws
  2210. 1281.47 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2211. 1281.47 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-ECz2NzMBEvFbIwAIHrHkj
  2212. 1281.47 s [algebraic-graph-duoids] depends base-4.18.1.0
  2213. 1281.47 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-7yeGT00dBAJ7pSFioRLdp9
  2214. 1281.47 s [algebraic-graph-duoids] depends hedgehog-1.5-BHF7XPtOcLTHdlG8CU1rlp
  2215. 1281.47 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-95mgeXNOyDA41E2CAEEDWO-doctests
  2216. 1281.47 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2217. 1281.47 s [algebraic-graph-duoids] depends base-4.18.1.0
  2218. 1281.47 s [algebraic-graph-duoids] depends doctest-0.22.6-DBfUrtlIshj8Md6OAzYGEC
  2219. 1281.47 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.6
  2220. 1281.47 s [algebraic-graph-duoids] Using compiler: ghc-9.6.3
  2221. 1281.47 s [algebraic-graph-duoids] Using install prefix:
  2222. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  2223. 1281.47 s [algebraic-graph-duoids] Executables installed in:
  2224. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/bin
  2225. 1281.47 s [algebraic-graph-duoids] Libraries installed in:
  2226. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2227. 1281.47 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  2228. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3
  2229. 1281.47 s [algebraic-graph-duoids] Private executables installed in:
  2230. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.6.3/algebraic-graph-duoids-0.0.1.0
  2231. 1281.47 s [algebraic-graph-duoids] Data files installed in:
  2232. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.6.3/algebraic-graph-duoids-0.0.1.0
  2233. 1281.47 s [algebraic-graph-duoids] Documentation installed in:
  2234. 1281.47 s [algebraic-graph-duoids] /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  2235. 1281.47 s [algebraic-graph-duoids] Configuration files installed in:
  2236. 1281.47 s [algebraic-graph-duoids] /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/etc
  2237. 1281.47 s [algebraic-graph-duoids] No alex found
  2238. 1281.47 s [algebraic-graph-duoids] Using ar found on system at:
  2239. 1281.47 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  2240. 1281.47 s [algebraic-graph-duoids] No c2hs found
  2241. 1281.47 s [algebraic-graph-duoids] No cpphs found
  2242. 1281.47 s [algebraic-graph-duoids] Using doctest version 0.22.6 found on system at:
  2243. 1281.47 s [algebraic-graph-duoids] /nix/store/1rhhhdgycbwrgfgqrs5rr0mmh6r4ly3h-doctest-0.22.6/bin/doctest
  2244. 1281.47 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  2245. 1281.47 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  2246. 1281.47 s [algebraic-graph-duoids] Using ghc version 9.6.3 found on system at:
  2247. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc
  2248. 1281.47 s [algebraic-graph-duoids] Using ghc-pkg version 9.6.3 found on system at:
  2249. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/ghc-pkg-9.6.3
  2250. 1281.47 s [algebraic-graph-duoids] No ghcjs found
  2251. 1281.47 s [algebraic-graph-duoids] No ghcjs-pkg found
  2252. 1281.47 s [algebraic-graph-duoids] No greencard found
  2253. 1281.47 s [algebraic-graph-duoids] Using haddock version 2.29.1 found on system at:
  2254. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/haddock-ghc-9.6.3
  2255. 1281.47 s [algebraic-graph-duoids] No happy found
  2256. 1281.47 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  2257. 1281.47 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  2258. 1281.47 s [algebraic-graph-duoids] No hmake found
  2259. 1281.47 s [algebraic-graph-duoids] Using hpc version 0.68 found on system at:
  2260. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hpc-ghc-9.6.3
  2261. 1281.47 s [algebraic-graph-duoids] Using hsc2hs version 0.68.9 found on system at:
  2262. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/hsc2hs-ghc-9.6.3
  2263. 1281.47 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  2264. 1281.47 s [algebraic-graph-duoids] /nix/store/qngfaqq9rvbyp5vzgcy9hk8mwfz355n4-hscolour-1.25/bin/HsColour
  2265. 1281.47 s [algebraic-graph-duoids] No jhc found
  2266. 1281.47 s [algebraic-graph-duoids] Using ld found on system at:
  2267. 1281.47 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  2268. 1281.47 s [algebraic-graph-duoids] No pkg-config found
  2269. 1281.47 s [algebraic-graph-duoids] Using runghc version 9.6.3 found on system at:
  2270. 1281.47 s [algebraic-graph-duoids] /nix/store/cgik97fk10j318g8ibks26h83ghgjfaz-ghc-9.6.3/bin/runghc-9.6.3
  2271. 1281.47 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  2272. 1281.47 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  2273. 1281.47 s [algebraic-graph-duoids] Using tar found on system at:
  2274. 1281.47 s [algebraic-graph-duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  2275. 1281.47 s [algebraic-graph-duoids] No uhc found
  2276. 1281.60 s [algebraic-graph-duoids] Phase: buildPhase
  2277. 1281.66 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  2278. 1281.66 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  2279. 1281.72 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.o, dist/build/Algebra/Graph/Duoid.dyn_o )
  2280. 1281.77 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.o, dist/build/Algebra/Graph/Duoid/Orphans.dyn_o )
  2281. 1282.75 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  2282. 1282.88 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.p_o )
  2283. 1284.78 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2284. 1284.78 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2285. 1284.87 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  2286. 1285.19 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  2287. 1286.04 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2288. 1286.04 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2289. 1286.11 s [algebraic-graph-duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  2290. 1286.30 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  2291. 1286.61 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  2292. 1290.33 s [algebraic-graph-duoids] Phase: checkPhase
  2293. 1290.57 s [algebraic-graph-duoids] Running 2 test suites...
  2294. 1290.57 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  2295. 1290.61 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  2296. 1290.61 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  2297. 1290.61 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  2298. 1290.61 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  2299. 1290.61 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  2300. 1290.61 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  2301. 1290.61 s [algebraic-graph-duoids] ✓ 5 succeeded.
  2302. 1290.61 s [algebraic-graph-duoids] Test suite laws: PASS
  2303. 1290.61 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  2304. 1290.61 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  2305. 1291.03 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  2306. 1291.08 s [algebraic-graph-duoids] Test suite doctests: PASS
  2307. 1291.08 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  2308. 1291.08 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  2309. 1291.10 s [algebraic-graph-duoids] Phase: haddockPhase
  2310. 1291.24 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  2311. 1291.24 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  2312. 1291.41 s [algebraic-graph-duoids] 20% ( 1 / 5) in 'Algebra.Graph.Duoid'
  2313. 1291.41 s [algebraic-graph-duoids] Missing documentation for:
  2314. 1291.41 s [algebraic-graph-duoids] parEmptyGraph (src/Algebra/Graph/Duoid.hs:23)
  2315. 1291.41 s [algebraic-graph-duoids] seqEmptyGraph (src/Algebra/Graph/Duoid.hs:26)
  2316. 1291.41 s [algebraic-graph-duoids] parGraph (src/Algebra/Graph/Duoid.hs:29)
  2317. 1291.41 s [algebraic-graph-duoids] seqGraph (src/Algebra/Graph/Duoid.hs:32)
  2318. 1291.46 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  2319. 1293.61 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  2320. 1293.61 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  2321. 1293.66 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  2322. 1293.66 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  2323. 1293.68 s [algebraic-graph-duoids] Phase: installPhase
  2324. 1293.75 s [algebraic-graph-duoids] Installing library in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/algebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu
  2325. 1293.96 s [algebraic-graph-duoids] Phase: fixupPhase
  2326. 1293.98 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  2327. 1293.98 s [algebraic-graph-duoids] shrinking /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.3/lib/x86_64-linux-ghc-9.6.3/libHSalgebraic-graph-duoids-0.0.1.0-3Dz7LRXAmRK1KULWqx3Ovu-ghc9.6.3.so
  2328. 1293.98 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0...
  2329. 1293.99 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  2330. 1294.00 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/lib
  2331. 1294.04 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc
  2332. 1294.04 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc...
  2333. 1294.05 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc
  2334. 1294.14 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  2335. 1294.61 s [algebraic-graph-duoids:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  2336. 1294.61 s [algebraic-graph-duoids:post-build]
  2337. 1294.99 s [algebraic-graph-duoids:post-build] Pushing /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0 (1.21 MiB)
  2338. 1295.05 s [algebraic-graph-duoids:post-build] Pushing /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc (522.79 KiB)
  2339. 1296.17 s [algebraic-graph-duoids:post-build]
  2340. 1296.17 s [algebraic-graph-duoids:post-build] All done.
  2341. 1296.19 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0
  2342. 1296.26 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2343. 1296.26 s [algebraic-graph-duoids:post-build] copying 2 paths...
  2344. 1296.26 s [algebraic-graph-duoids:post-build] copying path '/nix/store/1g1cq3yj5lf1nkji4j7rlw43ajgad8ln-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  2345. 1296.65 s [algebraic-graph-duoids:post-build] copying path '/nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  2346. 1298.02 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2347. 1298.33 s [algebraic-graph-duoids:post-build] copying 1 paths...
  2348. 1298.33 s [algebraic-graph-duoids:post-build] copying path '/nix/store/sn6sxdxi7j5g095cvnrnq2xqgzrvlrjm-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  2349. 1298.61 s Progress: 109 of 113 built, 172 of 172 downloaded from cache
  2350. 1298.67 s Building /nix/store/04skf427dn17vq8ip7iw034vq2la7y1q-ghc-9.6.3-with-packages.drv
  2351. 1298.72 s [ghc-9.6.3-with-packages] /nix/store/nypjqp4i5drxggyvpnjyvn1h7pf8fs03-duoidal-transformers-0.0.1.0/nix-support:
  2352. 1298.72 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2353. 1298.73 s [ghc-9.6.3-with-packages] /nix/store/91452g2kq9d0rbafkwi7s0ixqbh9d52v-duoids-hedgehog-0.0.1.0/nix-support:
  2354. 1298.73 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2355. 1298.73 s [ghc-9.6.3-with-packages] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/nix-support:
  2356. 1298.73 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2357. 1298.74 s [ghc-9.6.3-with-packages] /nix/store/cpwhp6mb69760bhnzxgplckrkkbxd5rf-algebraic-graphs-0.7/nix-support:
  2358. 1298.74 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2359. 1298.74 s [ghc-9.6.3-with-packages] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/nix-support:
  2360. 1298.74 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2361. 1298.75 s [ghc-9.6.3-with-packages] /nix/store/zhq4ppi6xxl59vx6y6y34j5w98x5cyk4-hedgehog-1.5/nix-support:
  2362. 1298.75 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2363. 1298.75 s [ghc-9.6.3-with-packages] /nix/store/50p4c5pa9jr87ghaxak4nz048zjh792p-ansi-terminal-1.1.2/nix-support:
  2364. 1298.75 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2365. 1298.75 s [ghc-9.6.3-with-packages] /nix/store/50p4c5pa9jr87ghaxak4nz048zjh792p-ansi-terminal-1.1.2/nix-support:
  2366. 1298.75 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2367. 1298.75 s [ghc-9.6.3-with-packages] /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5/nix-support:
  2368. 1298.75 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2369. 1298.76 s [ghc-9.6.3-with-packages] /nix/store/lgr9hsh07xa0jlj61q4qhq470ifhnm04-async-2.2.5/nix-support:
  2370. 1298.76 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2371. 1298.76 s [ghc-9.6.3-with-packages] /nix/store/l78smfvlamnbs6dq5dip89qyb3i01hca-barbies-2.1.1.0/nix-support:
  2372. 1298.76 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2373. 1298.76 s [ghc-9.6.3-with-packages] /nix/store/l78smfvlamnbs6dq5dip89qyb3i01hca-barbies-2.1.1.0/nix-support:
  2374. 1298.76 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2375. 1298.77 s [ghc-9.6.3-with-packages] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/nix-support:
  2376. 1298.77 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2377. 1298.77 s [ghc-9.6.3-with-packages] /nix/store/anvdsdq2lq5gbwdzd8v622iw867zb4sz-concurrent-output-1.10.21/nix-support:
  2378. 1298.77 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2379. 1298.77 s [ghc-9.6.3-with-packages] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/nix-support:
  2380. 1298.77 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2381. 1298.77 s [ghc-9.6.3-with-packages] /nix/store/m5735c8m15bjnfwmbpd8b92d8dcl08zd-lifted-async-0.10.2.7/nix-support:
  2382. 1298.77 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2383. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/11ji5jbp8d31m3jhc44qa6852x9yrpqj-mmorph-1.2.0/nix-support:
  2384. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2385. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/11ji5jbp8d31m3jhc44qa6852x9yrpqj-mmorph-1.2.0/nix-support:
  2386. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2387. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/g7r8i4j1sq499ng6m6k90cdygj39v40b-monad-control-1.0.3.1/nix-support:
  2388. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2389. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/g7r8i4j1sq499ng6m6k90cdygj39v40b-monad-control-1.0.3.1/nix-support:
  2390. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2391. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/bdriwlkszkbilzbid9ywn2pxnll3vsgw-pretty-show-1.10/nix-support:
  2392. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2393. 1298.78 s [ghc-9.6.3-with-packages] /nix/store/bdriwlkszkbilzbid9ywn2pxnll3vsgw-pretty-show-1.10/nix-support:
  2394. 1298.78 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2395. 1298.79 s [ghc-9.6.3-with-packages] /nix/store/4pas9p9qm4hcq0jacd5gbvx1wdbdm8qq-primitive-0.9.1.0/nix-support:
  2396. 1298.79 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2397. 1298.79 s [ghc-9.6.3-with-packages] /nix/store/4pas9p9qm4hcq0jacd5gbvx1wdbdm8qq-primitive-0.9.1.0/nix-support:
  2398. 1298.79 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2399. 1298.79 s [ghc-9.6.3-with-packages] /nix/store/7i0h7h1m8kxxvb8vymqwim3w4ixy6vdp-random-1.2.1.3/nix-support:
  2400. 1298.79 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2401. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/7i0h7h1m8kxxvb8vymqwim3w4ixy6vdp-random-1.2.1.3/nix-support:
  2402. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2403. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/4688rpnf7ryrv8npscr2a4ps0g7jp7n8-resourcet-1.3.0/nix-support:
  2404. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2405. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/4688rpnf7ryrv8npscr2a4ps0g7jp7n8-resourcet-1.3.0/nix-support:
  2406. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2407. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/rlya20y03shhyam99n5ylx45hvbk83i2-safe-exceptions-0.1.7.4/nix-support:
  2408. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2409. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/rlya20y03shhyam99n5ylx45hvbk83i2-safe-exceptions-0.1.7.4/nix-support:
  2410. 1298.80 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2411. 1298.80 s [ghc-9.6.3-with-packages] /nix/store/q13c0pm6f0g5frncyldm3yikhrp856y2-transformers-base-0.4.6/nix-support:
  2412. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2413. 1298.81 s [ghc-9.6.3-with-packages] /nix/store/q13c0pm6f0g5frncyldm3yikhrp856y2-transformers-base-0.4.6/nix-support:
  2414. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2415. 1298.81 s [ghc-9.6.3-with-packages] /nix/store/w1831qcz75ihsdmlnzxifylnzah9bszj-wl-pprint-annotated-0.1.0.1/nix-support:
  2416. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2417. 1298.81 s [ghc-9.6.3-with-packages] /nix/store/w1831qcz75ihsdmlnzxifylnzah9bszj-wl-pprint-annotated-0.1.0.1/nix-support:
  2418. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2419. 1298.81 s [ghc-9.6.3-with-packages] /nix/store/qd7ifqr4hi6b9v60ix1wkvafd2pjjpn7-ansi-terminal-types-1.1/nix-support:
  2420. 1298.81 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2421. 1298.82 s [ghc-9.6.3-with-packages] /nix/store/qd7ifqr4hi6b9v60ix1wkvafd2pjjpn7-ansi-terminal-types-1.1/nix-support:
  2422. 1298.82 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2423. 1298.82 s [ghc-9.6.3-with-packages] /nix/store/i01cfmnc0vqryiyibk4bsbdppdzxsx72-hashable-1.4.7.0/nix-support:
  2424. 1298.82 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2425. 1298.83 s [ghc-9.6.3-with-packages] /nix/store/i01cfmnc0vqryiyibk4bsbdppdzxsx72-hashable-1.4.7.0/nix-support:
  2426. 1298.83 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2427. 1298.83 s [ghc-9.6.3-with-packages] /nix/store/hyhrgyzsaqpk5k2bzfghdr2iw3gkg932-distributive-0.6.2.1/nix-support:
  2428. 1298.83 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2429. 1298.83 s [ghc-9.6.3-with-packages] /nix/store/hyhrgyzsaqpk5k2bzfghdr2iw3gkg932-distributive-0.6.2.1/nix-support:
  2430. 1298.83 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2431. 1298.83 s [ghc-9.6.3-with-packages] /nix/store/fpzjqfhar6pi07fj4gj6aijsg32nkw7s-constraints-0.14.2/nix-support:
  2432. 1298.83 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2433. 1298.84 s [ghc-9.6.3-with-packages] /nix/store/fpzjqfhar6pi07fj4gj6aijsg32nkw7s-constraints-0.14.2/nix-support:
  2434. 1298.84 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2435. 1298.84 s [ghc-9.6.3-with-packages] /nix/store/iwc102rdjzcjwlpjlndb6imcdm9zzwgy-lifted-base-0.2.3.12/nix-support:
  2436. 1298.84 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2437. 1298.84 s [ghc-9.6.3-with-packages] /nix/store/iwc102rdjzcjwlpjlndb6imcdm9zzwgy-lifted-base-0.2.3.12/nix-support:
  2438. 1298.84 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2439. 1298.85 s [ghc-9.6.3-with-packages] /nix/store/zmn0ap38l4g69lcjwiw2kmplfsq1af4r-transformers-compat-0.7.2/nix-support:
  2440. 1298.85 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2441. 1298.85 s [ghc-9.6.3-with-packages] /nix/store/zmn0ap38l4g69lcjwiw2kmplfsq1af4r-transformers-compat-0.7.2/nix-support:
  2442. 1298.85 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2443. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/vcpbd4xzmcp57zr42bb4860xpq003j3p-splitmix-0.1.1/nix-support:
  2444. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2445. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/vcpbd4xzmcp57zr42bb4860xpq003j3p-splitmix-0.1.1/nix-support:
  2446. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2447. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/70dymfj4rb9i9m88rprl50aw8gswi364-unliftio-core-0.2.1.0/nix-support:
  2448. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2449. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/70dymfj4rb9i9m88rprl50aw8gswi364-unliftio-core-0.2.1.0/nix-support:
  2450. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2451. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/flv8w02hdrmwqxw64lqwl0h20bxzqnp0-base-orphans-0.9.3/nix-support:
  2452. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2453. 1298.86 s [ghc-9.6.3-with-packages] /nix/store/flv8w02hdrmwqxw64lqwl0h20bxzqnp0-base-orphans-0.9.3/nix-support:
  2454. 1298.86 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2455. 1298.87 s [ghc-9.6.3-with-packages] /nix/store/aj1zri1ypx7p7da7ncqrzfsyvjslvgwr-os-string-2.0.7/nix-support:
  2456. 1298.87 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2457. 1298.87 s [ghc-9.6.3-with-packages] /nix/store/aj1zri1ypx7p7da7ncqrzfsyvjslvgwr-os-string-2.0.7/nix-support:
  2458. 1298.87 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2459. 1298.87 s [ghc-9.6.3-with-packages] /nix/store/056xwdbxzpm4fappfvb1knb44wz2pfb7-tagged-0.8.8/nix-support:
  2460. 1298.87 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2461. 1298.87 s [ghc-9.6.3-with-packages] /nix/store/056xwdbxzpm4fappfvb1knb44wz2pfb7-tagged-0.8.8/nix-support:
  2462. 1298.87 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2463. 1298.88 s [ghc-9.6.3-with-packages] /nix/store/3v9igj5pmilrqckb7dp9b6g7s8d1h8ms-boring-0.2.2/nix-support:
  2464. 1298.88 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2465. 1298.88 s [ghc-9.6.3-with-packages] /nix/store/3v9igj5pmilrqckb7dp9b6g7s8d1h8ms-boring-0.2.2/nix-support:
  2466. 1298.88 s [ghc-9.6.3-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8b766i6jnqb18rk5349h3452bi9dakm0-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  2467. 1299.67 s [ghc-9.6.3-with-packages] Warning: include-dirs: /nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages/lib/ghc-9.6.3/lib/../lib/x86_64-linux-ghc-9.6.3/directory-1.3.8.1/include doesn't exist or isn't a directory
  2468. 1300.81 s [ghc-9.6.3-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages
  2469. 1301.47 s [ghc-9.6.3-with-packages:post-build] Pushing 1 paths (140 are already present) using zstd to cache sellout ⏳
  2470. 1301.47 s [ghc-9.6.3-with-packages:post-build]
  2471. 1301.84 s [ghc-9.6.3-with-packages:post-build] Pushing /nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages (4.19 MiB)
  2472. 1303.72 s [ghc-9.6.3-with-packages:post-build]
  2473. 1303.72 s [ghc-9.6.3-with-packages:post-build] All done.
  2474. 1303.75 s [ghc-9.6.3-with-packages:post-build] Uploading to the NixCI cache: /nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages
  2475. 1303.80 s [ghc-9.6.3-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2476. 1304.02 s [ghc-9.6.3-with-packages:post-build] copying 1 paths...
  2477. 1304.02 s [ghc-9.6.3-with-packages:post-build] copying path '/nix/store/yjpfjhjm0m0acl647rhpsvvplbv8ic7x-ghc-9.6.3-with-packages' to 'https://cache.nix-ci.com'...
  2478. 1305.09 s [ghc-9.6.3-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2479. 1305.33 s [ghc-9.6.3-with-packages:post-build] copying 1 paths...
  2480. 1305.33 s [ghc-9.6.3-with-packages:post-build] copying path '/nix/store/04skf427dn17vq8ip7iw034vq2la7y1q-ghc-9.6.3-with-packages.drv' to 'https://cache.nix-ci.com'...
  2481. 1305.56 s Progress: 110 of 112 built, 172 of 172 downloaded from cache
  2482. 1305.61 s Building /nix/store/2vzf4cl7iwrm9xplzxch1rvvb22zjjrb-all-packages.drv
  2483. 1305.68 s [all-packages] created 3 symlinks in user environment
  2484. 1305.72 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages
  2485. 1306.23 s [all-packages:post-build] Pushing 1 paths (141 are already present) using zstd to cache sellout ⏳
  2486. 1306.23 s [all-packages:post-build]
  2487. 1306.60 s [all-packages:post-build] Pushing /nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages (872.00 B)
  2488. 1307.57 s [all-packages:post-build]
  2489. 1307.57 s [all-packages:post-build] All done.
  2490. 1307.65 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages
  2491. 1307.81 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2492. 1308.04 s [all-packages:post-build] copying 1 paths...
  2493. 1308.04 s [all-packages:post-build] copying path '/nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages' to 'https://cache.nix-ci.com'...
  2494. 1308.37 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  2495. 1308.63 s [all-packages:post-build] copying 1 paths...
  2496. 1308.63 s [all-packages:post-build] copying path '/nix/store/2vzf4cl7iwrm9xplzxch1rvvb22zjjrb-all-packages.drv' to 'https://cache.nix-ci.com'...
  2497. 1308.87 s Progress: 111 of 112 built, 172 of 172 downloaded from cache
  2498. 1308.87 s Progress: 112 of 112 built, 172 of 172 downloaded from cache
  2499. 1308.87 s /nix/store/7r9iiwzaqvj58d35jwawazsr2mmw09qw-all-packages
  2500. 1308.93 s Build succeeded.
More Logs Raw Logs

Agent Instructions

Wait for completion, without logs:

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/c497757f-e3b5-4f4a-b4ae-355c1d64d395/wait

Latest logs, with timestamps (streams while running):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/c497757f-e3b5-4f4a-b4ae-355c1d64d395/tail

All logs, with timestamps (available after completion):

curl --netrc https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/c497757f-e3b5-4f4a-b4ae-355c1d64d395/logs

Raw logs, from the start (no timestamps):

curl --netrc -N https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/c497757f-e3b5-4f4a-b4ae-355c1d64d395/raw-logs

Content types available for /logs and /tail (use Accept header):

Example:

curl --netrc -H "Accept: text/csv" https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/c497757f-e3b5-4f4a-b4ae-355c1d64d395/logs

Reproduce locally: https://nix-ci.com/gh:sellout:duoids/do-helpers/4415bc17d6e7dc493e0ba036c397559d9b43477f/c497757f-e3b5-4f4a-b4ae-355c1d64d395/repro

This page is also available in machine-friendly formats. Request one with the Accept header:

For more instructions, fetch https://nix-ci.com/instructions .