
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
A fly is being chased by three spiders on the edges of a regular octahedron. The fly has a speed of  $50$  meters per second, while each of the spiders has a speed of  $r$  meters per second. The spiders choose their starting positions, and choose the fly's starting position, with the requirement that the fly must begin at a vertex. Each bug knows the position of each other bug at all times, and the goal of the spiders is for at least one of them to catch the fly. What is the maximum  $c$  so that for any  $r<c,$   the fly can always avoid being caught?

*Author: Anderson Wang*

Present the answer in LaTex format: \boxed{Your answer}
user