letters stringlengths 4 4 | answer stringlengths 2 4 | all_best listlengths 1 8 | length int64 2 4 | letters_length int64 4 4 | prompt listlengths 2 2 | task_source stringclasses 1 value | model_responses__example_annotation listlengths 8 8 | model_responses__example_annotation__finish_reason_length_flags listlengths 8 8 | model_responses__example_annotation__length_partial_responses listlengths 8 8 | prompt__example_annotation__metadata dict | model_responses__example_annotation__metadata dict | model_responses__example_annotation__eval_is_correct listlengths 8 8 | model_responses__example_annotation__eval_extracted_answers listlengths 8 8 | model_responses__example_annotation__eval_extraction_metadata listlengths 8 8 | model_responses__example_annotation__eval_evaluation_metadata listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_is_correct listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_extracted_answers listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_extraction_metadata listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_evaluation_metadata listlengths 8 8 | model_responses__example_annotation__metrics dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
eanw | anew | [
"anew",
"wane",
"wean"
] | 4 | 4 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | letter_countdown | [
"<think>\nLet's start by examining the given letters: ['e', 'a', 'n', 'w']. We need to form the longest possible word using these letters.\n\nFirst, let's try combining them in different orders to see which combination forms the longest word:\n\n1. **ea**n - This doesn't make sense as it lacks a vowel.\n2. **ena** ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:43065",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl",
"prompt": [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.\n\n# Problem\nGiven a list of letters, create the longest possible valid word using only the given letters.\n\nFor examples: if the input letters are: ['f','t','s','r','e','a']; the word is: <answer> faster </answer>\n\nSolve for the following:\nINPUT: ['e', 'a', 'n', 'w']\n\nOnly use the letters in the input to create a word. Do not use additional letters.\n\n\nLet's think step by step.",
"role": "user"
}
]
} | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl",
"n_responses": 8
} | [
false,
false,
true,
false,
false,
false,
false,
false
] | [
"eaawn",
"awake",
"en",
"water",
"None Found",
"No valid word can be formed.",
"earn",
null
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "eaawn",
"span_end": 2719,
"span_start": 2712,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "awake",
"span_end": 2691,
"span_start": 2684... | [
{
"details": "{'letters': 'eanw', 'length': 5}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "eaawn",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
... | [
[
false,
false
],
[
false
],
[
true
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false
],
[]
] | [
[
"eaawn",
"eaawn"
],
[
"awake"
],
[
"en"
],
[
"water",
"water"
],
[
"None Found",
"None Found"
],
[
"No valid word can be formed.",
"No valid word can be formed."
],
[
"earn"
],
[]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "eaawn",
"pattern_used": "answer tag",
"position": 2647,
"span_end": 2654,
"span_start": 2647,
"span_text": "eaawn"
},
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'eanw', 'length': 5}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "eaawn",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'eanw', 'length': 5}",
... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 1,
"pass_at_n": 1,
"percent_correct": 0.125,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0,
0,
0,
0,
0
],
"reflect_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"reflect_open": [
0,
0,
0,
0,
0,
0,
0,
0
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_open": [
0,
0,
0,
0,
0,
0,
0,
1
],
"vote_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"vote_open": [
0,
0,
0,
0,
0,
0,
0,
0
],
"voting": [
0,
0,
0,
0,
0,
0,
0,
0
]
},
"total_responses": 8
} |
opmm | mom | [
"mom",
"mop",
"pom"
] | 3 | 4 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | letter_countdown | [
"<think>\n<sample>\nTo find the longest possible valid word using only the given letters ['o', 'p', 'm', 'm'], we need to consider all combinations of these letters and see which ones form meaningful words.\n\n1. Start by trying different combinations:\n - ommp: This doesn't form a valid word.\n - oomp: This al... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:43065",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl",
"prompt": [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.\n\n# Problem\nGiven a list of letters, create the longest possible valid word using only the given letters.\n\nFor examples: if the input letters are: ['f','t','s','r','e','a']; the word is: <answer> faster </answer>\n\nSolve for the following:\nINPUT: ['o', 'p', 'm', 'm']\n\nOnly use the letters in the input to create a word. Do not use additional letters.\n\n\nLet's think step by step.",
"role": "user"
}
]
} | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl",
"n_responses": 8
} | [
false,
false,
false,
true,
false,
false,
false,
false
] | [
"popmem",
"mother",
null,
"\"pm\"",
"No valid word found",
"None of the above options provide a valid English word.",
"ooompm",
"omponent"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 21,
"original_span": "popmem",
"span_end": 16064,
"span_start": 16056,
"total_spans_found": 21
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "mother",
"span_end": 1736,
"span_start"... | [
{
"details": "{'letters': 'opmm', 'length': 6}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "popmem",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
... | [
[
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
],
[
false,
false
],
[],
[
true
],
[
false,
false
... | [
[
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem",
"popmem"
],
[
"mother"... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "popmem",
"pattern_used": "answer tag",
"position": 857,
"span_end": 865,
"span_start": 857,
"span_text": "popmem"
},
{
"confidence": 1,
"extraction_type": "internal",
"... | [
[
{
"details": "{'letters': 'opmm', 'length': 6}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "popmem",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'opmm', 'length': 6}",
... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 1,
"pass_at_n": 1,
"percent_correct": 0.125,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0,
0,
0,
0,
0
],
"reflect_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"reflect_open": [
1,
0,
0,
0,
0,
0,
0,
0
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
1,
0,
0,
0,
0,
0,
0,
0
],
"sample_open": [
1,
0,
1,
0,
0,
0,
0,
0
],
"vote_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"vote_open": [
0,
0,
0,
0,
0,
0,
0,
0
],
"voting": [
0,
0,
0,
0,
0,
0,
0,
0
]
},
"total_responses": 8
} |
iwhj | hi | [
"hi",
"hw",
"iw",
"ji",
"wh",
"wi"
] | 2 | 4 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | letter_countdown | [
"<think>\nLet's start by trying different combinations of the given letters ['i', 'w', 'h', 'j'] to see if we can form any meaningful words.\nFirst, let's try combining them randomly:\n\n- iwj\n- ihj\n- wih\n\nNone of these look like real words to me. Let's try another approach.\n\nNow, let's try some more systemat... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:43065",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl",
"prompt": [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.\n\n# Problem\nGiven a list of letters, create the longest possible valid word using only the given letters.\n\nFor examples: if the input letters are: ['f','t','s','r','e','a']; the word is: <answer> faster </answer>\n\nSolve for the following:\nINPUT: ['i', 'w', 'h', 'j']\n\nOnly use the letters in the input to create a word. Do not use additional letters.\n\n\nLet's think step by step.",
"role": "user"
}
]
} | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"happy",
"hijack",
"high",
"No valid word found",
"wise",
"ihj",
"No valid word can be formed using the given letters.",
"no word"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "happy",
"span_end": 1681,
"span_start": 1676,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "hijack",
"span_end": 1429,
"span_start": 142... | [
{
"details": "{'letters': 'iwhj', 'length': 5}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "happy",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': '... | [
[
false,
false
],
[
false,
false
],
[
false
],
[
false
],
[
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
false,
fal... | [
[
"happy",
"happy"
],
[
"hijack",
"hijack"
],
[
"high"
],
[
"No valid word found"
],
[
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise",
"wise... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "happy",
"pattern_used": "answer tag",
"position": 1582,
"span_end": 1587,
"span_start": 1582,
"span_text": "happy"
},
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'iwhj', 'length': 5}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "happy",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'iwhj', 'length': 5}",
"errors": [
"cannot_... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 0,
"pass_at_n": 0,
"percent_correct": 0,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
1,
0,
0,
0,
0,
0
],
"reflect_close": [
0,
0,
1,
0,
0,
0,
0,
0
],
"reflect_open": [
0,
0,
1,
0,
1,
0,
0,
0
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
0,
0,
1,
0,
1,
0,
0,
0
],
"sample_open": [
0,
0,
2,
0,
1,
0,
0,
0
],
"vote_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"vote_open": [
0,
0,
0,
0,
0,
0,
0,
0
],
"voting": [
0,
0,
0,
0,
0,
0,
0,
0
]
},
"total_responses": 8
} |
uumf | fum | [
"fum",
"umu"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\nLet's start by analyzing the given input: ['u', 'u', 'm', 'f'].\n\n1. We need to form the(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:43065","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED) | [
false,
false,
false,
true,
false,
false,
false,
false
] | ["umfff","FUNUM","No valid word can be formed.","um","fun","No valid word can be formed.","umfu","No(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"umfff","span_end":1519,"span_(...TRUNCATED) | [{"details":"{'letters': 'uumf', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from_l(...TRUNCATED) | [[false,false],[false,false],[false,false],[true],[false,false],[false],[false,false,false,false,fal(...TRUNCATED) | [["umfff","umfff"],["FUNUM","FUNUM"],["No valid word can be formed.","No valid word can be formed."](...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"umfff","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'uumf', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED) |
oakl | kalo | [
"kalo",
"kola",
"loka"
] | 4 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo find the longest possible valid word using only the given letters ['o', 'a',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:43065","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
true
] | [null,"Unsolvable","olka","okl","oil","It is impossible to create a valid word using the given lette(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":null,"original_span":null,"span_end":null,"span_(...TRUNCATED) | [{"details":null,"errors":null,"evaluation_method":"response_processor","extraction_result":"{'extra(...TRUNCATED) | [[],[false],[false],[false,false,false,false,false,false],[false],[false,false],[false,false,false,f(...TRUNCATED) | [[],["Unsolvable"],["olka"],["lock","lock","lock","okl","okl","okl"],["oil"],["It is impossible to c(...TRUNCATED) | [[],[{"confidence":1.0,"extraction_type":"internal","original_span":"Unsolvable","pattern_used":"ans(...TRUNCATED) | [[],[{"details":"{'letters': 'oakl', 'length': 10}","errors":["cannot_be_formed_from_letters"],"fina(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED) |
avnh | avn | [
"avn",
"han",
"hav",
"nav",
"van"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\nLet's start by examining the given letters: ['a', 'v', 'n', 'h']. We need to form the lon(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:43065","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED) | [
true,
false,
false,
false,
false,
false,
false,
true
] | [
"avn",
"avenh",
"avan",
"vanquish",
"vacation",
"haven",
"No such word exists",
"han"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"avn","span_end":1325,"span_st(...TRUNCATED) | [{"details":"{'letters': 'avnh', 'length': 3}","errors":[],"evaluation_method":null,"extraction_resu(...TRUNCATED) | [[true],[false],[false,false],[false,false],[false,false],[false],[false],[true,true,true,true,true,(...TRUNCATED) | [["avn"],["avenh"],["avan","avan"],["vanquish","vanquish"],["vacation","vacation"],["haven"],["No su(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"avn","pattern_used":"answer tag","(...TRUNCATED) | [[{"details":"{'letters': 'avnh', 'length': 3}","errors":[],"final_answer":"avn","is_correct":true,"(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":2,"pass_at_n":1,"percent_correct":0.25,"(...TRUNCATED) |
ejfh | feh | [
"feh",
"jef"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo find the longest possible valid word using the given letters ['e', 'j', 'f',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:43065","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [null,"No valid word can be formed","None of the above options provide a valid word using the given (...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":null,"original_span":null,"span_end":null,"span_(...TRUNCATED) | [{"details":null,"errors":null,"evaluation_method":"response_processor","extraction_result":"{'extra(...TRUNCATED) | [[],[false,false],[false,false],[false,false],[false,false,false,false,false,false],[false],[false],(...TRUNCATED) | [[],["No valid word can be formed","No valid word can be formed"],["None of the above options provid(...TRUNCATED) | [[],[{"confidence":1.0,"extraction_type":"internal","original_span":"No valid word can be formed","p(...TRUNCATED) | [[],[{"details":"{'letters': 'ejfh', 'length': 22}","errors":["not_a_valid_word","cannot_be_formed_f(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
itzt | tit | [
"tit",
"zit"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\nLet's start by trying different combinations of the given letters ['i', 't', 'z', 't'] to(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:43065","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | ["No valid word can be formed using only the given letters ['i', 't', 'z', 't'].","No valid word can(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"No valid word can be formed u(...TRUNCATED) | [{"details":"{'letters': 'itzt', 'length': 50}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [[false,false],[false,false],[false,false],[false],[false,false],[false,false],[false,false],[false,(...TRUNCATED) | [["No valid word can be formed using only the given letters ['i', 't', 'z', 't'].","No valid word ca(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"No valid word can be formed using (...TRUNCATED) | [[{"details":"{'letters': 'itzt', 'length': 50}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
rwuz | wur | [
"wur"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\nLet's start by trying different combinations of the given letters ['r', 'w', 'u', 'z'] to(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:43065","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | ["roar",null,"no such word exists","No valid word can be formed.","rugged","wurz","None of the above(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"roar","span_end":3411,"span_s(...TRUNCATED) | [{"details":"{'letters': 'rwuz', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluatio(...TRUNCATED) | [
[
false,
false
],
[],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false
]
] | [["roar","roar"],[],["no such word exists","no such word exists"],["No valid word can be formed.","N(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"roar","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'rwuz', 'length': 4}","errors":["cannot_be_formed_from_letters"],"final_an(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
unig | gin | [
"gin",
"gnu",
"gun",
"ign",
"ing",
"nig",
"ung",
"uni"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\nLet's start by trying different combinations of the given letters ['u', 'n', 'i', 'g'] to(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:43065","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED) | [
false,
false,
false,
true,
false,
false,
false,
false
] | ["No valid word can be formed.","No valid word can be formed","gnuin","ung","No valid word","It is i(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"No valid word can be formed."(...TRUNCATED) | [{"details":"{'letters': 'unig', 'length': 22}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [[false,false],[false,false],[false],[true,true],[false,false],[false,false],[false,false,false,fals(...TRUNCATED) | [["Ñugi","No valid word can be formed."],["No valid word can be formed","No valid word can be forme(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"Ñugi","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'unig', 'length': 3}","errors":["not_a_valid_word"],"final_answer":"ugi","(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6