dataset listlengths 1 1 | ground_truth listlengths 1 1 | messages listlengths 1 1 |
|---|---|---|
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 342, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"B#\", \"B#\", \"#B\", \"B#\", \"#B\", \"A#\"], \"reference_answer\": \"A# B# A#\", \"gold_answer\": [\"A#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 343, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"A#\", \"B#\", \"B#\", \"#A\", \"#A\", \"#A\"], \"reference_answer\": \"#A #A B# B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 344, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"#B\", \"B#\", \"#A\", \"A#\", \"#A\"], \"reference_answer\": \"#B #B #B #A B#\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 345, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"A#\", \"A#\", \"#B\", \"A#\", \"A#\", \"#A\"], \"reference_answer\": \"#B #B A# A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 346, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#B\", \"B#\", \"#B\", \"B#\", \"A#\", \"A#\"], \"reference_answer\": \"#B A# B# A# A#\", \"gold_answer\": [\"#B\", \"A#\", \"B#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 347, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"B#\", \"#B\", \"#B\", \"#A\", \"#A\", \"A#\"], \"reference_answer\": \"#B #B #A #A A#\", \"gold_answer\": [\"#B\", \"#B\", \"#A\", \"#A\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 348, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#A\", \"A#\", \"B#\", \"A#\", \"#A\", \"B#\"], \"reference_answer\": \"A# B# B#\", \"gold_answer\": [\"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 349, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"B#\", \"B#\", \"#A\", \"#A\", \"#A\", \"A#\"], \"reference_answer\": \"#A #A #A B# B# B# A#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\", \"B#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 350, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#B\", \"#A\"], \"reference_answer\": \"#B #A #A #A #B #B #A\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 351, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"A#\", \"#B\", \"A#\", \"#A\", \"A#\", \"#A\"], \"reference_answer\": \"#B A# A#\", \"gold_answer\": [\"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 352, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#A\", \"B#\", \"A#\", \"A#\", \"B#\", \"B#\"], \"reference_answer\": \"#A B# B# A# A# B# B#\", \"gold_answer\": [\"#A\", \"B#\", \"B#\", \"A#\", \"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 353, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"B#\", \"#A\", \"#B\", \"B#\", \"#B\"], \"reference_answer\": \"#B #B #A\", \"gold_answer\": [\"#B\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 354, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#B\", \"#B\", \"A#\", \"#A\", \"#A\", \"#B\"], \"reference_answer\": \"#B #B #B\", \"gold_answer\": [\"#B\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 355, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"A#\", \"B#\", \"B#\", \"A#\", \"#B\", \"B#\"], \"reference_answer\": \"B# A# B# A# B#\", \"gold_answer\": [\"B#\", \"A#\", \"B#\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 356, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"B#\", \"B#\", \"B#\", \"A#\", \"#A\", \"B#\"], \"reference_answer\": \"A# B# B# B# B#\", \"gold_answer\": [\"A#\", \"B#\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 357, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#A\", \"A#\", \"B#\", \"B#\", \"B#\", \"B#\"], \"reference_answer\": \"A# B# B# B# B#\", \"gold_answer\": [\"A#\", \"B#\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 358, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"A#\", \"A#\", \"B#\", \"A#\", \"A#\"], \"reference_answer\": \"#B #B A# A# B# A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"A#\", \"B#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 359, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"B#\", \"#B\", \"#B\", \"B#\", \"#B\", \"#A\"], \"reference_answer\": \"#A\", \"gold_answer\": [\"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"wro... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 360, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#A\", \"A#\", \"#B\", \"A#\", \"#B\", \"A#\"], \"reference_answer\": \"#B #B A# A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 361, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"B#\", \"A#\", \"B#\", \"#B\", \"B#\", \"B#\"], \"reference_answer\": \"B# B# A# B# B#\", \"gold_answer\": [\"B#\", \"B#\", \"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 362, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"#A\", \"#A\", \"B#\", \"B#\", \"#B\"], \"reference_answer\": \"#B #B #A #A B#\", \"gold_answer\": [\"#B\", \"#B\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 363, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"A#\", \"A#\", \"B#\", \"#A\", \"B#\", \"A#\"], \"reference_answer\": \"B# A# B# B# A#\", \"gold_answer\": [\"B#\", \"A#\", \"B#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 364, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"A#\", \"A#\", \"A#\", \"B#\", \"A#\"], \"reference_answer\": \"#B #B A# A# A# B# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"A#\", \"A#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 365, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"B#\", \"B#\", \"B#\", \"B#\", \"A#\", \"A#\"], \"reference_answer\": \"A# B# B# B# B# A# A#\", \"gold_answer\": [\"A#\", \"B#\", \"B#\", \"B#\", \"B#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 366, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"B#\", \"#B\", \"B#\", \"#A\", \"#B\", \"#A\"], \"reference_answer\": \"#A #A #A\", \"gold_answer\": [\"#A\", \"#A\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 367, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#B\", \"#B\", \"A#\", \"#A\", \"#B\", \"B#\"], \"reference_answer\": \"#B #B #B A# B#\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 368, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#A\", \"#A\", \"#A\", \"#A\", \"A#\", \"B#\"], \"reference_answer\": \"#A #A #A A# B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 369, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"A#\", \"A#\", \"#A\", \"B#\", \"B#\", \"#B\"], \"reference_answer\": \"#B A# B#\", \"gold_answer\": [\"#B\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 370, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"B#\", \"B#\", \"#A\", \"B#\", \"#A\", \"#B\"], \"reference_answer\": \"#A #A #A B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 371, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#B\", \"#B\", \"#A\", \"#B\", \"#B\", \"A#\"], \"reference_answer\": \"#B #A #B #B A#\", \"gold_answer\": [\"#B\", \"#A\", \"#B\", \"#B\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 372, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#A\", \"#A\", \"#B\", \"B#\", \"B#\", \"#A\"], \"reference_answer\": \"#A #A #A B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 373, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"B#\", \"#B\", \"#B\", \"B#\", \"#B\"], \"reference_answer\": \"#B #B #B\", \"gold_answer\": [\"#B\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 374, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"A#\", \"#B\", \"#B\", \"B#\", \"#A\", \"B#\"], \"reference_answer\": \"#B #B #B B# B#\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 375, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#B\", \"#A\", \"B#\", \"#B\", \"#B\", \"#B\"], \"reference_answer\": \"#A #B #B\", \"gold_answer\": [\"#A\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 376, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"A#\", \"#A\", \"#A\", \"A#\", \"A#\", \"#A\"], \"reference_answer\": \"#A #A A#\", \"gold_answer\": [\"#A\", \"#A\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 377, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"A#\", \"#B\", \"#B\", \"#A\", \"#A\", \"#B\"], \"reference_answer\": \"#B #B #B #A #B\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"#A\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 378, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#A\", \"#B\", \"B#\", \"A#\", \"#B\", \"#A\"], \"reference_answer\": \"#A\", \"gold_answer\": [\"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"wro... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 379, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"#B\", \"#B\", \"#B\", \"#B\", \"#B\"], \"reference_answer\": \"#B #B #B #B #B #B #B\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"#B\", \"#B\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 380, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#B\", \"#B\", \"#A\", \"B#\", \"#A\", \"B#\"], \"reference_answer\": \"#B #A #A B# B#\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 381, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"A#\", \"B#\", \"B#\", \"B#\", \"B#\", \"B#\"], \"reference_answer\": \"A# A# B# B# B# B# B#\", \"gold_answer\": [\"A#\", \"A#\", \"B#\", \"B#\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 382, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"#B\", \"#A\", \"#B\", \"B#\", \"#B\", \"#A\"], \"reference_answer\": \"#A #B #A #B #A\", \"gold_answer\": [\"#A\", \"#B\", \"#A\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 383, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#A\", \"B#\", \"#B\", \"#A\", \"A#\", \"#B\"], \"reference_answer\": \"#A #B A#\", \"gold_answer\": [\"#A\", \"#B\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 384, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"B#\", \"B#\", \"#B\", \"#A\", \"#A\", \"A#\"], \"reference_answer\": \"#A #A B# B# A#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 385, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"A#\", \"#A\", \"B#\", \"#B\", \"#A\", \"#B\"], \"reference_answer\": \"#A\", \"gold_answer\": [\"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"wro... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 386, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#A\", \"#B\", \"A#\", \"#B\", \"A#\", \"#B\"], \"reference_answer\": \"#A #B #B A# A#\", \"gold_answer\": [\"#A\", \"#B\", \"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 387, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"A#\", \"#A\", \"#B\", \"#B\", \"#B\", \"A#\"], \"reference_answer\": \"#B #B #B A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 388, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#B\", \"B#\", \"#A\", \"A#\", \"A#\", \"A#\"], \"reference_answer\": \"#A B# A# A# A#\", \"gold_answer\": [\"#A\", \"B#\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 389, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#A\", \"A#\", \"B#\", \"#A\", \"#A\", \"B#\"], \"reference_answer\": \"#B #A #A B# B#\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 390, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#A\", \"#A\", \"#A\", \"A#\", \"#A\", \"A#\"], \"reference_answer\": \"#B #A #A #A A#\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"#A\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 391, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"#B\", \"A#\", \"B#\", \"#B\", \"#B\", \"B#\"], \"reference_answer\": \"#A #B #B A# B#\", \"gold_answer\": [\"#A\", \"#B\", \"#B\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 392, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"B#\", \"#A\", \"#A\", \"B#\", \"#B\"], \"reference_answer\": \"#B #B #A #A B#\", \"gold_answer\": [\"#B\", \"#B\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 393, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#A\", \"#A\", \"A#\", \"A#\", \"#B\", \"A#\"], \"reference_answer\": \"#B #A #A #B A# A# A#\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"#B\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 394, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"A#\", \"B#\", \"#A\", \"#B\", \"#B\", \"#B\"], \"reference_answer\": \"#A #B #B\", \"gold_answer\": [\"#A\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 395, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#A\"], \"reference_answer\": \"#B #B #A #A #A #B #A\", \"gold_answer\": [\"#B\", \"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 396, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#A\", \"B#\", \"B#\", \"#B\", \"#A\", \"B#\"], \"reference_answer\": \"#A #A B# B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 397, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"A#\", \"B#\", \"#B\", \"B#\", \"B#\", \"#A\"], \"reference_answer\": \"#B B# B#\", \"gold_answer\": [\"#B\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 398, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"#A\", \"A#\", \"A#\", \"#A\", \"#B\", \"#B\"], \"reference_answer\": \"#A #A #B #B A#\", \"gold_answer\": [\"#A\", \"#A\", \"#B\", \"#B\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 399, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"B#\", \"#A\", \"#A\", \"A#\", \"A#\", \"B#\"], \"reference_answer\": \"#A B# A# A# B#\", \"gold_answer\": [\"#A\", \"B#\", \"A#\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 400, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"B#\", \"#B\", \"B#\", \"#B\", \"#B\", \"B#\"], \"reference_answer\": \"#B #B B#\", \"gold_answer\": [\"#B\", \"#B\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 401, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"#B\", \"B#\", \"#B\", \"A#\", \"#B\"], \"reference_answer\": \"#B #B #B #B A#\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"#B\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 402, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#A\", \"#A\", \"#A\", \"#A\", \"#B\", \"#B\"], \"reference_answer\": \"#A #A #A #A #B\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"#A\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 403, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"B#\", \"#B\", \"B#\", \"#A\", \"#B\", \"B#\"], \"reference_answer\": \"#A B# B#\", \"gold_answer\": [\"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 404, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#B\"], \"reference_answer\": \"#A #B #A #A #A #B #B\", \"gold_answer\": [\"#A\", \"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 405, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#A\", \"#B\", \"B#\", \"B#\", \"#B\", \"#B\"], \"reference_answer\": \"#A\", \"gold_answer\": [\"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"wro... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 406, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"B#\", \"A#\", \"A#\", \"#B\", \"#B\", \"A#\"], \"reference_answer\": \"A# A# A#\", \"gold_answer\": [\"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 407, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#A\", \"#A\", \"#B\", \"#B\", \"#A\", \"A#\"], \"reference_answer\": \"#B #A #A #B #B #A A#\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"#B\", \"#B\", \"#A\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 408, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"A#\", \"#A\", \"#A\", \"A#\", \"A#\", \"B#\"], \"reference_answer\": \"#B #A A# A# B#\", \"gold_answer\": [\"#B\", \"#A\", \"A#\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 409, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#B\", \"B#\", \"#A\", \"#B\", \"B#\", \"A#\"], \"reference_answer\": \"#B B# A#\", \"gold_answer\": [\"#B\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 410, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"A#\", \"#A\", \"B#\", \"#A\", \"#A\", \"#A\"], \"reference_answer\": \"#A #A #A B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 411, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"A#\", \"#B\", \"B#\", \"A#\", \"A#\", \"#B\"], \"reference_answer\": \"A# A# A#\", \"gold_answer\": [\"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 412, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#B\", \"A#\", \"#A\", \"#A\", \"B#\", \"A#\"], \"reference_answer\": \"#B B# A#\", \"gold_answer\": [\"#B\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 413, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"A#\", \"B#\", \"#A\", \"B#\", \"A#\", \"#B\"], \"reference_answer\": \"#A B# A#\", \"gold_answer\": [\"#A\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 414, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"#A\", \"#A\", \"A#\", \"#A\", \"B#\"], \"reference_answer\": \"#B #B #A #A B#\", \"gold_answer\": [\"#B\", \"#B\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 415, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"A#\", \"B#\", \"#B\", \"A#\", \"B#\", \"#B\"], \"reference_answer\": \"A# A# A#\", \"gold_answer\": [\"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 416, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"B#\", \"#B\", \"#A\", \"#A\", \"#B\", \"#A\"], \"reference_answer\": \"#A #A #A #B #A\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 417, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"B#\", \"#A\", \"#B\", \"#A\", \"B#\", \"A#\"], \"reference_answer\": \"#A B# A#\", \"gold_answer\": [\"#A\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 418, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"B#\", \"A#\", \"#B\", \"A#\", \"#A\", \"#B\"], \"reference_answer\": \"#B A# A#\", \"gold_answer\": [\"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 419, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#A\", \"B#\", \"A#\", \"A#\", \"B#\", \"#B\"], \"reference_answer\": \"B# A# A#\", \"gold_answer\": [\"B#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 420, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"#A\", \"B#\", \"B#\", \"A#\", \"#A\", \"#B\"], \"reference_answer\": \"#A #A B#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 421, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#A\", \"B#\"], \"reference_answer\": \"#B #A #A #A #B #A B#\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 422, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#A\", \"#A\", \"A#\", \"A#\", \"#B\", \"#B\"], \"reference_answer\": \"#B #A #A #B #B A# A#\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"#B\", \"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 423, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"#B\", \"#B\", \"B#\", \"B#\", \"#A\"], \"reference_answer\": \"#B #B #B #B #A B# B#\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"#B\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 424, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"A#\", \"B#\", \"B#\", \"A#\", \"A#\", \"#B\"], \"reference_answer\": \"B# A# B# A# A#\", \"gold_answer\": [\"B#\", \"A#\", \"B#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 425, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#B\", \"#B\", \"B#\", \"B#\", \"#B\", \"A#\"], \"reference_answer\": \"#B #B A# B# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 426, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"#A\", \"#B\", \"B#\", \"#B\", \"B#\", \"#B\"], \"reference_answer\": \"#A\", \"gold_answer\": [\"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"wro... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 427, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"A#\", \"#A\", \"B#\", \"#B\", \"B#\", \"B#\"], \"reference_answer\": \"#B B# B#\", \"gold_answer\": [\"#B\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 428, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"#B\", \"#A\", \"#A\", \"A#\", \"#A\", \"A#\"], \"reference_answer\": \"#A #B #A #A A#\", \"gold_answer\": [\"#A\", \"#B\", \"#A\", \"#A\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 429, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"A#\", \"A#\", \"#B\", \"A#\", \"#B\", \"#A\"], \"reference_answer\": \"#B #B A# A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 430, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"A#\", \"#A\", \"B#\", \"B#\", \"A#\", \"A#\"], \"reference_answer\": \"A# B# B# A# A#\", \"gold_answer\": [\"A#\", \"B#\", \"B#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 431, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"A#\", \"#A\", \"A#\", \"#A\", \"#A\", \"#A\"], \"reference_answer\": \"#B #A #A\", \"gold_answer\": [\"#B\", \"#A\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 432, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"B#\", \"#A\", \"B#\", \"A#\", \"B#\", \"B#\"], \"reference_answer\": \"B# B# A# B# B#\", \"gold_answer\": [\"B#\", \"B#\", \"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 433, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"B#\", \"B#\", \"#B\", \"B#\", \"A#\", \"#A\"], \"reference_answer\": \"A# B# B#\", \"gold_answer\": [\"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 434, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"B#\", \"B#\", \"A#\", \"B#\", \"B#\", \"A#\", \"B#\"], \"reference_answer\": \"B# B# A# B# B# A# B#\", \"gold_answer\": [\"B#\", \"B#\", \"A#\", \"B#\", \"B#\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 435, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"A#\", \"#A\", \"B#\", \"B#\", \"A#\", \"#B\"], \"reference_answer\": \"#A B# A#\", \"gold_answer\": [\"#A\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 436, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"#B\", \"#A\", \"B#\", \"#A\", \"B#\", \"B#\"], \"reference_answer\": \"#A #B #A #A B# B# B#\", \"gold_answer\": [\"#A\", \"#B\", \"#A\", \"#A\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 437, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"A#\", \"#B\", \"#A\", \"#B\", \"#A\", \"#A\"], \"reference_answer\": \"#B #B #A\", \"gold_answer\": [\"#B\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 438, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#B\", \"#A\", \"B#\", \"A#\", \"A#\", \"#A\"], \"reference_answer\": \"#B #B #A B# A#\", \"gold_answer\": [\"#B\", \"#B\", \"#A\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 439, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"A#\", \"#B\", \"#B\", \"B#\", \"#A\", \"#A\", \"#B\"], \"reference_answer\": \"#B #B #A\", \"gold_answer\": [\"#B\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 440, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#A\", \"#A\", \"#A\", \"A#\", \"B#\", \"#B\", \"#B\"], \"reference_answer\": \"#A #A #A #B A#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"#B\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 441, \"parameter\": {\"N\": 7, \"max_steps\": 16, \"program\": [\"#B\", \"#A\", \"#B\", \"#A\", \"#B\", \"#B\", \"B#\"], \"reference_answer\": \"#B #A #B #A #B #B B#\", \"gold_answer\": [\"#B\", \"#A\", \"#B\", \"#A\", \"#B\", \"#B\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</... | [
{
"content": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens, e.g., `B# A# #B #A B#`.\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules (whenever two neighbor tokens have their `#` facing each-other, they must be rewritten accordin... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.