TASK DEFINITION: In this task you will be given a passage and a yes/no question based on the passage. You should answer the question using the information from the passage.
PROBLEM: passage: In Texas, for example, blue laws prohibited selling housewares such as pots, pans, and washing machines on Sunday until 1985. In Colorado, Illinois, Indiana, Iowa, Louisiana, Maine, Minnesota, Missouri, Oklahoma, New Jersey, North Dakota, Pennsylvania, and Wisconsin, car dealerships continue to operate under blue-law prohibitions in which an automobile may not be purchased or traded on a Sunday. Maryland permits Sunday automobile sales only in the counties of Charles, Prince George's, Montgomery, and Howard; similarly, Michigan restricts Sunday sales to only those counties with a population of less than 130,000. Texas and Utah prohibit car dealerships from operating over consecutive weekend days. In some cases these laws were created or retained with the support of those whom they affected, to allow them a day off each week without fear of their competitors still being open.
question: can you buy a car in wisconsin on sunday?

SOLUTION: No

PROBLEM: passage: The rules for the high jump are set internationally by the International Association of Athletics Federations (IAAF). Jumpers must take off on one foot. A jump is considered a failure if the bar is dislodged by the action of the jumper whilst jumping or the jumper touches the ground or breaks the plane of the near edge of the bar before clearance. The technique one uses for the jump must be almost flawless in order to have a chance of clearing a high bar.
question: can you jump off 2 feet in high jump?

SOLUTION: No

PROBLEM: passage: A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed, otherwise it is open.
question: is it possible for a knight on a chessboard to visit every square once and exactly once?

SOLUTION:
Yes