open-thought/reasoning-gym
1
0
Fork 0
mirror of https://github.com/open-thought/reasoning-gym.git synced 2026-04-22 16:49:06 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

remove template from test

Browse source
This commit is contained in:
Zafir Stojanovski 2025-02-14 21:58:45 +01:00
parent 7cf8b9c512
commit ed4f9dee13
1 changed files with 0 additions and 28 deletions
Download patch file Download diff file Expand all files Collapse all files

28
tests/test_string_splitting.py
View file

@ -4,34 +4,6 @@ import pytest
from reasoning_gym.algorithmic.string_splitting import StringSplittingConfig, StringSplittingDataset
QUESTION_TEMPLATE = """There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
3. Two units of machine C can be dismanteled into one unit of part Y.
4. One unit of machine B and one unit of machine C can be combined into one unit of machine A.
5. One unit of part X and one unit of part Y can be combined into one unit of part Z.
Given a certain number of initial machines, your job is to continuously cycle through the rules 1-5 above, exausting one rule at a time, until no more rules can be applied, or until a state (counts of each machine and part type) is repeated.
After you make use of a rule, you should update the counts of each machine and part type accordingly, and then restart the process from rule 1.
The output should be the count of each machine and part type after the rules have been exhaustively applied in the following order: A B C X Y Z.
For example 1 0 1 5 4 3 means that you have 1 machine A, 0 machine B, 1 machine C, 5 part X, 4 part Y, and 3 part Z.
Example:
- Input: You have 2 machines A, 0 machines B, and 1 machine C.
- Output: 0 0 1 2 0 2
- Explanation
0. Initial state: 2 0 1 0 0 0
1. We can apply rule 1 and trade 1 machine A for 2 part X and 1 part Y: 1 0 1 2 1 0
2. Starting over, we can apply rule 1 again: 0 0 1 4 2 0
3. In the next iteration, we can apply rule 5 and trade 1 part X and 1 part Y for 1 part Z: 0 0 1 3 1 1
4. In the next iteration, we can apply rule 5 again: 0 0 1 2 0 2
5. We can't apply any more rules, so the final answer is 0 0 1 2 0 2
Now, you have {A_machine} machine A, {B_machine} machine B, and {C_machine} machine C. Provide the count of each machine and part type after applying the above rules.
"""
def test_string_splitting_config_validation():
"""Test that invalid configs raise appropriate errors"""