| schema_version = "1.4" |
|
|
| [task] |
| name = "openai-math/bounded-tree-potentials" |
| version = "1.0.0" |
| description = "Prove BoundedTreePotentials (openai/math family 331: Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming) in Lean 4 with Mathlib; graded by Comparator in a separate sandbox." |
| keywords = ["lean4", "mathlib", "theorem-proving", "openai-math", "functional-analysis"] |
|
|
| [metadata] |
| source = "https://github.com/openai/math" |
| source_commit = "adc7f1241b42e322a6451854ab7e4b4c146bf78a" |
| source_license = "Apache-2.0" |
| source_notice = "tests/Challenge.lean is lean/ComparatorChallenges/BoundedTreePotentials.lean from openai/math, (c) OpenAI, unchanged; see NOTICE at the dataset root" |
| challenge = "BoundedTreePotentials" |
| family = "331" |
| family_title = "Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming" |
| subject = "Functional analysis" |
| theorems = ["OAI.BoundedTreePotentials.TreeCalculus.main_counterexample"] |
| definition_holes = [] |
| fixed_definitions = [] |
| reference_module = "OAI.Analysis.TreePotential.Main" |
| reference_modules = 46 |
| reference_lean_bytes = 595707 |
| reference_requires_packages = [] |
| oracle_result = "accepted" |
| oracle_grade_seconds = 358 |
| difficulty = "research" |
|
|
| [agent] |
| timeout_sec = 14400 |
| network_mode = "no-network" |
|
|
| [environment] |
| build_timeout_sec = 5400 |
| cpus = 4 |
| memory_mb = 8192 |
| storage_mb = 10240 |
| workdir = "/workspace" |
| |
| env = { LEAN_NUM_THREADS = "3" } |
|
|
| [verifier] |
| timeout_sec = 12236 |
| environment_mode = "separate" |
| network_mode = "no-network" |
|
|
| [[verifier.collect]] |
| command = "python3 /opt/openai-math/pack_submission.py" |
| timeout_sec = 300 |
|
|
