Falkner and Boettcher, Equation (20:1,3)

Percentage Accurate: 99.3% → 99.6%
Time: 11.9s
Alternatives: 10
Speedup: 1.1×

Specification

?
\[\begin{array}{l} \\ \frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (- 1.0 (* 5.0 (* v v)))
  (* (* (* PI t) (sqrt (* 2.0 (- 1.0 (* 3.0 (* v v)))))) (- 1.0 (* v v)))))
double code(double v, double t) {
	return (1.0 - (5.0 * (v * v))) / (((((double) M_PI) * t) * sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
}
public static double code(double v, double t) {
	return (1.0 - (5.0 * (v * v))) / (((Math.PI * t) * Math.sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
}
def code(v, t):
	return (1.0 - (5.0 * (v * v))) / (((math.pi * t) * math.sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)))
function code(v, t)
	return Float64(Float64(1.0 - Float64(5.0 * Float64(v * v))) / Float64(Float64(Float64(pi * t) * sqrt(Float64(2.0 * Float64(1.0 - Float64(3.0 * Float64(v * v)))))) * Float64(1.0 - Float64(v * v))))
end
function tmp = code(v, t)
	tmp = (1.0 - (5.0 * (v * v))) / (((pi * t) * sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
end
code[v_, t_] := N[(N[(1.0 - N[(5.0 * N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(Pi * t), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(1.0 - N[(3.0 * N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 10 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (- 1.0 (* 5.0 (* v v)))
  (* (* (* PI t) (sqrt (* 2.0 (- 1.0 (* 3.0 (* v v)))))) (- 1.0 (* v v)))))
double code(double v, double t) {
	return (1.0 - (5.0 * (v * v))) / (((((double) M_PI) * t) * sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
}
public static double code(double v, double t) {
	return (1.0 - (5.0 * (v * v))) / (((Math.PI * t) * Math.sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
}
def code(v, t):
	return (1.0 - (5.0 * (v * v))) / (((math.pi * t) * math.sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)))
function code(v, t)
	return Float64(Float64(1.0 - Float64(5.0 * Float64(v * v))) / Float64(Float64(Float64(pi * t) * sqrt(Float64(2.0 * Float64(1.0 - Float64(3.0 * Float64(v * v)))))) * Float64(1.0 - Float64(v * v))))
end
function tmp = code(v, t)
	tmp = (1.0 - (5.0 * (v * v))) / (((pi * t) * sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
end
code[v_, t_] := N[(N[(1.0 - N[(5.0 * N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(Pi * t), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(1.0 - N[(3.0 * N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)}
\end{array}

Alternative 1: 99.6% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi}}{\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (/ (fma v (* v -5.0) 1.0) PI)
  (* (* t (- 1.0 (* v v))) (sqrt (fma -6.0 (* v v) 2.0)))))
double code(double v, double t) {
	return (fma(v, (v * -5.0), 1.0) / ((double) M_PI)) / ((t * (1.0 - (v * v))) * sqrt(fma(-6.0, (v * v), 2.0)));
}
function code(v, t)
	return Float64(Float64(fma(v, Float64(v * -5.0), 1.0) / pi) / Float64(Float64(t * Float64(1.0 - Float64(v * v))) * sqrt(fma(-6.0, Float64(v * v), 2.0))))
end
code[v_, t_] := N[(N[(N[(v * N[(v * -5.0), $MachinePrecision] + 1.0), $MachinePrecision] / Pi), $MachinePrecision] / N[(N[(t * N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-6.0 * N[(v * v), $MachinePrecision] + 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi}}{\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Applied egg-rr99.6%

    \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi} \cdot 1}{\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}}} \]
  4. Final simplification99.6%

    \[\leadsto \frac{\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi}}{\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}} \]
  5. Add Preprocessing

Alternative 2: 99.6% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{t} \cdot \frac{1}{\sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)} \cdot \left(\pi \cdot \left(1 - v \cdot v\right)\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (*
  (/ (fma v (* v -5.0) 1.0) t)
  (/ 1.0 (* (sqrt (fma -6.0 (* v v) 2.0)) (* PI (- 1.0 (* v v)))))))
double code(double v, double t) {
	return (fma(v, (v * -5.0), 1.0) / t) * (1.0 / (sqrt(fma(-6.0, (v * v), 2.0)) * (((double) M_PI) * (1.0 - (v * v)))));
}
function code(v, t)
	return Float64(Float64(fma(v, Float64(v * -5.0), 1.0) / t) * Float64(1.0 / Float64(sqrt(fma(-6.0, Float64(v * v), 2.0)) * Float64(pi * Float64(1.0 - Float64(v * v))))))
end
code[v_, t_] := N[(N[(N[(v * N[(v * -5.0), $MachinePrecision] + 1.0), $MachinePrecision] / t), $MachinePrecision] * N[(1.0 / N[(N[Sqrt[N[(-6.0 * N[(v * v), $MachinePrecision] + 2.0), $MachinePrecision]], $MachinePrecision] * N[(Pi * N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{t} \cdot \frac{1}{\sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)} \cdot \left(\pi \cdot \left(1 - v \cdot v\right)\right)}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Applied egg-rr99.5%

    \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{t} \cdot \frac{1}{\left(\pi \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}}} \]
  4. Final simplification99.5%

    \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{t} \cdot \frac{1}{\sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)} \cdot \left(\pi \cdot \left(1 - v \cdot v\right)\right)} \]
  5. Add Preprocessing

Alternative 3: 99.4% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \left(\pi \cdot \sqrt{\mathsf{fma}\left(v, v \cdot -6, 2\right)}\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (fma v (* v -5.0) 1.0)
  (* (* t (- 1.0 (* v v))) (* PI (sqrt (fma v (* v -6.0) 2.0))))))
double code(double v, double t) {
	return fma(v, (v * -5.0), 1.0) / ((t * (1.0 - (v * v))) * (((double) M_PI) * sqrt(fma(v, (v * -6.0), 2.0))));
}
function code(v, t)
	return Float64(fma(v, Float64(v * -5.0), 1.0) / Float64(Float64(t * Float64(1.0 - Float64(v * v))) * Float64(pi * sqrt(fma(v, Float64(v * -6.0), 2.0)))))
end
code[v_, t_] := N[(N[(v * N[(v * -5.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(t * N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(Pi * N[Sqrt[N[(v * N[(v * -6.0), $MachinePrecision] + 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \left(\pi \cdot \sqrt{\mathsf{fma}\left(v, v \cdot -6, 2\right)}\right)}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Applied egg-rr99.4%

    \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi \cdot \left(\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}\right)}} \]
  4. Step-by-step derivation
    1. lift-PI.f64N/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\color{blue}{\mathsf{PI}\left(\right)} \cdot \left(\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{-6 \cdot \left(v \cdot v\right) + 2}\right)} \]
    2. lift-*.f64N/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\mathsf{PI}\left(\right) \cdot \left(\left(t \cdot \left(1 - \color{blue}{v \cdot v}\right)\right) \cdot \sqrt{-6 \cdot \left(v \cdot v\right) + 2}\right)} \]
    3. lift--.f64N/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\mathsf{PI}\left(\right) \cdot \left(\left(t \cdot \color{blue}{\left(1 - v \cdot v\right)}\right) \cdot \sqrt{-6 \cdot \left(v \cdot v\right) + 2}\right)} \]
    4. lift-*.f64N/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\mathsf{PI}\left(\right) \cdot \left(\color{blue}{\left(t \cdot \left(1 - v \cdot v\right)\right)} \cdot \sqrt{-6 \cdot \left(v \cdot v\right) + 2}\right)} \]
    5. lift-*.f64N/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\mathsf{PI}\left(\right) \cdot \left(\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{-6 \cdot \color{blue}{\left(v \cdot v\right)} + 2}\right)} \]
    6. lift-fma.f64N/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\mathsf{PI}\left(\right) \cdot \left(\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\color{blue}{\mathsf{fma}\left(-6, v \cdot v, 2\right)}}\right)} \]
    7. lift-sqrt.f64N/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\mathsf{PI}\left(\right) \cdot \left(\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \color{blue}{\sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}}\right)} \]
    8. *-commutativeN/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\mathsf{PI}\left(\right) \cdot \color{blue}{\left(\sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)} \cdot \left(t \cdot \left(1 - v \cdot v\right)\right)\right)}} \]
    9. associate-*r*N/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\color{blue}{\left(\mathsf{PI}\left(\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}\right) \cdot \left(t \cdot \left(1 - v \cdot v\right)\right)}} \]
    10. lower-*.f64N/A

      \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\color{blue}{\left(\mathsf{PI}\left(\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}\right) \cdot \left(t \cdot \left(1 - v \cdot v\right)\right)}} \]
  5. Applied egg-rr99.4%

    \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\color{blue}{\left(\pi \cdot \sqrt{\mathsf{fma}\left(v, v \cdot -6, 2\right)}\right) \cdot \left(t \cdot \left(1 - v \cdot v\right)\right)}} \]
  6. Final simplification99.4%

    \[\leadsto \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \left(\pi \cdot \sqrt{\mathsf{fma}\left(v, v \cdot -6, 2\right)}\right)} \]
  7. Add Preprocessing

Alternative 4: 99.3% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi \cdot \left(\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (fma v (* v -5.0) 1.0)
  (* PI (* (* t (- 1.0 (* v v))) (sqrt (fma -6.0 (* v v) 2.0))))))
double code(double v, double t) {
	return fma(v, (v * -5.0), 1.0) / (((double) M_PI) * ((t * (1.0 - (v * v))) * sqrt(fma(-6.0, (v * v), 2.0))));
}
function code(v, t)
	return Float64(fma(v, Float64(v * -5.0), 1.0) / Float64(pi * Float64(Float64(t * Float64(1.0 - Float64(v * v))) * sqrt(fma(-6.0, Float64(v * v), 2.0)))))
end
code[v_, t_] := N[(N[(v * N[(v * -5.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(Pi * N[(N[(t * N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-6.0 * N[(v * v), $MachinePrecision] + 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi \cdot \left(\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}\right)}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Applied egg-rr99.4%

    \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi \cdot \left(\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}\right)}} \]
  4. Add Preprocessing

Alternative 5: 98.7% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \frac{\frac{1}{\pi \cdot \sqrt{2}}}{t} \end{array} \]
(FPCore (v t) :precision binary64 (/ (/ 1.0 (* PI (sqrt 2.0))) t))
double code(double v, double t) {
	return (1.0 / (((double) M_PI) * sqrt(2.0))) / t;
}
public static double code(double v, double t) {
	return (1.0 / (Math.PI * Math.sqrt(2.0))) / t;
}
def code(v, t):
	return (1.0 / (math.pi * math.sqrt(2.0))) / t
function code(v, t)
	return Float64(Float64(1.0 / Float64(pi * sqrt(2.0))) / t)
end
function tmp = code(v, t)
	tmp = (1.0 / (pi * sqrt(2.0))) / t;
end
code[v_, t_] := N[(N[(1.0 / N[(Pi * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]
\begin{array}{l}

\\
\frac{\frac{1}{\pi \cdot \sqrt{2}}}{t}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Taylor expanded in v around 0

    \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
  4. Step-by-step derivation
    1. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
    2. associate-*r*N/A

      \[\leadsto \frac{1}{\color{blue}{\left(t \cdot \mathsf{PI}\left(\right)\right) \cdot \sqrt{2}}} \]
    3. *-commutativeN/A

      \[\leadsto \frac{1}{\color{blue}{\left(\mathsf{PI}\left(\right) \cdot t\right)} \cdot \sqrt{2}} \]
    4. associate-*l*N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    5. lower-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    6. lower-PI.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right)} \cdot \left(t \cdot \sqrt{2}\right)} \]
    7. lower-*.f64N/A

      \[\leadsto \frac{1}{\mathsf{PI}\left(\right) \cdot \color{blue}{\left(t \cdot \sqrt{2}\right)}} \]
    8. lower-sqrt.f6498.8

      \[\leadsto \frac{1}{\pi \cdot \left(t \cdot \color{blue}{\sqrt{2}}\right)} \]
  5. Simplified98.8%

    \[\leadsto \color{blue}{\frac{1}{\pi \cdot \left(t \cdot \sqrt{2}\right)}} \]
  6. Step-by-step derivation
    1. lift-PI.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right)} \cdot \left(t \cdot \sqrt{2}\right)} \]
    2. lift-sqrt.f64N/A

      \[\leadsto \frac{1}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \color{blue}{\sqrt{2}}\right)} \]
    3. lift-*.f64N/A

      \[\leadsto \frac{1}{\mathsf{PI}\left(\right) \cdot \color{blue}{\left(t \cdot \sqrt{2}\right)}} \]
    4. lift-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    5. lift-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    6. associate-/r*N/A

      \[\leadsto \color{blue}{\frac{\frac{1}{\mathsf{PI}\left(\right)}}{t \cdot \sqrt{2}}} \]
    7. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{\frac{1}{\mathsf{PI}\left(\right)}}{t \cdot \sqrt{2}}} \]
    8. lower-/.f6499.1

      \[\leadsto \frac{\color{blue}{\frac{1}{\pi}}}{t \cdot \sqrt{2}} \]
  7. Applied egg-rr99.1%

    \[\leadsto \color{blue}{\frac{\frac{1}{\pi}}{t \cdot \sqrt{2}}} \]
  8. Step-by-step derivation
    1. lift-PI.f64N/A

      \[\leadsto \frac{\frac{1}{\color{blue}{\mathsf{PI}\left(\right)}}}{t \cdot \sqrt{2}} \]
    2. lift-/.f64N/A

      \[\leadsto \frac{\color{blue}{\frac{1}{\mathsf{PI}\left(\right)}}}{t \cdot \sqrt{2}} \]
    3. lift-sqrt.f64N/A

      \[\leadsto \frac{\frac{1}{\mathsf{PI}\left(\right)}}{t \cdot \color{blue}{\sqrt{2}}} \]
    4. *-commutativeN/A

      \[\leadsto \frac{\frac{1}{\mathsf{PI}\left(\right)}}{\color{blue}{\sqrt{2} \cdot t}} \]
    5. associate-/r*N/A

      \[\leadsto \color{blue}{\frac{\frac{\frac{1}{\mathsf{PI}\left(\right)}}{\sqrt{2}}}{t}} \]
    6. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{\frac{\frac{1}{\mathsf{PI}\left(\right)}}{\sqrt{2}}}{t}} \]
    7. clear-numN/A

      \[\leadsto \frac{\color{blue}{\frac{1}{\frac{\sqrt{2}}{\frac{1}{\mathsf{PI}\left(\right)}}}}}{t} \]
    8. lower-/.f64N/A

      \[\leadsto \frac{\color{blue}{\frac{1}{\frac{\sqrt{2}}{\frac{1}{\mathsf{PI}\left(\right)}}}}}{t} \]
    9. div-invN/A

      \[\leadsto \frac{\frac{1}{\color{blue}{\sqrt{2} \cdot \frac{1}{\frac{1}{\mathsf{PI}\left(\right)}}}}}{t} \]
    10. lift-/.f64N/A

      \[\leadsto \frac{\frac{1}{\sqrt{2} \cdot \frac{1}{\color{blue}{\frac{1}{\mathsf{PI}\left(\right)}}}}}{t} \]
    11. remove-double-divN/A

      \[\leadsto \frac{\frac{1}{\sqrt{2} \cdot \color{blue}{\mathsf{PI}\left(\right)}}}{t} \]
    12. lower-*.f6499.3

      \[\leadsto \frac{\frac{1}{\color{blue}{\sqrt{2} \cdot \pi}}}{t} \]
  9. Applied egg-rr99.3%

    \[\leadsto \color{blue}{\frac{\frac{1}{\sqrt{2} \cdot \pi}}{t}} \]
  10. Final simplification99.3%

    \[\leadsto \frac{\frac{1}{\pi \cdot \sqrt{2}}}{t} \]
  11. Add Preprocessing

Alternative 6: 98.5% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \frac{\frac{1}{\pi}}{t \cdot \sqrt{2}} \end{array} \]
(FPCore (v t) :precision binary64 (/ (/ 1.0 PI) (* t (sqrt 2.0))))
double code(double v, double t) {
	return (1.0 / ((double) M_PI)) / (t * sqrt(2.0));
}
public static double code(double v, double t) {
	return (1.0 / Math.PI) / (t * Math.sqrt(2.0));
}
def code(v, t):
	return (1.0 / math.pi) / (t * math.sqrt(2.0))
function code(v, t)
	return Float64(Float64(1.0 / pi) / Float64(t * sqrt(2.0)))
end
function tmp = code(v, t)
	tmp = (1.0 / pi) / (t * sqrt(2.0));
end
code[v_, t_] := N[(N[(1.0 / Pi), $MachinePrecision] / N[(t * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\frac{1}{\pi}}{t \cdot \sqrt{2}}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Taylor expanded in v around 0

    \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
  4. Step-by-step derivation
    1. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
    2. associate-*r*N/A

      \[\leadsto \frac{1}{\color{blue}{\left(t \cdot \mathsf{PI}\left(\right)\right) \cdot \sqrt{2}}} \]
    3. *-commutativeN/A

      \[\leadsto \frac{1}{\color{blue}{\left(\mathsf{PI}\left(\right) \cdot t\right)} \cdot \sqrt{2}} \]
    4. associate-*l*N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    5. lower-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    6. lower-PI.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right)} \cdot \left(t \cdot \sqrt{2}\right)} \]
    7. lower-*.f64N/A

      \[\leadsto \frac{1}{\mathsf{PI}\left(\right) \cdot \color{blue}{\left(t \cdot \sqrt{2}\right)}} \]
    8. lower-sqrt.f6498.8

      \[\leadsto \frac{1}{\pi \cdot \left(t \cdot \color{blue}{\sqrt{2}}\right)} \]
  5. Simplified98.8%

    \[\leadsto \color{blue}{\frac{1}{\pi \cdot \left(t \cdot \sqrt{2}\right)}} \]
  6. Step-by-step derivation
    1. lift-PI.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right)} \cdot \left(t \cdot \sqrt{2}\right)} \]
    2. lift-sqrt.f64N/A

      \[\leadsto \frac{1}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \color{blue}{\sqrt{2}}\right)} \]
    3. lift-*.f64N/A

      \[\leadsto \frac{1}{\mathsf{PI}\left(\right) \cdot \color{blue}{\left(t \cdot \sqrt{2}\right)}} \]
    4. lift-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    5. lift-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    6. associate-/r*N/A

      \[\leadsto \color{blue}{\frac{\frac{1}{\mathsf{PI}\left(\right)}}{t \cdot \sqrt{2}}} \]
    7. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{\frac{1}{\mathsf{PI}\left(\right)}}{t \cdot \sqrt{2}}} \]
    8. lower-/.f6499.1

      \[\leadsto \frac{\color{blue}{\frac{1}{\pi}}}{t \cdot \sqrt{2}} \]
  7. Applied egg-rr99.1%

    \[\leadsto \color{blue}{\frac{\frac{1}{\pi}}{t \cdot \sqrt{2}}} \]
  8. Add Preprocessing

Alternative 7: 98.3% accurate, 2.4× speedup?

\[\begin{array}{l} \\ \frac{1}{t \cdot \left(\pi \cdot \sqrt{2}\right)} \end{array} \]
(FPCore (v t) :precision binary64 (/ 1.0 (* t (* PI (sqrt 2.0)))))
double code(double v, double t) {
	return 1.0 / (t * (((double) M_PI) * sqrt(2.0)));
}
public static double code(double v, double t) {
	return 1.0 / (t * (Math.PI * Math.sqrt(2.0)));
}
def code(v, t):
	return 1.0 / (t * (math.pi * math.sqrt(2.0)))
function code(v, t)
	return Float64(1.0 / Float64(t * Float64(pi * sqrt(2.0))))
end
function tmp = code(v, t)
	tmp = 1.0 / (t * (pi * sqrt(2.0)));
end
code[v_, t_] := N[(1.0 / N[(t * N[(Pi * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1}{t \cdot \left(\pi \cdot \sqrt{2}\right)}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Taylor expanded in v around 0

    \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
  4. Step-by-step derivation
    1. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
    2. associate-*r*N/A

      \[\leadsto \frac{1}{\color{blue}{\left(t \cdot \mathsf{PI}\left(\right)\right) \cdot \sqrt{2}}} \]
    3. *-commutativeN/A

      \[\leadsto \frac{1}{\color{blue}{\left(\mathsf{PI}\left(\right) \cdot t\right)} \cdot \sqrt{2}} \]
    4. associate-*l*N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    5. lower-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    6. lower-PI.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right)} \cdot \left(t \cdot \sqrt{2}\right)} \]
    7. lower-*.f64N/A

      \[\leadsto \frac{1}{\mathsf{PI}\left(\right) \cdot \color{blue}{\left(t \cdot \sqrt{2}\right)}} \]
    8. lower-sqrt.f6498.8

      \[\leadsto \frac{1}{\pi \cdot \left(t \cdot \color{blue}{\sqrt{2}}\right)} \]
  5. Simplified98.8%

    \[\leadsto \color{blue}{\frac{1}{\pi \cdot \left(t \cdot \sqrt{2}\right)}} \]
  6. Step-by-step derivation
    1. lift-PI.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right)} \cdot \left(t \cdot \sqrt{2}\right)} \]
    2. lift-sqrt.f64N/A

      \[\leadsto \frac{1}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \color{blue}{\sqrt{2}}\right)} \]
    3. associate-*r*N/A

      \[\leadsto \frac{1}{\color{blue}{\left(\mathsf{PI}\left(\right) \cdot t\right) \cdot \sqrt{2}}} \]
    4. lift-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\left(\mathsf{PI}\left(\right) \cdot t\right)} \cdot \sqrt{2}} \]
    5. *-commutativeN/A

      \[\leadsto \frac{1}{\color{blue}{\sqrt{2} \cdot \left(\mathsf{PI}\left(\right) \cdot t\right)}} \]
    6. lift-*.f64N/A

      \[\leadsto \frac{1}{\sqrt{2} \cdot \color{blue}{\left(\mathsf{PI}\left(\right) \cdot t\right)}} \]
    7. associate-*r*N/A

      \[\leadsto \frac{1}{\color{blue}{\left(\sqrt{2} \cdot \mathsf{PI}\left(\right)\right) \cdot t}} \]
    8. lower-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\left(\sqrt{2} \cdot \mathsf{PI}\left(\right)\right) \cdot t}} \]
    9. lower-*.f6498.9

      \[\leadsto \frac{1}{\color{blue}{\left(\sqrt{2} \cdot \pi\right)} \cdot t} \]
  7. Applied egg-rr98.9%

    \[\leadsto \frac{1}{\color{blue}{\left(\sqrt{2} \cdot \pi\right) \cdot t}} \]
  8. Final simplification98.9%

    \[\leadsto \frac{1}{t \cdot \left(\pi \cdot \sqrt{2}\right)} \]
  9. Add Preprocessing

Alternative 8: 98.2% accurate, 2.4× speedup?

\[\begin{array}{l} \\ \frac{1}{\pi \cdot \left(t \cdot \sqrt{2}\right)} \end{array} \]
(FPCore (v t) :precision binary64 (/ 1.0 (* PI (* t (sqrt 2.0)))))
double code(double v, double t) {
	return 1.0 / (((double) M_PI) * (t * sqrt(2.0)));
}
public static double code(double v, double t) {
	return 1.0 / (Math.PI * (t * Math.sqrt(2.0)));
}
def code(v, t):
	return 1.0 / (math.pi * (t * math.sqrt(2.0)))
function code(v, t)
	return Float64(1.0 / Float64(pi * Float64(t * sqrt(2.0))))
end
function tmp = code(v, t)
	tmp = 1.0 / (pi * (t * sqrt(2.0)));
end
code[v_, t_] := N[(1.0 / N[(Pi * N[(t * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1}{\pi \cdot \left(t \cdot \sqrt{2}\right)}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Taylor expanded in v around 0

    \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
  4. Step-by-step derivation
    1. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
    2. associate-*r*N/A

      \[\leadsto \frac{1}{\color{blue}{\left(t \cdot \mathsf{PI}\left(\right)\right) \cdot \sqrt{2}}} \]
    3. *-commutativeN/A

      \[\leadsto \frac{1}{\color{blue}{\left(\mathsf{PI}\left(\right) \cdot t\right)} \cdot \sqrt{2}} \]
    4. associate-*l*N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    5. lower-*.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right) \cdot \left(t \cdot \sqrt{2}\right)}} \]
    6. lower-PI.f64N/A

      \[\leadsto \frac{1}{\color{blue}{\mathsf{PI}\left(\right)} \cdot \left(t \cdot \sqrt{2}\right)} \]
    7. lower-*.f64N/A

      \[\leadsto \frac{1}{\mathsf{PI}\left(\right) \cdot \color{blue}{\left(t \cdot \sqrt{2}\right)}} \]
    8. lower-sqrt.f6498.8

      \[\leadsto \frac{1}{\pi \cdot \left(t \cdot \color{blue}{\sqrt{2}}\right)} \]
  5. Simplified98.8%

    \[\leadsto \color{blue}{\frac{1}{\pi \cdot \left(t \cdot \sqrt{2}\right)}} \]
  6. Add Preprocessing

Alternative 9: 97.8% accurate, 2.4× speedup?

\[\begin{array}{l} \\ \frac{1}{\pi \cdot t} \cdot \sqrt{0.5} \end{array} \]
(FPCore (v t) :precision binary64 (* (/ 1.0 (* PI t)) (sqrt 0.5)))
double code(double v, double t) {
	return (1.0 / (((double) M_PI) * t)) * sqrt(0.5);
}
public static double code(double v, double t) {
	return (1.0 / (Math.PI * t)) * Math.sqrt(0.5);
}
def code(v, t):
	return (1.0 / (math.pi * t)) * math.sqrt(0.5)
function code(v, t)
	return Float64(Float64(1.0 / Float64(pi * t)) * sqrt(0.5))
end
function tmp = code(v, t)
	tmp = (1.0 / (pi * t)) * sqrt(0.5);
end
code[v_, t_] := N[(N[(1.0 / N[(Pi * t), $MachinePrecision]), $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1}{\pi \cdot t} \cdot \sqrt{0.5}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Applied egg-rr99.6%

    \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi} \cdot 1}{\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}}} \]
  4. Taylor expanded in v around 0

    \[\leadsto \color{blue}{\frac{\sqrt{\frac{1}{2}}}{t \cdot \mathsf{PI}\left(\right)}} \]
  5. Step-by-step derivation
    1. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{\sqrt{\frac{1}{2}}}{t \cdot \mathsf{PI}\left(\right)}} \]
    2. lower-sqrt.f64N/A

      \[\leadsto \frac{\color{blue}{\sqrt{\frac{1}{2}}}}{t \cdot \mathsf{PI}\left(\right)} \]
    3. lower-*.f64N/A

      \[\leadsto \frac{\sqrt{\frac{1}{2}}}{\color{blue}{t \cdot \mathsf{PI}\left(\right)}} \]
    4. lower-PI.f6498.4

      \[\leadsto \frac{\sqrt{0.5}}{t \cdot \color{blue}{\pi}} \]
  6. Simplified98.4%

    \[\leadsto \color{blue}{\frac{\sqrt{0.5}}{t \cdot \pi}} \]
  7. Step-by-step derivation
    1. lift-sqrt.f64N/A

      \[\leadsto \frac{\color{blue}{\sqrt{\frac{1}{2}}}}{t \cdot \mathsf{PI}\left(\right)} \]
    2. lift-PI.f64N/A

      \[\leadsto \frac{\sqrt{\frac{1}{2}}}{t \cdot \color{blue}{\mathsf{PI}\left(\right)}} \]
    3. *-commutativeN/A

      \[\leadsto \frac{\sqrt{\frac{1}{2}}}{\color{blue}{\mathsf{PI}\left(\right) \cdot t}} \]
    4. lift-*.f64N/A

      \[\leadsto \frac{\sqrt{\frac{1}{2}}}{\color{blue}{\mathsf{PI}\left(\right) \cdot t}} \]
    5. clear-numN/A

      \[\leadsto \color{blue}{\frac{1}{\frac{\mathsf{PI}\left(\right) \cdot t}{\sqrt{\frac{1}{2}}}}} \]
    6. associate-/r/N/A

      \[\leadsto \color{blue}{\frac{1}{\mathsf{PI}\left(\right) \cdot t} \cdot \sqrt{\frac{1}{2}}} \]
    7. lift-/.f64N/A

      \[\leadsto \color{blue}{\frac{1}{\mathsf{PI}\left(\right) \cdot t}} \cdot \sqrt{\frac{1}{2}} \]
    8. lower-*.f6498.4

      \[\leadsto \color{blue}{\frac{1}{\pi \cdot t} \cdot \sqrt{0.5}} \]
  8. Applied egg-rr98.4%

    \[\leadsto \color{blue}{\frac{1}{\pi \cdot t} \cdot \sqrt{0.5}} \]
  9. Add Preprocessing

Alternative 10: 97.8% accurate, 2.8× speedup?

\[\begin{array}{l} \\ \frac{\sqrt{0.5}}{\pi \cdot t} \end{array} \]
(FPCore (v t) :precision binary64 (/ (sqrt 0.5) (* PI t)))
double code(double v, double t) {
	return sqrt(0.5) / (((double) M_PI) * t);
}
public static double code(double v, double t) {
	return Math.sqrt(0.5) / (Math.PI * t);
}
def code(v, t):
	return math.sqrt(0.5) / (math.pi * t)
function code(v, t)
	return Float64(sqrt(0.5) / Float64(pi * t))
end
function tmp = code(v, t)
	tmp = sqrt(0.5) / (pi * t);
end
code[v_, t_] := N[(N[Sqrt[0.5], $MachinePrecision] / N[(Pi * t), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\sqrt{0.5}}{\pi \cdot t}
\end{array}
Derivation
  1. Initial program 99.3%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Add Preprocessing
  3. Applied egg-rr99.6%

    \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(v, v \cdot -5, 1\right)}{\pi} \cdot 1}{\left(t \cdot \left(1 - v \cdot v\right)\right) \cdot \sqrt{\mathsf{fma}\left(-6, v \cdot v, 2\right)}}} \]
  4. Taylor expanded in v around 0

    \[\leadsto \color{blue}{\frac{\sqrt{\frac{1}{2}}}{t \cdot \mathsf{PI}\left(\right)}} \]
  5. Step-by-step derivation
    1. lower-/.f64N/A

      \[\leadsto \color{blue}{\frac{\sqrt{\frac{1}{2}}}{t \cdot \mathsf{PI}\left(\right)}} \]
    2. lower-sqrt.f64N/A

      \[\leadsto \frac{\color{blue}{\sqrt{\frac{1}{2}}}}{t \cdot \mathsf{PI}\left(\right)} \]
    3. lower-*.f64N/A

      \[\leadsto \frac{\sqrt{\frac{1}{2}}}{\color{blue}{t \cdot \mathsf{PI}\left(\right)}} \]
    4. lower-PI.f6498.4

      \[\leadsto \frac{\sqrt{0.5}}{t \cdot \color{blue}{\pi}} \]
  6. Simplified98.4%

    \[\leadsto \color{blue}{\frac{\sqrt{0.5}}{t \cdot \pi}} \]
  7. Final simplification98.4%

    \[\leadsto \frac{\sqrt{0.5}}{\pi \cdot t} \]
  8. Add Preprocessing

Reproduce

?
herbie shell --seed 2024207 
(FPCore (v t)
  :name "Falkner and Boettcher, Equation (20:1,3)"
  :precision binary64
  (/ (- 1.0 (* 5.0 (* v v))) (* (* (* PI t) (sqrt (* 2.0 (- 1.0 (* 3.0 (* v v)))))) (- 1.0 (* v v)))))