readme

README.md

@@ -33,7 +33,7 @@ print(obs)
 
 cache_plan = os.path.join(current_file_dir, "aime", "plan_gpt4o.3.json")
 obs, score, *_ = await brain.step(
-    query="Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take turns with Alice going first. On each turn, the player removes $1$ token or $4$ tokens from the stack. The player who removes the last token wins. Find the number of positive integers $n$ less than or equal to $2024$ such that there is a strategy that guarantees that Bob wins, regardless of Alice’s moves.",
+    query="Every morning Aya goes for a $9$-kilometer-long walk and stops at a coffee shop afterwards. When she walks at a constant speed of $s$ kilometers per hour, the walk takes her 4 hours, including $t$ minutes spent in the coffee shop. When she walks $s+2$ kilometers per hour, the walk takes her 2 hours and 24 minutes, including $t$ minutes spent in the coffee shop. Suppose Aya walks at $s+\frac{1}{2}$ kilometers per hour. Find the number of minutes the walk takes her, including the $t$ minutes spent in the coffee shop.",
     route="cot",
     dataset="aime 2024",
     cache_plan=cache_plan,

requirements.txt

@@ -88,6 +88,8 @@ sqlmodel
 aiosqlite
 asyncpg
 dill
+
+#accelerate
 #psycopg2-binary
 #ell-ai
 #ell-ai[anthropic]