
(FPCore (g a) :precision binary64 (cbrt (/ g (* 2.0 a))))
double code(double g, double a) {
return cbrt((g / (2.0 * a)));
}
public static double code(double g, double a) {
return Math.cbrt((g / (2.0 * a)));
}
function code(g, a) return cbrt(Float64(g / Float64(2.0 * a))) end
code[g_, a_] := N[Power[N[(g / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]
\begin{array}{l}
\\
\sqrt[3]{\frac{g}{2 \cdot a}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 3 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (g a) :precision binary64 (cbrt (/ g (* 2.0 a))))
double code(double g, double a) {
return cbrt((g / (2.0 * a)));
}
public static double code(double g, double a) {
return Math.cbrt((g / (2.0 * a)));
}
function code(g, a) return cbrt(Float64(g / Float64(2.0 * a))) end
code[g_, a_] := N[Power[N[(g / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]
\begin{array}{l}
\\
\sqrt[3]{\frac{g}{2 \cdot a}}
\end{array}
(FPCore (g a) :precision binary64 (/ (cbrt g) (cbrt (+ a a))))
double code(double g, double a) {
return cbrt(g) / cbrt((a + a));
}
public static double code(double g, double a) {
return Math.cbrt(g) / Math.cbrt((a + a));
}
function code(g, a) return Float64(cbrt(g) / cbrt(Float64(a + a))) end
code[g_, a_] := N[(N[Power[g, 1/3], $MachinePrecision] / N[Power[N[(a + a), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt[3]{g}}{\sqrt[3]{a + a}}
\end{array}
Initial program 70.7%
lift-cbrt.f64N/A
lift-/.f64N/A
frac-2negN/A
cbrt-divN/A
lift-*.f64N/A
count-2-revN/A
flip-+N/A
distribute-neg-fracN/A
+-inversesN/A
metadata-evalN/A
+-inversesN/A
flip-+N/A
count-2-revN/A
lift-*.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-neg.f64N/A
lower-cbrt.f641.6
lift-*.f64N/A
count-2-revN/A
flip-+N/A
+-inversesN/A
metadata-evalN/A
+-inversesN/A
distribute-neg-fracN/A
Applied rewrites98.8%
lift-/.f64N/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
count-2-revN/A
lift-+.f64N/A
cbrt-divN/A
lift-neg.f64N/A
frac-2negN/A
cbrt-divN/A
lift-+.f64N/A
flip-+N/A
+-inversesN/A
metadata-evalN/A
+-inversesN/A
distribute-neg-fracN/A
flip-+N/A
count-2-revN/A
distribute-lft-neg-inN/A
metadata-evalN/A
*-commutativeN/A
Applied rewrites98.8%
lift-*.f64N/A
count-2-revN/A
lower-+.f6498.8
Applied rewrites98.8%
(FPCore (g a) :precision binary64 (cbrt (* (/ 0.5 a) g)))
double code(double g, double a) {
return cbrt(((0.5 / a) * g));
}
public static double code(double g, double a) {
return Math.cbrt(((0.5 / a) * g));
}
function code(g, a) return cbrt(Float64(Float64(0.5 / a) * g)) end
code[g_, a_] := N[Power[N[(N[(0.5 / a), $MachinePrecision] * g), $MachinePrecision], 1/3], $MachinePrecision]
\begin{array}{l}
\\
\sqrt[3]{\frac{0.5}{a} \cdot g}
\end{array}
Initial program 70.7%
lift-*.f64N/A
count-2-revN/A
lower-+.f6470.7
Applied rewrites70.7%
Taylor expanded in g around 0
associate-*r/N/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f6470.8
Applied rewrites70.8%
(FPCore (g a) :precision binary64 (cbrt (/ g (+ a a))))
double code(double g, double a) {
return cbrt((g / (a + a)));
}
public static double code(double g, double a) {
return Math.cbrt((g / (a + a)));
}
function code(g, a) return cbrt(Float64(g / Float64(a + a))) end
code[g_, a_] := N[Power[N[(g / N[(a + a), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]
\begin{array}{l}
\\
\sqrt[3]{\frac{g}{a + a}}
\end{array}
Initial program 70.7%
lift-*.f64N/A
count-2-revN/A
lower-+.f6470.7
Applied rewrites70.7%
herbie shell --seed 2025003
(FPCore (g a)
:name "2-ancestry mixing, zero discriminant"
:precision binary64
(cbrt (/ g (* 2.0 a))))