letters stringlengths 6 6 | answer stringlengths 3 6 | all_best listlengths 1 9 | length int64 3 6 | letters_length int64 6 6 | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
mrtuob | rumbo | [
"rumbo",
"tumor",
"turbo"
] | 5 | 6 | [
{
"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: ['m', 'r', 't', 'u', 'o', 'b']. We need to form the longest possible word using these letters without repeating any letter.\n\nFirst, let’s try combining some of the letters together:\n\n- m + r = mr\n- m + t = mt\n- m + u = mu\n- m + o = mo\n- m + b = mb\n\nNon... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48647",
"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: ['m', 'r', 't', 'u', 'o', 'b']\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
] | [
"impossible",
"No viable word found",
"motorbike",
"mother",
"mountaub",
"umbrella",
"No valid word can be formed.",
"No such word exists"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "impossible",
"span_end": 2914,
"span_start": 2904,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "No viable word found",
"span_end": 2672,
... | [
{
"details": "{'letters': 'mrtuob', 'length': 10}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "impossible",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'let... | [
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false
],
[
false,
false
],
[
false,
false
]
] | [
[
"impossible",
"impossible"
],
[
"No viable word found",
"No viable word found"
],
[
"motorbike",
"motorbike"
],
[
"mother",
"mother"
],
[
"mountaub",
"mountaub"
],
[
"umbrella"
],
[
"No valid word can be formed.",
"No valid word can be fo... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "impossible",
"pattern_used": "answer tag",
"position": 2133,
"span_end": 2143,
"span_start": 2133,
"span_text": "impossible"
},
{
"confidence": 1,
"extraction_type": "interna... | [
[
{
"details": "{'letters': 'mrtuob', 'length': 10}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "impossible",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'mrtuob', 'length': 10}",
"errors": [
... | {
"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,
0,
0,
0,
0,
1,
0
],
"reflect_close": [
0,
0,
0,
0,
0,
0,
1,
0
],
"reflect_open": [
0,
0,
0,
0,
0,
0,
1,
0
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
0,
0,
0,
0,
0,
0,
1,
0
],
"sample_open": [
0,
0,
0,
0,
0,
0,
2,
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
} |
gaoqce | cage | [
"cage"
] | 4 | 6 | [
{
"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 ['g', 'a', 'o', 'q', 'c', 'e'], we need to consider all combinations of these letters and see which ones form meaningful words.\n\nFirst, let's try different combinations:\n\n1. **gaoc**: This doesn't form a valid word.\n2. **g... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48647",
"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: ['g', 'a', 'o', 'q', 'c', 'e']\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
] | [
"game",
"goal",
null,
"goa",
"No such word exists.",
"goccce",
"queue",
"no such word exists"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 6,
"original_span": "game",
"span_end": 13239,
"span_start": 13233,
"total_spans_found": 6
},
{
"extraction_type": "final",
"non_overlapping_spans": 9,
"original_span": "goal",
"span_end": 11976,
"span_start": 119... | [
{
"details": "{'letters': 'gaoqce', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "game",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': ... | [
[
false,
false,
false,
false,
false,
false
],
[
false,
false,
true,
false,
false,
false,
false,
false,
false
],
[],
[
true,
true
],
[
false,
false
],
[
false,
false
],
[
false
],
[
false,
false
... | [
[
"game",
"game",
"game",
"game",
"game",
"game"
],
[
"goal",
"goal",
"Geo",
"goal",
"goal",
"goal",
"goal",
"goal",
"goal"
],
[],
[
"goa",
"goa"
],
[
"No such word exists.",
"No such word exists."
],
[
"goccce",
"... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "game",
"pattern_used": "answer tag",
"position": 6358,
"span_end": 6364,
"span_start": 6358,
"span_text": "game"
},
{
"confidence": 1,
"extraction_type": "internal",
"o... | [
[
{
"details": "{'letters': 'gaoqce', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "game",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'gaoqce', 'length': 4}",
"errors": [
"cann... | {
"flips_by": [
0,
1,
0,
0,
0,
0,
0,
0
],
"flips_total": 1,
"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,
1,
0,
0,
0,
0,
0,
0
],
"reflect_close": [
0,
1,
0,
0,
0,
0,
0,
0
],
"reflect_open": [
1,
2,
0,
0,
0,
0,
0,
0
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
1,
2,
0,
0,
0,
0,
0,
0
],
"sample_open": [
1,
2,
0,
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
} |
ylfufi | iffy | [
"iffy",
"luff",
"uily"
] | 4 | 6 | [
{
"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, we need to consider all combinations of these letters and see which ones form words that follow any rules or constraints typically associated with forming English words (like being pronounceable).\n\nHere’s how I would approac... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48647",
"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: ['y', 'l', 'f', 'u', 'f', 'i']\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
} | [
true,
false,
true,
true,
false,
false,
true,
false
] | [
"fly",
"flyby",
"fly",
"fly",
"yield fly",
"fluffy",
"fly",
"fulyi"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "fly",
"span_end": 1710,
"span_start": 1705,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "flyby",
"span_end": 1952,
"span_start": 1945,
... | [
{
"details": "{'letters': 'ylfufi', 'length': 3}",
"errors": [],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "fly",
"is_correct": true,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'ylfufi', 'length': 5}",
"errors": [
... | [
[
true
],
[
false,
false
],
[
true,
true
],
[
true,
true
],
[
false,
false
],
[
false,
false
],
[
true,
false,
true,
true
],
[
false,
false
]
] | [
[
"fly"
],
[
"flyby",
"flyby"
],
[
"fly",
"fly"
],
[
"fly",
"fly"
],
[
"yield fly",
"yield fly"
],
[
"fluffy",
"fluffy"
],
[
"fly",
"None of the provided letters form a valid English word when combined.",
"fly",
"fly"
],
[
"... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "fly",
"pattern_used": "answer tag",
"position": 1705,
"span_end": 1710,
"span_start": 1705,
"span_text": "fly"
}
],
[
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'ylfufi', 'length': 3}",
"errors": [],
"final_answer": "fly",
"is_correct": true,
"target_matches": false
}
],
[
{
"details": "{'letters': 'ylfufi', 'length': 5}",
"errors": [
"cannot_be_formed_from_letters"
],
... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
1,
0
],
"flips_total": 1,
"num_correct": 4,
"pass_at_n": 1,
"percent_correct": 0.5,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
1,
0,
0,
0,
0,
0,
2,
0
],
"reflect_close": [
1,
0,
0,
0,
0,
0,
2,
0
],
"reflect_open": [
1,
0,
0,
0,
0,
0,
2,
0
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
1,
0,
0,
0,
0,
0,
2,
0
],
"sample_open": [
2,
0,
0,
0,
0,
0,
3,
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
} |
athtuv | tuath | [
"tuath"
] | 5 | 6 | [{"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 ['a', 't', 'h',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48647","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
] | ["authuthvu",null,"Athtuv","athuv","autumn","No valid word can be created using only the given lette(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"authuthvu","span_end":5191,"s(...TRUNCATED) | [{"details":"{'letters': 'athtuv', 'length': 9}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | [
[
false,
false
],
[],
[
false,
false
],
[
false
],
[
false
],
[
false,
false
],
[
false,
false
],
[
false
]
] | [["authuthvu","authuthvu"],[],["Athtuv","Athtuv"],["athuv"],["autumn"],["No valid word can be create(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"authuthvu","pattern_used":"answer (...TRUNCATED) | [[{"details":"{'letters': 'athtuv', 'length': 9}","errors":["not_a_valid_word","cannot_be_formed_fro(...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) |
awskie | askew | [
"askew",
"kiswa",
"waise",
"wakes",
"wekas"
] | 5 | 6 | [{"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', 'w', 's', 'k', 'i', 'e']. Our goal is t(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48647","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,
"aekis",
"awesome",
null,
"apple",
null,
"aki",
"\"ace\""
] | [{"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,fals(...TRUNCATED) | [[],["aekis","aekis"],["awesome","awesome"],[],["apple","apple","apple","apple","apple","apple","app(...TRUNCATED) | [[],[{"confidence":1.0,"extraction_type":"internal","original_span":"aekis","pattern_used":"answer t(...TRUNCATED) | [[],[{"details":"{'letters': 'awskie', 'length': 5}","errors":["not_a_valid_word"],"final_answer":"a(...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) |
wsuigf | figs | [
"figs",
"fugs",
"sufi",
"sugi",
"swig",
"wigs"
] | 4 | 6 | [{"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 ['w', 's', 'u',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48647","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
] | [
"fish",
"wise guyifies",
"wishful",
null,
"fsuilgf",
null,
"ugifi",
"fugis"
] | [{"extraction_type":"final","non_overlapping_spans":15,"original_span":"fish","span_end":14086,"span(...TRUNCATED) | [{"details":"{'letters': 'wsuigf', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluat(...TRUNCATED) | [[false,false,false,false,false,false,false,false,false,false,false,false,false,false,false],[false,(...TRUNCATED) | [["fish","fish","fish","fish","fish","fish","fish","fish","fish","fish","fish","fish","fish","fish",(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"fish","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'wsuigf', 'length': 4}","errors":["cannot_be_formed_from_letters"],"final_(...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) |
qentur | enrut | [
"enrut",
"quent",
"quern",
"tuner",
"urent"
] | 5 | 6 | [{"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 ['q', 'e', 'n', 't', 'u(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48647","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
] | ["New","No valid word could be formed using the provided letters.","quantumure","quer","qenantur","q(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"New","span_end":1618,"span_st(...TRUNCATED) | [{"details":"{'letters': 'qentur', 'length': 3}","errors":["cannot_be_formed_from_letters"],"evaluat(...TRUNCATED) | [
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false
],
[
false,
false
],
[
false,
false
],
[
false
],
[
false
]
] | [["New","New"],["No valid word could be formed using the provided letters.","No valid word could be (...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"New","pattern_used":"answer tag","(...TRUNCATED) | [[{"details":"{'letters': 'qentur', 'length': 3}","errors":["cannot_be_formed_from_letters"],"final_(...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) |
attxba | batta | [
"batta"
] | 5 | 6 | [{"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 ['a', 't', 't',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48647","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,
false
] | ["bat","atxba","abat","battax","batx","atx","No valid word can be formed using all the letters exact(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"bat","span_end":1958,"span_st(...TRUNCATED) | [{"details":"{'letters': 'attxba', 'length': 3}","errors":[],"evaluation_method":null,"extraction_re(...TRUNCATED) | [[true],[false,false],[false],[false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED) | [["bat"],["atxba","atxba"],["abat"],["battax","battax","battax","battax","battax","battax","battax",(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"bat","pattern_used":"answer tag","(...TRUNCATED) | [[{"details":"{'letters': 'attxba', 'length': 3}","errors":[],"final_answer":"bat","is_correct":true(...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) |
ocrgeu | courge | [
"courge"
] | 6 | 6 | [{"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, we need t(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48647","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,
true,
false
] | [
"greed",
"orange",
"No valid word found.",
null,
"guru",
null,
"ogre",
"ocruge"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"greed","span_end":2079,"span_(...TRUNCATED) | [{"details":"{'letters': 'ocrgeu', 'length': 5}","errors":["cannot_be_formed_from_letters"],"evaluat(...TRUNCATED) | [
[
false
],
[
false
],
[
false,
false
],
[],
[
false,
false
],
[],
[
true,
true
],
[
false,
false
]
] | [["greed"],["orange"],["No valid word found.","No valid word found."],[],["guru","guru"],[],["ogre",(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"greed","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'ocrgeu', 'length': 5}","errors":["cannot_be_formed_from_letters"],"final_(...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) |
uobkax | abox | [
"abox",
"baku",
"bauk",
"bouk",
"kobu",
"kuba"
] | 4 | 6 | [{"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 to see which ones form (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48647","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
] | ["axe",null,"Not Possible","UniversalBasicKnowledgeAccessibleToAllUsers",null,"uobbka","No valid wor(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"axe","span_end":2356,"span_st(...TRUNCATED) | [{"details":"{'letters': 'uobkax', 'length': 3}","errors":["cannot_be_formed_from_letters"],"evaluat(...TRUNCATED) | [
[
false
],
[],
[
false,
false
],
[
false,
false
],
[],
[
false,
false
],
[
false,
false
],
[
false,
false
]
] | [["axe"],[],["Not Possible","Not Possible"],["UniversalBasicKnowledgeAccessibleToAllUsers","Universa(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"axe","pattern_used":"answer tag","(...TRUNCATED) | [[{"details":"{'letters': 'uobkax', 'length': 3}","errors":["cannot_be_formed_from_letters"],"final_(...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) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7