Q: Foods that are claimed to be negative in calories are mostly low-calorie fruits and vegetables such as celery, grapefruit, lemon, lime, apple, lettuce, broccoli, and cabbage. There is no scientific evidence to show that any of these foods have a negative calorific impact. Celery has a thermic effect of around 8%, much less than the 100% or more required for a food to have ''negative calories''. A stalk of celery provides 6 calories to the body, but the body expends only half of a calorie digesting it. Even proteins, which require the most energy to digest, have a thermic energy of only 20%--30%.
Can we conclude that is it true that celery has negative calories?
A: no

Q: The eligible age-range for contestants was fifteen to twenty-eight years old. The initial age limit was sixteen to twenty-four in the first three seasons, but the upper limit was raised to twenty-eight in season four, and the lower limit was reduced to fifteen in season ten. The contestants had to be legal U.S. residents, could not have advanced to particular stages of the competition in previous seasons, and must not have held a current recording or talent representation contract by the semi-final stage (in previous years by the audition stage).
Can we conclude that is there a age limit for american idol?
A: yes

Q: Pies are defined by their crusts. A filled pie (also single-crust or bottom-crust), has pastry lining the baking dish, and the filling is placed on top of the pastry but left open. A top-crust pie has the filling in the bottom of the dish and is covered with a pastry or other covering before baking. A two-crust pie has the filling completely enclosed in the pastry shell. Shortcrust pastry is a typical kind of pastry used for pie crusts, but many things can be used, including baking powder biscuits, mashed potatoes, and crumbs.
Can we conclude that does a pie have to have a base?
A: no

Q: In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to describe certain types of decision problems. Informally, NP is the set of all decision problems for which the instances where the answer is ''yes'' have efficiently verifiable proofs. More precisely, these proofs have to be verifiable by deterministic computations that can be performed in polynomial time.
Can we conclude that can np problems be solved in polynomial time?
A:
yes