File size: 1,727 Bytes
16a4018 06b02c3 16a4018 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 | 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"
# Lean sees all host CPUs rather than the sandbox's 4; this bounds `lake build` to 3 parallel jobs.
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
|