cd TreeStructures-0.0.1 irulan --iterative-deepening --maximumRuntime=60 --no-maximumExpressionSize --no-maximumExpressionDepth --full-testsuite=Data.Heap.Binary.tst --enable-show-results --enable-case-statements --no-cache --ints="[0,1,2,3]" source Data.Heap.Binary ; cd ../ cd TreeStructures-0.0.2 irulan --iterative-deepening --maximumRuntime=60 --no-maximumExpressionSize --no-maximumExpressionDepth --full-testsuite=Data.Heap.Binary.tst --enable-show-results --enable-case-statements --no-cache --ints="[0,1,2,3]" source Data.Heap.Binary ; cd .. cd TreeStructures-git irulan --iterative-deepening --maximumRuntime=60 --no-maximumExpressionSize --no-maximumExpressionDepth --full-testsuite=Data.Heap.Binary.tst --enable-show-results --enable-case-statements --no-cache --ints="[0,1,2,3]" source Data.Heap.Binary ; cd .. # Git SHA1 ID: 8486df1682a9dd211e04abd1d030015e8b398100 # For the test suite comparison (see html output) irulan tsa TreeStructures-0.0.1/Data.Heap.Binary.tst TreeStructures-0.0.2/Data.Heap.Binary.tst Output from irulan during 60s of iterative deepening (error causing expressions found): 0.0.1 Data.Heap.Binary Data.Heap.Binary: Results: head ? (empty ?1) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (fromList ?3 ([])) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (tail ?3 (singleton ?4 ?5)) ?6)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (merge ?5 (empty ?6) (empty ?7)))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (tail ?3 (singleton ?4 ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (merge ?5 (empty ?6) (empty ?7))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (tail ?2 (singleton ?3 ?4)) (empty ?5)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (tail ?2 (singleton ?3 ?4)) (tail ?5 (singleton ?6 ?7))) ==> ! Data.Tree.Heap: empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (insert ?2 (fromList ?3 ([])) ?4)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (insert ?2 (tail ?3 (singleton ?4 ?5)) ?6)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (merge ?2 (empty ?3) (singleton ?4 ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (merge ?2 (singleton ?3 ?4) (empty ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (fromList ?3 ([])) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (fromList ?3 ([])) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (fromList ?3 ([])) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (tail ?3 (singleton ?4 ?5)) ?6)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (fromList ?3 ([])) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 (empty ?3) ?4)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (tail ?3 (singleton ?4 ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list 0.0.2 Data.Heap.Binary Data.Heap.Binary: Results: head ? (empty ?1) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (tail ?4 (singleton ?5 ?6)))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (merge ?5 (empty ?6) (empty ?7)))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (tail ?3 (singleton ?4 ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (merge ?5 (empty ?6) (empty ?7))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (tail ?2 (singleton ?3 ?4)) (empty ?5)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (tail ?2 (singleton ?3 ?4)) (tail ?5 (singleton ?6 ?7))) ==> ! Data.Tree.Heap: empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (insert ?2 ?3 (tail ?4 (singleton ?5 ?6)))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (merge ?2 (empty ?3) (singleton ?4 ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (merge ?2 (singleton ?3 ?4) (empty ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (tail ?4 (singleton ?5 ?6)))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (tail ?3 (singleton ?4 ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list git Data.Heap.Binary Data.Heap.Binary: Results: head ? (empty ?1) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (tail ?4 (singleton ?5 ?6)))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (empty ?1) ==> ! Data.Tree.Heap: empty list head ? (fromList ?1 ([])) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (merge ?5 (empty ?6) (empty ?7)))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (empty ?2) (tail ?3 (singleton ?4 ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Tree.Heap: empty list head ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (merge ?5 (empty ?6) (empty ?7))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (tail ?2 (singleton ?3 ?4)) (empty ?5)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (merge ?1 (tail ?2 (singleton ?3 ?4)) (tail ?5 (singleton ?6 ?7))) ==> ! Data.Tree.Heap: empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list head ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Tree.Heap: empty list head ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (insert ?2 ?3 (tail ?4 (singleton ?5 ?6)))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (merge ?2 (empty ?3) (singleton ?4 ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (merge ?2 (singleton ?3 ?4) (empty ?5))) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list head ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Tree.Heap: empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (tail ?4 (singleton ?5 ?6)))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (fromList ?4 ([])))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (fromList ?2 (: ?3 ([])))) ==> ! Data.Heap empty list tail ? (tail ?1 (insert ?2 ?3 (empty ?4))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (tail ?1 (singleton ?2 ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (merge ?3 (empty ?4) (empty ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (tail ?3 (singleton ?4 ?5))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (empty ?3)) ==> ! Data.Heap empty list tail ? (merge ?1 (fromList ?2 ([])) (fromList ?3 ([]))) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (merge ?1 (merge ?2 (empty ?3) (empty ?4)) (empty ?5)) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (empty ?1) ==> ! Data.Heap empty list tail ? (fromList ?1 ([])) ==> ! Data.Heap empty list tail ? (merge ?1 (empty ?2) (empty ?3)) ==> ! Data.Heap empty list