"mate" Board: Results: showSquare ? ((,) -1 ?1) ==> ! Prelude.(!!): negative index showSquare ? ((,) 0 ?1) ==> ! Prelude.(!!): negative index kingSquare Black emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq showSquare ? ((,) -1 ?1) ==> ! Prelude.(!!): negative index showSquare ? ((,) 0 ?1) ==> ! Prelude.(!!): negative index kingSquare Black emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq showBoard (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showSquare ? ((,) -1 ?1) ==> ! Prelude.(!!): negative index showSquare ? ((,) 0 ?1) ==> ! Prelude.(!!): negative index pieceAt (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq showBoard (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showSquare ? ((,) -1 ?1) ==> ! Prelude.(!!): negative index showSquare ? ((,) 0 ?1) ==> ! Prelude.(!!): negative index pieceAt (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black (rmPieceAt White ? emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) White ?1) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare White (putPieceAt ? ((,) Black ?1) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq forcesColoured Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showSquare ? ((,) -1 ?1) ==> ! Prelude.(!!): negative index showSquare ? ((,) 0 ?1) ==> ! Prelude.(!!): negative index pieceAt (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black (rmPieceAt White ? emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) White ?1) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare White (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare White (putPieceAt ? ((,) Black ?1) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq forcesColoured Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured Black (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured White (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showSquare ? ((,) -1 ?1) ==> ! Prelude.(!!): negative index showSquare ? ((,) 0 ?1) ==> ! Prelude.(!!): negative index pieceAt (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black (rmPieceAt White ? emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare Black (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) Black Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) White ?1) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare Black (putPieceAt ? ((,) White ?1) (putPieceAt ?2 ((,) White ?3) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White emptyBoard ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare White (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare White (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingSquare White (putPieceAt ? ((,) Black ?1) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) Black ?1) (putPieceAt ?2 ((,) Black ?3) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingSquare White (putPieceAt ? ((,) White Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq forcesColoured Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured Black (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured Black (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured Black (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured White (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured White (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa forcesColoured White (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 (rmPieceAt Black ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 (rmPieceAt Black ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (putPieceAt ((,) -1 ?1) ((,) White ?2) emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt Black ? (putPieceAt ((,) 0 ?1) ((,) White ?2) emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 (rmPieceAt Black ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 (rmPieceAt Black ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard)))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (rmPieceAt White ?1 (putPieceAt ?2 ((,) Black ?3) emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) (rmPieceAt White ?3 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) (putPieceAt ?3 ((,) Black ?4) emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ((,) -1 ?) ((,) Black ?1) (rmPieceAt Black ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ((,) 0 ?) ((,) Black ?1) (rmPieceAt Black ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 (putPieceAt ?3 ((,) Black ?4) emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ? ((,) Black ?1) (putPieceAt ?2 ((,) Black ?3) (rmPieceAt White ?4 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ((,) -1 ?) ((,) White ?1) (rmPieceAt Black ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ((,) 0 ?) ((,) White ?1) (rmPieceAt Black ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ((,) -1 ?) ((,) White ?1) (rmPieceAt White ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showBoard (putPieceAt ((,) 0 ?) ((,) White ?1) (rmPieceAt White ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa showSquare ? ((,) -1 ?1) ==> ! Prelude.(!!): negative index showSquare ? ((,) 0 ?1) ==> ! Prelude.(!!): negative index pieceAt (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) ?4 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard)))) ?4 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa pieceAt (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) ?4 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? emptyBoard) ?1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ?2 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard)))) ?4 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa emptyAtAll (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) ?3 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa Move: Results: showMoves ([]) ==> ! Move.hs:31:0-67: Non-exhaustive patterns in function showMoves showMoves ([]) ==> ! Move.hs:31:0-67: Non-exhaustive patterns in function showMoves showMoves ([]) ==> ! Move.hs:31:0-67: Non-exhaustive patterns in function showMoves showMoves ([]) ==> ! Move.hs:31:0-67: Non-exhaustive patterns in function showMoves case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index showMoves ([]) ==> ! Move.hs:31:0-67: Non-exhaustive patterns in function showMoves moveDetailsFor Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Nothing) ?3)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Nothing) ?3)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ?1 (Move ((,) -1 ?2) (Nothing) (Nothing))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ?1 (Move ((,) 0 ?2) (Nothing) (Nothing))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Nothing) (Just ?3))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Nothing) (Just ?3))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index showMoves ([]) ==> ! Move.hs:31:0-67: Non-exhaustive patterns in function showMoves case case showMoves (: (MoveInFull ((,) ? Queen) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Queen) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Rook) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Rook) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Bishop) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Bishop) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Knight) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Knight) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Nothing) (Just ?3))) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Nothing) (Just ?3))) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Just ?3) ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Just ?3) ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index moveDetailsFor Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Nothing) ?3)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Nothing) ?3)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ?1 (Move ((,) -1 ?2) (Nothing) (Nothing))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ?1 (Move ((,) 0 ?2) (Nothing) (Nothing))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Nothing) (Just ?3))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Nothing) (Just ?3))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index showMoves ([]) ==> ! Move.hs:31:0-67: Non-exhaustive patterns in function showMoves case case showMoves (: (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Nothing) ?3)) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Nothing) ?3)) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Queen) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Queen) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Rook) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Rook) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Bishop) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Bishop) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Knight) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Knight) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ?1 (Move ((,) -1 ?2) (Nothing) (Nothing))) ?3) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ?1 (Move ((,) 0 ?2) (Nothing) (Nothing))) ?3) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Nothing) (Just ?3))) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Nothing) (Just ?3))) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Just ?3) ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Just ?3) ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index moveDetailsFor Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (putPieceAt ((,) -1 ?) ((,) White King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (putPieceAt ((,) -1 ?) ((,) Black King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Nothing) ?3)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Nothing) ?3)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Just ((,) ?3 ?4)) ?5)) of _ : x -> x of _ : x -> x of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Just ((,) ?3 ?4)) ?5)) of _ : x -> x of _ : x -> x of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ?1 (Move ((,) -1 ?2) (Nothing) (Nothing))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ?1 (Move ((,) 0 ?2) (Nothing) (Nothing))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Nothing) (Just ?3))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Nothing) (Just ?3))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index showMoves ([]) ==> ! Move.hs:31:0-67: Non-exhaustive patterns in function showMoves case case showMoves (: (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Nothing) ?3)) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Nothing) ?3)) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Queen) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Queen) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Rook) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Rook) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Bishop) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Bishop) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Knight) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Knight) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ?1 (Move ((,) -1 ?2) (Nothing) (Nothing))) ?3) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ?1 (Move ((,) 0 ?2) (Nothing) (Nothing))) ?3) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Nothing) (Just ?3))) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Nothing) (Just ?3))) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Just ?3) ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Just ?3) ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index moveDetailsFor Black (putPieceAt ? ((,) White ?1) (rmPieceAt Black ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor Black (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa moveDetailsFor White (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (putPieceAt ((,) -1 ?) ((,) White King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 -1) ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 0) ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 1) ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 -1) ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 0) ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 1) ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 -1) ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 0) ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 1) ((,) White Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White King) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White King) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White King) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Queen) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Queen) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Queen) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Rook) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Rook) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Rook) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Knight) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Knight) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Knight) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) -1 ?) ((,) White Pawn) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 0 ?) ((,) White Pawn) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (putPieceAt ((,) 1 ?) ((,) White Pawn) (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck Black (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck Black (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (putPieceAt ((,) -1 ?) ((,) Black King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black King) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Queen) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Rook) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 -1) ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 0) ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 1) ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 -1) ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 0) ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 1) ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 -1) ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 0) ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 1) ((,) Black Bishop) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Knight) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Pawn) emptyBoard) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black King) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black King) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black King) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Queen) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Queen) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Queen) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Rook) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Rook) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Rook) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Knight) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Knight) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Knight) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) -1 ?) ((,) Black Pawn) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 0 ?) ((,) Black Pawn) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ((,) 1 ?) ((,) Black Pawn) (putPieceAt ?1 ((,) Black ?2) emptyBoard)) ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq kingincheck White (putPieceAt ? ((,) White ?1) (rmPieceAt Black ?2 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? emptyBoard) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (putPieceAt ?1 ((,) White ?2) emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa kingincheck White (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Nothing) ?3)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Nothing) ?3)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Just ((,) ?3 ?4)) ?5)) of _ : x -> x of _ : x -> x of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case case case showMoveInFull (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Just ((,) ?3 ?4)) ?5)) of _ : x -> x of _ : x -> x of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Queen) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Rook) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Bishop) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) -1 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Knight) ((,) 0 ?1) (Move ?2 ?3 ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ?1 (Move ((,) -1 ?2) (Nothing) (Nothing))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ?1 (Move ((,) 0 ?2) (Nothing) (Nothing))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Nothing) (Just ?3))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Nothing) (Just ?3))) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoveInFull (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Just ?3) ?4)) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index showMoves ([]) ==> ! Move.hs:31:0-67: Non-exhaustive patterns in function showMoves case case showMoves (: (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Nothing) ?3)) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Nothing) ?3)) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case case case showMoves (: (MoveInFull ((,) ? King) ?1 (Move ((,) -1 ?2) (Just ((,) ?3 ?4)) ?5)) ?6) of _ : x -> x of _ : x -> x of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case case case showMoves (: (MoveInFull ((,) ? King) ?1 (Move ((,) 0 ?2) (Just ((,) ?3 ?4)) ?5)) ?6) of _ : x -> x of _ : x -> x of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Queen) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Queen) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Rook) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Rook) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Bishop) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Bishop) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Knight) ((,) -1 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Knight) ((,) 0 ?1) (Move ?2 ?3 ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ?1 (Move ((,) -1 ?2) (Nothing) (Nothing))) ?3) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ?1 (Move ((,) 0 ?2) (Nothing) (Nothing))) ?3) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Nothing) (Just ?3))) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Nothing) (Just ?3))) ?4) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) -1 ?1) (Move ?2 (Just ?3) ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index case case showMoves (: (MoveInFull ((,) ? Pawn) ((,) 0 ?1) (Move ?2 (Just ?3) ?4)) ?5) of _ : x -> x of _ : x -> x ==> ! Prelude.(!!): negative index Problem: Results: case readProblem ([]) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem ([]) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem ([]) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem ([]) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem ([]) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem ([]) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem ([]) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: 'a' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '0' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '\NUL' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: 'a' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '0' (: '0' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem ([]) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '\NUL' (: '0' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: 'a' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: 'a' (: '0' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '\NUL' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: 'a' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: '\NUL' (: '0' (: '0' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' ([])) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' ([]))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '\NUL' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '\NUL' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: 'a' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '0' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '0' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '0' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: 'a' (: '0' (: '0' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' ([])))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' ([]))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: '\NUL' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: 'a' ([])))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '\NUL' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: 'a' (: 'a' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal case readProblem (: 'a' (: '\NUL' (: '0' (: '\NUL' (: 'a' (: '0' ([]))))))) of (,) _ x -> x ==> ! Problem.hs:(40,0)-(44,26): Non-exhaustive patterns in function parseGoal Solution: Results: solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve (rmPieceAt Black ? emptyBoard) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? emptyBoard) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve (rmPieceAt Black ? emptyBoard) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? emptyBoard) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve (putPieceAt ((,) 0 0) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Rook) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Rook) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Rook) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 -1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (rmPieceAt Black ? emptyBoard) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ((,) 0 0) ((,) White King) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White King) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White King) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White King) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) White Queen) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Queen) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Queen) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Queen) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Rook) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Rook) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Rook) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) White Bishop) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Bishop) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Bishop) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Bishop) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 -1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? emptyBoard) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve (putPieceAt ((,) 0 0) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Rook) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Rook) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Rook) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 -1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ? ((,) White ?1) (rmPieceAt Black ?2 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? emptyBoard) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (putPieceAt ?1 ((,) White ?2) emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ((,) 0 0) ((,) White King) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White King) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White King) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White King) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) White Queen) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Queen) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Queen) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Queen) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Rook) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Rook) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Rook) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) White Bishop) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Bishop) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Bishop) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Bishop) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Knight) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 -1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) White Pawn) emptyBoard) White 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? emptyBoard) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (putPieceAt ?1 ((,) Black ?2) emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve ? ?1 -1 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve ? ?1 0 ==> ! Solution.hs:(13,0)-(24,34): Non-exhaustive patterns in function solution solve (putPieceAt ((,) 0 0) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black King) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Queen) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Rook) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Rook) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Rook) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Bishop) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Knight) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 -1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 0) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 -1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 0) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 0 1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 -1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 0) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) 1 1) ((,) Black Pawn) emptyBoard) Black 1 ==> ! Board.hs:(82,0)-(83,27): Non-exhaustive patterns in function kSq solve (putPieceAt ((,) -1 ?) ((,) Black King) (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ((,) -1 ?) ((,) Black Queen) (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ((,) -1 ?) ((,) Black Rook) (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ((,) -1 ?) ((,) Black Bishop) (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ((,) ? ?1) ((,) Black Pawn) (rmPieceAt White ?2 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) White ?1) (putPieceAt ?2 ((,) White ?3) (rmPieceAt Black ?4 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) White ?1) (rmPieceAt Black ?2 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) White ?1) (rmPieceAt Black ?2 (putPieceAt ?3 ((,) White ?4) emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) White ?1) (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) White ?1) (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) White ?1) (rmPieceAt White ?2 (rmPieceAt Black ?3 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? emptyBoard) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (putPieceAt ?1 ((,) White ?2) emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (putPieceAt ?1 ((,) White ?2) (putPieceAt ?3 ((,) White ?4) emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (putPieceAt ?1 ((,) White ?2) (rmPieceAt Black ?3 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (putPieceAt ?1 ((,) White ?2) (rmPieceAt White ?3 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (putPieceAt ?2 ((,) White ?3) emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 (rmPieceAt Black ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt Black ?1 (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (putPieceAt ?2 ((,) White ?3) emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 (rmPieceAt Black ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt Black ? (rmPieceAt White ?1 (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (putPieceAt ((,) ?1 ?2) ((,) Black Pawn) emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (putPieceAt ?1 ((,) White ?2) (rmPieceAt Black ?3 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 emptyBoard)) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (putPieceAt ?2 ((,) White ?3) emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 (rmPieceAt Black ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt Black ?1 (rmPieceAt White ?2 (rmPieceAt White ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 emptyBoard))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 (rmPieceAt Black ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (rmPieceAt White ? (rmPieceAt White ?1 (rmPieceAt White ?2 (rmPieceAt Black ?3 emptyBoard)))) Black 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) Black ?1) (putPieceAt ?2 ((,) Black ?3) (rmPieceAt White ?4 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) Black ?1) (rmPieceAt Black ?2 (rmPieceAt White ?3 emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 emptyBoard)) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa solve (putPieceAt ? ((,) Black ?1) (rmPieceAt White ?2 (putPieceAt ?3 ((,) Black ?4) emptyBoard))) White 1 ==> ! Board.hs:73:0-61: Non-exhaustive patterns in function rPa Writing: Board.hs.html Writing: Move.hs.html Writing: Problem.hs.html Writing: Solution.hs.html Writing: hpc_index.html Writing: hpc_index_fun.html Writing: hpc_index_alt.html Writing: hpc_index_exp.html ["Board.hs","Move.hs","Problem.hs","Solution.hs"]