dataset listlengths 1 1 | ground_truth listlengths 1 1 | messages listlengths 1 1 |
|---|---|---|
[
"verifiable_problem_z"
] | [
{
"parameters": "{\"seed\": 242, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#B\", \"B#\", \"#B\", \"A#\", \"#A\"], \"reference_answer\": \"#B #B\", \"gold_answer\": [\"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 243, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"A#\", \"A#\", \"A#\", \"A#\", \"A#\"], \"reference_answer\": \"#A A# A# A# A# A#\", \"gold_answer\": [\"#A\", \"A#\", \"A#\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 244, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"#B\", \"A#\", \"#A\", \"#B\"], \"reference_answer\": \"#A #A #B #B\", \"gold_answer\": [\"#A\", \"#A\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 245, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"B#\", \"#B\", \"B#\", \"#B\", \"B#\"], \"reference_answer\": \"#A B#\", \"gold_answer\": [\"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 246, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#B\", \"#A\", \"#A\", \"#B\", \"#B\"], \"reference_answer\": \"#A #B #A #A #B #B\", \"gold_answer\": [\"#A\", \"#B\", \"#A\", \"#A\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 247, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#B\", \"#B\", \"#A\", \"A#\", \"A#\"], \"reference_answer\": \"#B #B #B #A A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"#A\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 248, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"A#\", \"#A\", \"B#\", \"#A\"], \"reference_answer\": \"#A #A #A B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 249, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#B\", \"B#\", \"B#\", \"B#\", \"B#\"], \"reference_answer\": \"#B #B B# B# B# B#\", \"gold_answer\": [\"#B\", \"#B\", \"B#\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 250, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#B\", \"B#\", \"#B\", \"#B\", \"#B\"], \"reference_answer\": \"#B #B #B #B\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 251, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#A\", \"#A\", \"#A\", \"#A\", \"#B\"], \"reference_answer\": \"#A #A #A #A\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 252, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#B\", \"#A\", \"B#\", \"A#\", \"#B\"], \"reference_answer\": \"#A A#\", \"gold_answer\": [\"#A\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 253, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"B#\", \"#B\", \"A#\", \"#B\", \"A#\"], \"reference_answer\": \"#B #B A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 254, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#A\", \"B#\", \"B#\", \"#A\", \"#A\"], \"reference_answer\": \"#A #A #A B# B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 255, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"A#\", \"#B\", \"B#\", \"#A\", \"#B\"], \"reference_answer\": \"#B #B\", \"gold_answer\": [\"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 256, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"A#\", \"B#\", \"A#\", \"B#\", \"#A\"], \"reference_answer\": \"#A A# B# B#\", \"gold_answer\": [\"#A\", \"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 257, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"A#\", \"#B\", \"#B\", \"#A\"], \"reference_answer\": \"#A #A #B #B\", \"gold_answer\": [\"#A\", \"#A\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 258, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"A#\", \"A#\", \"B#\", \"A#\", \"A#\"], \"reference_answer\": \"#A A# A# B# A# A#\", \"gold_answer\": [\"#A\", \"A#\", \"A#\", \"B#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 259, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#A\", \"#B\", \"#B\", \"#B\", \"A#\"], \"reference_answer\": \"#A #B #B A#\", \"gold_answer\": [\"#A\", \"#B\", \"#B\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 260, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#A\", \"A#\", \"#B\", \"#B\", \"A#\"], \"reference_answer\": \"#B #A #B #B A# A#\", \"gold_answer\": [\"#B\", \"#A\", \"#B\", \"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 261, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"B#\", \"A#\", \"A#\", \"B#\", \"A#\"], \"reference_answer\": \"#A B# A# A# B# A#\", \"gold_answer\": [\"#A\", \"B#\", \"A#\", \"A#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 262, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#B\", \"#B\", \"#B\", \"B#\", \"B#\"], \"reference_answer\": \"#A #B #B #B B# B#\", \"gold_answer\": [\"#A\", \"#B\", \"#B\", \"#B\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 263, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#A\", \"A#\", \"#A\", \"#B\", \"#B\"], \"reference_answer\": \"#B #A #B #B\", \"gold_answer\": [\"#B\", \"#A\", \"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 264, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"A#\", \"A#\", \"B#\", \"A#\", \"#B\"], \"reference_answer\": \"A# A# A# A#\", \"gold_answer\": [\"A#\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 265, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"B#\", \"#B\", \"#A\", \"B#\"], \"reference_answer\": \"#A #A #A B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 266, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#B\", \"B#\", \"B#\", \"#B\", \"#B\"], \"reference_answer\": \"#A #B\", \"gold_answer\": [\"#A\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 267, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"A#\", \"B#\", \"#B\", \"#A\", \"#B\"], \"reference_answer\": \"#B #B\", \"gold_answer\": [\"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 268, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"B#\", \"B#\", \"B#\", \"B#\", \"A#\"], \"reference_answer\": \"B# B# B# B# B# A#\", \"gold_answer\": [\"B#\", \"B#\", \"B#\", \"B#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 269, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#B\", \"B#\", \"#B\", \"#B\", \"#B\"], \"reference_answer\": \"#B #B\", \"gold_answer\": [\"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 270, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#A\", \"#B\", \"#B\", \"A#\", \"#B\"], \"reference_answer\": \"#B #A #B #B #B A#\", \"gold_answer\": [\"#B\", \"#A\", \"#B\", \"#B\", \"#B\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 271, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#A\", \"#A\", \"B#\", \"#B\", \"A#\"], \"reference_answer\": \"#A #A B# A#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 272, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#A\", \"#B\", \"#B\", \"B#\", \"A#\"], \"reference_answer\": \"#B #A #B #B B# A#\", \"gold_answer\": [\"#B\", \"#A\", \"#B\", \"#B\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 273, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"B#\", \"B#\", \"#A\", \"#B\", \"B#\"], \"reference_answer\": \"#A #A B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 274, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"#A\", \"B#\", \"#A\", \"#B\", \"#B\"], \"reference_answer\": \"#A #B\", \"gold_answer\": [\"#A\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 275, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#A\", \"#B\", \"B#\", \"#B\", \"#A\"], \"reference_answer\": \"#A #A\", \"gold_answer\": [\"#A\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 276, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"A#\", \"#A\", \"#B\", \"A#\", \"A#\"], \"reference_answer\": \"#B A# A# A#\", \"gold_answer\": [\"#B\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 277, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"#B\", \"#B\", \"#B\", \"B#\", \"#B\"], \"reference_answer\": \"#B #B #B A#\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 278, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#B\", \"#A\", \"A#\", \"#A\", \"#A\"], \"reference_answer\": \"#A #B #A #A\", \"gold_answer\": [\"#A\", \"#B\", \"#A\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 279, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"A#\", \"A#\", \"#A\", \"A#\", \"#B\"], \"reference_answer\": \"#B A# A# A#\", \"gold_answer\": [\"#B\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 280, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"B#\", \"#A\", \"B#\", \"B#\", \"#B\"], \"reference_answer\": \"#B #A B# B#\", \"gold_answer\": [\"#B\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 281, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#B\", \"B#\", \"B#\", \"A#\", \"B#\"], \"reference_answer\": \"#A #B B# B# A# B#\", \"gold_answer\": [\"#A\", \"#B\", \"B#\", \"B#\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 282, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#B\", \"#A\", \"A#\", \"A#\", \"A#\"], \"reference_answer\": \"#A A# A# A#\", \"gold_answer\": [\"#A\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 283, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#B\", \"#A\", \"#B\", \"A#\", \"A#\"], \"reference_answer\": \"#B #B #A #B A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"#A\", \"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 284, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#A\", \"B#\", \"#A\", \"#A\", \"A#\"], \"reference_answer\": \"#A #A #A B# B# A#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 285, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"A#\", \"#A\", \"#B\", \"A#\", \"B#\"], \"reference_answer\": \"A# B#\", \"gold_answer\": [\"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 286, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"#B\", \"B#\", \"#B\", \"B#\", \"B#\"], \"reference_answer\": \"#B A# B# B#\", \"gold_answer\": [\"#B\", \"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 287, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"A#\", \"B#\", \"B#\", \"A#\", \"#B\"], \"reference_answer\": \"A# A# B# A#\", \"gold_answer\": [\"A#\", \"A#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 288, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"B#\", \"B#\", \"A#\", \"B#\", \"B#\"], \"reference_answer\": \"B# B# B# A# B# B#\", \"gold_answer\": [\"B#\", \"B#\", \"B#\", \"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 289, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"B#\", \"#A\", \"#A\", \"A#\", \"#A\"], \"reference_answer\": \"#A #A #A B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 290, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"A#\", \"B#\", \"A#\", \"A#\", \"B#\"], \"reference_answer\": \"A# A# B# A# A# B#\", \"gold_answer\": [\"A#\", \"A#\", \"B#\", \"A#\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 291, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#B\", \"#A\", \"B#\", \"B#\", \"#B\"], \"reference_answer\": \"#B #B #A B#\", \"gold_answer\": [\"#B\", \"#B\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 292, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#A\", \"#B\", \"#B\", \"#A\", \"#B\"], \"reference_answer\": \"#B #A #B #B #A #B\", \"gold_answer\": [\"#B\", \"#A\", \"#B\", \"#B\", \"#A\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 293, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"#A\", \"#A\", \"B#\", \"B#\"], \"reference_answer\": \"#A #A #A #A B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 294, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"A#\", \"B#\", \"B#\", \"B#\", \"B#\"], \"reference_answer\": \"#B A# B# B# B# B#\", \"gold_answer\": [\"#B\", \"A#\", \"B#\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 295, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"B#\", \"#A\", \"#B\", \"#A\", \"B#\"], \"reference_answer\": \"#A #A B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 296, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#B\", \"#B\", \"B#\", \"#A\", \"#A\"], \"reference_answer\": \"#B #B #B #A #A B#\", \"gold_answer\": [\"#B\", \"#B\", \"#B\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 297, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"#A\", \"A#\", \"A#\", \"A#\", \"#A\"], \"reference_answer\": \"A# A#\", \"gold_answer\": [\"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 298, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"#B\", \"B#\", \"#B\", \"B#\"], \"reference_answer\": \"#A #A #B B#\", \"gold_answer\": [\"#A\", \"#A\", \"#B\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 299, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"#B\", \"B#\", \"B#\", \"B#\", \"#B\"], \"reference_answer\": \"#B A# B# B#\", \"gold_answer\": [\"#B\", \"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 300, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"B#\", \"#A\", \"A#\", \"A#\"], \"reference_answer\": \"#A #A #A B# A# A#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 301, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"B#\", \"#A\", \"#B\", \"#A\"], \"reference_answer\": \"#A #A #A #A\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 302, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"A#\", \"A#\", \"#A\", \"#A\", \"B#\"], \"reference_answer\": \"#A B#\", \"gold_answer\": [\"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 303, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"B#\", \"B#\", \"B#\", \"#B\", \"#A\"], \"reference_answer\": \"#A #A B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 304, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"B#\", \"#A\", \"#B\", \"#A\", \"B#\"], \"reference_answer\": \"#B #A #A B#\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 305, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#A\", \"#A\", \"#B\", \"B#\", \"#A\"], \"reference_answer\": \"#A #A #A B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 306, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"A#\", \"B#\", \"#A\", \"B#\", \"B#\"], \"reference_answer\": \"B# B# B# B#\", \"gold_answer\": [\"B#\", \"B#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 307, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"#A\", \"A#\", \"B#\", \"#B\", \"#B\"], \"reference_answer\": \"#B A#\", \"gold_answer\": [\"#B\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 308, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"B#\", \"A#\", \"#A\", \"#B\", \"B#\"], \"reference_answer\": \"B# B#\", \"gold_answer\": [\"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 309, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#B\", \"#A\", \"#B\", \"#B\", \"#A\"], \"reference_answer\": \"#A #B #A #B #B #A\", \"gold_answer\": [\"#A\", \"#B\", \"#A\", \"#B\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 310, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"A#\", \"#B\", \"#B\", \"B#\", \"#B\"], \"reference_answer\": \"#B #B A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 311, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"B#\", \"B#\", \"#A\", \"A#\", \"#A\"], \"reference_answer\": \"#B #A B# B#\", \"gold_answer\": [\"#B\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 312, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"A#\", \"#B\", \"A#\", \"B#\", \"#A\"], \"reference_answer\": \"#B A# A# B#\", \"gold_answer\": [\"#B\", \"A#\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 313, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"A#\", \"#B\", \"A#\", \"#A\", \"A#\"], \"reference_answer\": \"A# A#\", \"gold_answer\": [\"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 314, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"#A\", \"#A\", \"A#\", \"#A\", \"#A\"], \"reference_answer\": \"#A #A\", \"gold_answer\": [\"#A\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 315, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"#A\", \"A#\", \"A#\", \"#A\", \"B#\"], \"reference_answer\": \"A# B#\", \"gold_answer\": [\"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 316, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#A\", \"B#\", \"A#\", \"B#\", \"B#\"], \"reference_answer\": \"#A B# B# A# B# B#\", \"gold_answer\": [\"#A\", \"B#\", \"B#\", \"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 317, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"A#\", \"B#\", \"B#\", \"B#\", \"#B\"], \"reference_answer\": \"A# A# B# B#\", \"gold_answer\": [\"A#\", \"A#\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 318, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"#A\", \"#A\", \"#A\", \"B#\"], \"reference_answer\": \"#A #A #A #A #A B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 319, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#B\", \"B#\", \"A#\", \"#B\", \"B#\"], \"reference_answer\": \"#B #B A# B#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 320, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"#A\", \"A#\", \"#A\", \"B#\"], \"reference_answer\": \"#A #A #A B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 321, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"#B\", \"#B\", \"#B\", \"#A\"], \"reference_answer\": \"#A #A #B #B #B #A\", \"gold_answer\": [\"#A\", \"#A\", \"#B\", \"#B\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 322, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"A#\", \"#A\", \"A#\", \"#A\", \"#A\"], \"reference_answer\": \"\", \"gold_answer\": []}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"wrong_format\": -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\": 323, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"A#\", \"#B\", \"B#\", \"#A\", \"A#\"], \"reference_answer\": \"#A #B B# A#\", \"gold_answer\": [\"#A\", \"#B\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 324, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"B#\", \"#B\", \"A#\", \"#A\", \"A#\"], \"reference_answer\": \"B# A#\", \"gold_answer\": [\"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 325, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"B#\", \"A#\", \"A#\", \"A#\", \"A#\"], \"reference_answer\": \"#B B# A# A# A# A#\", \"gold_answer\": [\"#B\", \"B#\", \"A#\", \"A#\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 326, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#A\", \"#B\", \"A#\", \"#A\", \"#A\"], \"reference_answer\": \"#A #A\", \"gold_answer\": [\"#A\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 327, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"B#\", \"#A\", \"#B\", \"B#\", \"#A\"], \"reference_answer\": \"#A #A B# B#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 328, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"A#\", \"#A\", \"#A\", \"B#\", \"#A\"], \"reference_answer\": \"#A #A #A B#\", \"gold_answer\": [\"#A\", \"#A\", \"#A\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 329, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"#A\", \"#B\", \"A#\", \"A#\", \"#B\"], \"reference_answer\": \"#B #B A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 330, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"A#\", \"#A\", \"#B\", \"#B\", \"B#\"], \"reference_answer\": \"#B B#\", \"gold_answer\": [\"#B\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 331, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#A\"], \"reference_answer\": \"#B #A #A #A #B #A\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"#A\", \"#B\", \"#A\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 332, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"B#\", \"#A\", \"#A\", \"B#\", \"A#\"], \"reference_answer\": \"#A #A B# B# B# A#\", \"gold_answer\": [\"#A\", \"#A\", \"B#\", \"B#\", \"B#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 333, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"A#\", \"#A\", \"A#\", \"A#\", \"#B\"], \"reference_answer\": \"#B #B A# A#\", \"gold_answer\": [\"#B\", \"#B\", \"A#\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 334, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#B\", \"#A\", \"#B\", \"A#\", \"#A\"], \"reference_answer\": \"#A #B #A #B\", \"gold_answer\": [\"#A\", \"#B\", \"#A\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 335, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"A#\", \"#B\", \"#B\", \"#B\", \"#A\"], \"reference_answer\": \"#B #B\", \"gold_answer\": [\"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 336, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#A\", \"#A\", \"#B\", \"#B\", \"#B\", \"B#\"], \"reference_answer\": \"#A #A #B #B #B B#\", \"gold_answer\": [\"#A\", \"#A\", \"#B\", \"#B\", \"#B\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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\": 337, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"B#\", \"#A\", \"#B\", \"A#\", \"B#\"], \"reference_answer\": \"#A B# A# B#\", \"gold_answer\": [\"#A\", \"B#\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 338, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"B#\", \"#B\", \"B#\", \"#B\", \"#B\", \"#B\"], \"reference_answer\": \"#B #B\", \"gold_answer\": [\"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 339, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"A#\", \"B#\", \"#B\", \"#B\", \"#A\", \"#B\"], \"reference_answer\": \"#B #B\", \"gold_answer\": [\"#B\", \"#B\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\": 1.0, \"rewards\": {\"... | [
{
"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\": 340, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"#A\", \"#A\", \"A#\", \"A#\", \"#A\"], \"reference_answer\": \"#B #A #A A#\", \"gold_answer\": [\"#B\", \"#A\", \"#A\", \"A#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passing_reward_threshold\":... | [
{
"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\": 341, \"parameter\": {\"N\": 6, \"max_steps\": 14, \"program\": [\"#B\", \"A#\", \"B#\", \"B#\", \"A#\", \"B#\"], \"reference_answer\": \"#B A# B# B# A# B#\", \"gold_answer\": [\"#B\", \"A#\", \"B#\", \"B#\", \"A#\", \"B#\"]}, \"answer_markers\": [\"<answer>\", \"</answer>\"], \"passi... | [
{
"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.