index stringlengths 23 31 | question stringlengths 419 5.73k | prompt_5shot stringlengths 3.35k 38.3k | answer stringlengths 47 1.29k | pred_5shot_pro stringlengths 48 2.47k | reply stringlengths 243 4.89k | input_ids sequencelengths 505 2.99k | claims listlengths 2 100 | verified sequencelengths 2 100 | informativeness sequencelengths 2 100 | uncertainty_labels sequencelengths 76 1.02k | informativeness_labels sequencelengths 76 1.02k |
|---|---|---|---|---|---|---|---|---|---|---|---|
meeting_planning_example_535 | You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the problem by considering various different schedules and picking the best one to optimize your goals.
Travel distances (in minutes):
Chinatown to Marina District: 12.
Chinatown to Embarcadero: 5.
Chinatown to Fisherman's W... | You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the problem by considering various different schedules and picking the best one to optimize your goals.
Travel distances (in minutes):
Richmond District to Presidio: 7.
Richmond District to Haight-Ashbury: 10.
Richmond Distr... | 1. You start at Chinatown at 9:00AM.
2. You travel to Embarcadero in 5 minutes and arrive at 9:05AM.
3. You wait until 11:30AM.
4. You meet Jeffrey for 30 minutes from 11:30AM to 12:00PM.
5. You travel to Fisherman's Wharf in 6 minutes and arrive at 12:06PM.
6. You meet Betty for 105 minutes from 12:06PM to 1:51PM.
7. ... | SOLUTION:You start at Chinatown at 9:00AM. You travel to Alamo Square in 17 minutes and arrive at 9:17AM. You wait until 9:30AM. You meet Joseph for 30 minutes from 9:30AM to 10:00AM. You travel to Embarcadero in 17 minutes and arrive at 10:17AM. You wait until 11:30AM. You meet Jeffrey for 30 minutes from 11:30AM to 1... | - Step 1: The earliest time to start is 9:00AM at Chinatown
- Step 2: To meet Betty for 105 minutes, need to arrive by 8:00AM + 105 minutes = 9:45AM at Fisherman's Wharf
- Step 3: Travel from Chinatown to Fisherman's Wharf takes 8 minutes so arrival at Fisherman's Wharf would be 9:08AM
- Step 4: To meet Betty for 105 m... | [
151644,
872,
198,
2610,
686,
387,
10449,
448,
264,
366,
14582,
14276,
13235,
8241,
279,
508,
16141,
1125,
498,
1265,
1156,
1744,
323,
3119,
3019,
14319,
29208,
15516,
382,
7771,
2033,
3561,
510,
27,
2468,
315,
2033,
397,
25139,
287,
398... | [
{
"aligned_token_ids": [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20
],
"claim_text": "- Step 1: The earliest time to start is 9:00AM at Chinatown",
... | [
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
1,
1,
1,
1,
1
] | [
0,
1,
0,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
0,
1,
1,
0,
1,
1,
null
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
meeting_planning_example_535 | You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the problem by considering various different schedules and picking the best one to optimize your goals.
Travel distances (in minutes):
Chinatown to Marina District: 12.
Chinatown to Embarcadero: 5.
Chinatown to Fisherman's W... | You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the problem by considering various different schedules and picking the best one to optimize your goals.
Travel distances (in minutes):
Richmond District to Presidio: 7.
Richmond District to Haight-Ashbury: 10.
Richmond Distr... | 1. You start at Chinatown at 9:00AM.
2. You travel to Embarcadero in 5 minutes and arrive at 9:05AM.
3. You wait until 11:30AM.
4. You meet Jeffrey for 30 minutes from 11:30AM to 12:00PM.
5. You travel to Fisherman's Wharf in 6 minutes and arrive at 12:06PM.
6. You meet Betty for 105 minutes from 12:06PM to 1:51PM.
7. ... | SOLUTION:You start at Chinatown at 9:00AM. You travel to Alamo Square in 17 minutes and arrive at 9:17AM. You wait until 9:30AM. You meet Joseph for 30 minutes from 9:30AM to 10:00AM. You travel to Embarcadero in 17 minutes and arrive at 10:17AM. You wait until 11:30AM. You meet Jeffrey for 30 minutes from 11:30AM to 1... | - Step 1: Start at Chinatown at 9:00AM and consider meeting Betty first since she is available from 8:00AM to 7:00PM and requires 105 minutes to meet.
- Step 2: Travel from Chinatown to Fisherman's Wharf takes 8 minutes, arriving at 9:08AM, which is within Betty's availability.
- Step 3: Meet Betty for 105 minutes, end... | [
151644,
872,
198,
2610,
686,
387,
10449,
448,
264,
366,
14582,
14276,
13235,
8241,
279,
508,
16141,
1125,
498,
1265,
1156,
1744,
323,
3119,
3019,
14319,
29208,
15516,
382,
7771,
2033,
3561,
510,
27,
2468,
315,
2033,
397,
25139,
287,
398... | [
{
"aligned_token_ids": [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
2... | [
0,
0,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
0,
0,
0,
0,
0,
0,
1,
1,
0,
0,
0,
0,
1,
null
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
meeting_planning_example_535 | You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the problem by considering various different schedules and picking the best one to optimize your goals.
Travel distances (in minutes):
Chinatown to Marina District: 12.
Chinatown to Embarcadero: 5.
Chinatown to Fisherman's W... | You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the problem by considering various different schedules and picking the best one to optimize your goals.
Travel distances (in minutes):
Richmond District to Presidio: 7.
Richmond District to Haight-Ashbury: 10.
Richmond Distr... | 1. You start at Chinatown at 9:00AM.
2. You travel to Embarcadero in 5 minutes and arrive at 9:05AM.
3. You wait until 11:30AM.
4. You meet Jeffrey for 30 minutes from 11:30AM to 12:00PM.
5. You travel to Fisherman's Wharf in 6 minutes and arrive at 12:06PM.
6. You meet Betty for 105 minutes from 12:06PM to 1:51PM.
7. ... | SOLUTION:You start at Chinatown at 9:00AM. You travel to Alamo Square in 17 minutes and arrive at 9:17AM. You wait until 9:30AM. You meet Joseph for 30 minutes from 9:30AM to 10:00AM. You travel to Embarcadero in 17 minutes and arrive at 10:17AM. You wait until 11:30AM. You meet Jeffrey for 30 minutes from 11:30AM to 1... | - Step 1: Start at Chinatown at 9:00AM and consider visiting Betty first since she is available from 8:00AM to 7:00PM with a long meeting time.
- Step 2: Travel from Chinatown to Fisherman's Wharf takes 8 minutes, arriving at 9:08AM, which is within Betty's availability.
- Step 3: Spend 105 minutes with Betty, leaving ... | [
151644,
872,
198,
2610,
686,
387,
10449,
448,
264,
366,
14582,
14276,
13235,
8241,
279,
508,
16141,
1125,
498,
1265,
1156,
1744,
323,
3119,
3019,
14319,
29208,
15516,
382,
7771,
2033,
3561,
510,
27,
2468,
315,
2033,
397,
25139,
287,
398... | [
{
"aligned_token_ids": [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
2... | [
0,
0,
1,
1,
1,
1,
1,
0,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
0,
0,
1,
0,
0,
0,
1,
0,
1,
null
] | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
meeting_planning_example_695 | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "1. You start at Bayview at 9:00AM.\n2. You travel to Nob Hill in 20 minutes and arrive at 9:20AM.\n(...TRUNCATED) | "SOLUTION:You start at Bayview at 9:00AM. You travel to Presidio in 31 minutes and arrive at 9:31AM.(...TRUNCATED) | "- Step 1: The earliest time to start is 9:00AM at Bayview\n- Step 2: To meet Paul at Nob Hill from (...TRUNCATED) | [151644,872,198,2610,686,387,10449,448,264,366,14582,14276,13235,8241,279,508,16141,1125,498,1265,11(...TRUNCATED) | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],"claim_text":"- Step 1:(...TRUNCATED) | [
0,
1,
1,
1,
1,
1,
0,
1,
1
] | [
0,
1,
1,
1,
1,
1,
1,
1,
null
] | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0(...TRUNCATED) | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0(...TRUNCATED) |
meeting_planning_example_695 | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "1. You start at Bayview at 9:00AM.\n2. You travel to Nob Hill in 20 minutes and arrive at 9:20AM.\n(...TRUNCATED) | "SOLUTION:You start at Bayview at 9:00AM. You travel to Presidio in 31 minutes and arrive at 9:31AM.(...TRUNCATED) | "- Step 1: Start at Bayview at 9:00AM and consider the earliest possible time to visit each friend b(...TRUNCATED) | [151644,872,198,2610,686,387,10449,448,264,366,14582,14276,13235,8241,279,508,16141,1125,498,1265,11(...TRUNCATED) | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,(...TRUNCATED) | [
0,
0,
0,
0,
0,
1,
1
] | [
0,
1,
1,
1,
1,
0,
null
] | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) |
meeting_planning_example_695 | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "1. You start at Bayview at 9:00AM.\n2. You travel to Nob Hill in 20 minutes and arrive at 9:20AM.\n(...TRUNCATED) | "SOLUTION:You start at Bayview at 9:00AM. You travel to Presidio in 31 minutes and arrive at 9:31AM.(...TRUNCATED) | "- Step 1: Start at Bayview at 9:00AM and calculate the earliest time to reach each friend's locatio(...TRUNCATED) | [151644,872,198,2610,686,387,10449,448,264,366,14582,14276,13235,8241,279,508,16141,1125,498,1265,11(...TRUNCATED) | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,(...TRUNCATED) | [
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
1,
0,
0,
0,
0,
0,
0,
0,
0,
null
] | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | [1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0(...TRUNCATED) |
meeting_planning_example_165 | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "1. You start at Russian Hill at 9:00AM.\n2. You travel to Pacific Heights in 7 minutes and arrive a(...TRUNCATED) | "SOLUTION:You start at Russian Hill at 9:00AM. You travel to Pacific Heights in 7 minutes and arrive(...TRUNCATED) | "- Step 1: The earliest time you can start meeting friends is 9:00AM at Russian Hill\n- Step 2: To m(...TRUNCATED) | [151644,872,198,2610,686,387,10449,448,264,366,14582,14276,13235,8241,279,508,16141,1125,498,1265,11(...TRUNCATED) | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23],"claim_text":"(...TRUNCATED) | [
0,
0,
0,
0,
0,
0,
0,
1,
1,
1,
1
] | [
0,
0,
1,
0,
0,
0,
0,
0,
1,
1,
null
] | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) |
meeting_planning_example_165 | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "1. You start at Russian Hill at 9:00AM.\n2. You travel to Pacific Heights in 7 minutes and arrive a(...TRUNCATED) | "SOLUTION:You start at Russian Hill at 9:00AM. You travel to Pacific Heights in 7 minutes and arrive(...TRUNCATED) | "- The earliest time you can start meeting friends is 9:00AM at Russian Hill.\n- To meet David first(...TRUNCATED) | [151644,872,198,2610,686,387,10449,448,264,366,14582,14276,13235,8241,279,508,16141,1125,498,1265,11(...TRUNCATED) | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19],"claim_text":"- The earlie(...TRUNCATED) | [
0,
0,
0,
1,
0,
0,
0,
0,
0,
1
] | [
0,
0,
0,
1,
0,
1,
1,
0,
0,
null
] | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) |
meeting_planning_example_165 | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "1. You start at Russian Hill at 9:00AM.\n2. You travel to Pacific Heights in 7 minutes and arrive a(...TRUNCATED) | "SOLUTION:You start at Russian Hill at 9:00AM. You travel to Pacific Heights in 7 minutes and arrive(...TRUNCATED) | "- You arrive at Russian Hill at 9:00AM and need to meet both Richard and David with minimum duratio(...TRUNCATED) | [151644,872,198,2610,686,387,10449,448,264,366,14582,14276,13235,8241,279,508,16141,1125,498,1265,11(...TRUNCATED) | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24],"claim_text(...TRUNCATED) | [
0,
1,
1,
0,
0,
1,
1,
1,
1
] | [
0,
0,
0,
0,
1,
0,
0,
1,
null
] | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) |
meeting_planning_example_495 | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "You are visiting San Francisco for the day and want to meet as many friends as possible. Solve the (...TRUNCATED) | "1. You start at Union Square at 9:00AM.\n2. You travel to Presidio in 24 minutes and arrive at 9:24(...TRUNCATED) | "SOLUTION:You start at Union Square at 9:00AM. You travel to Financial District in 9 minutes and arr(...TRUNCATED) | "- Step 1: The earliest time to meet Emily is 12:00PM and the latest is 4:45PM, requiring at least 6(...TRUNCATED) | [151644,872,198,2610,686,387,10449,448,264,366,14582,14276,13235,8241,279,508,16141,1125,498,1265,11(...TRUNCATED) | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,(...TRUNCATED) | [
0,
0,
0,
0,
0,
0,
1,
1,
0,
1,
1,
0,
1,
1,
0,
1,
1,
1
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
null
] | [0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0(...TRUNCATED) | [1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4