
(FPCore (F l) :precision binary64 (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))
double code(double F, double l) {
return (((double) M_PI) * l) - ((1.0 / (F * F)) * tan((((double) M_PI) * l)));
}
public static double code(double F, double l) {
return (Math.PI * l) - ((1.0 / (F * F)) * Math.tan((Math.PI * l)));
}
def code(F, l): return (math.pi * l) - ((1.0 / (F * F)) * math.tan((math.pi * l)))
function code(F, l) return Float64(Float64(pi * l) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l)))) end
function tmp = code(F, l) tmp = (pi * l) - ((1.0 / (F * F)) * tan((pi * l))); end
code[F_, l_] := N[(N[(Pi * l), $MachinePrecision] - N[(N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] * N[Tan[N[(Pi * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (F l) :precision binary64 (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))
double code(double F, double l) {
return (((double) M_PI) * l) - ((1.0 / (F * F)) * tan((((double) M_PI) * l)));
}
public static double code(double F, double l) {
return (Math.PI * l) - ((1.0 / (F * F)) * Math.tan((Math.PI * l)));
}
def code(F, l): return (math.pi * l) - ((1.0 / (F * F)) * math.tan((math.pi * l)))
function code(F, l) return Float64(Float64(pi * l) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l)))) end
function tmp = code(F, l) tmp = (pi * l) - ((1.0 / (F * F)) * tan((pi * l))); end
code[F_, l_] := N[(N[(Pi * l), $MachinePrecision] - N[(N[(1.0 / N[(F * F), $MachinePrecision]), $MachinePrecision] * N[Tan[N[(Pi * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)
\end{array}
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 1500000000.0)
(+ (* PI l_m) (/ -1.0 (/ F (/ (tan (* PI l_m)) F))))
(* PI l_m))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 1500000000.0) {
tmp = (((double) M_PI) * l_m) + (-1.0 / (F / (tan((((double) M_PI) * l_m)) / F)));
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if ((Math.PI * l_m) <= 1500000000.0) {
tmp = (Math.PI * l_m) + (-1.0 / (F / (Math.tan((Math.PI * l_m)) / F)));
} else {
tmp = Math.PI * l_m;
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if (math.pi * l_m) <= 1500000000.0: tmp = (math.pi * l_m) + (-1.0 / (F / (math.tan((math.pi * l_m)) / F))) else: tmp = math.pi * l_m return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 1500000000.0) tmp = Float64(Float64(pi * l_m) + Float64(-1.0 / Float64(F / Float64(tan(Float64(pi * l_m)) / F)))); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if ((pi * l_m) <= 1500000000.0) tmp = (pi * l_m) + (-1.0 / (F / (tan((pi * l_m)) / F))); else tmp = pi * l_m; end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 1500000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(-1.0 / N[(F / N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 1500000000:\\
\;\;\;\;\pi \cdot l\_m + \frac{-1}{\frac{F}{\frac{\tan \left(\pi \cdot l\_m\right)}{F}}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1.5e9Initial program 81.6%
associate-*l/81.6%
*-un-lft-identity81.6%
associate-/r*88.1%
clear-num88.1%
Applied egg-rr88.1%
if 1.5e9 < (*.f64 (PI.f64) l) Initial program 69.9%
*-commutative69.9%
sqr-neg69.9%
associate-*r/69.9%
sqr-neg69.9%
*-rgt-identity69.9%
Simplified69.9%
Taylor expanded in l around 0 55.6%
*-commutative55.6%
times-frac55.6%
Applied egg-rr55.6%
Taylor expanded in F around inf 99.7%
Final simplification90.8%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 1500000000.0)
(- (* PI l_m) (/ (/ (tan (* PI l_m)) F) F))
(* PI l_m))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 1500000000.0) {
tmp = (((double) M_PI) * l_m) - ((tan((((double) M_PI) * l_m)) / F) / F);
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if ((Math.PI * l_m) <= 1500000000.0) {
tmp = (Math.PI * l_m) - ((Math.tan((Math.PI * l_m)) / F) / F);
} else {
tmp = Math.PI * l_m;
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if (math.pi * l_m) <= 1500000000.0: tmp = (math.pi * l_m) - ((math.tan((math.pi * l_m)) / F) / F) else: tmp = math.pi * l_m return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 1500000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(tan(Float64(pi * l_m)) / F) / F)); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if ((pi * l_m) <= 1500000000.0) tmp = (pi * l_m) - ((tan((pi * l_m)) / F) / F); else tmp = pi * l_m; end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 1500000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 1500000000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\tan \left(\pi \cdot l\_m\right)}{F}}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1.5e9Initial program 81.6%
associate-*l/81.6%
*-un-lft-identity81.6%
associate-/r*88.1%
Applied egg-rr88.1%
if 1.5e9 < (*.f64 (PI.f64) l) Initial program 69.9%
*-commutative69.9%
sqr-neg69.9%
associate-*r/69.9%
sqr-neg69.9%
*-rgt-identity69.9%
Simplified69.9%
Taylor expanded in l around 0 55.6%
*-commutative55.6%
times-frac55.6%
Applied egg-rr55.6%
Taylor expanded in F around inf 99.7%
Final simplification90.8%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (or (<= F 8e-142) (not (<= F 1.58e-27)))
(* PI l_m)
(/ (* l_m (/ (- PI) F)) F))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((F <= 8e-142) || !(F <= 1.58e-27)) {
tmp = ((double) M_PI) * l_m;
} else {
tmp = (l_m * (-((double) M_PI) / F)) / F;
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if ((F <= 8e-142) || !(F <= 1.58e-27)) {
tmp = Math.PI * l_m;
} else {
tmp = (l_m * (-Math.PI / F)) / F;
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if (F <= 8e-142) or not (F <= 1.58e-27): tmp = math.pi * l_m else: tmp = (l_m * (-math.pi / F)) / F return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if ((F <= 8e-142) || !(F <= 1.58e-27)) tmp = Float64(pi * l_m); else tmp = Float64(Float64(l_m * Float64(Float64(-pi) / F)) / F); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if ((F <= 8e-142) || ~((F <= 1.58e-27))) tmp = pi * l_m; else tmp = (l_m * (-pi / F)) / F; end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[Or[LessEqual[F, 8e-142], N[Not[LessEqual[F, 1.58e-27]], $MachinePrecision]], N[(Pi * l$95$m), $MachinePrecision], N[(N[(l$95$m * N[((-Pi) / F), $MachinePrecision]), $MachinePrecision] / F), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;F \leq 8 \cdot 10^{-142} \lor \neg \left(F \leq 1.58 \cdot 10^{-27}\right):\\
\;\;\;\;\pi \cdot l\_m\\
\mathbf{else}:\\
\;\;\;\;\frac{l\_m \cdot \frac{-\pi}{F}}{F}\\
\end{array}
\end{array}
if F < 8.0000000000000003e-142 or 1.58e-27 < F Initial program 77.8%
*-commutative77.8%
sqr-neg77.8%
associate-*r/77.8%
sqr-neg77.8%
*-rgt-identity77.8%
Simplified77.8%
Taylor expanded in l around 0 72.6%
*-commutative72.6%
times-frac78.1%
Applied egg-rr78.1%
Taylor expanded in F around inf 78.1%
if 8.0000000000000003e-142 < F < 1.58e-27Initial program 89.5%
*-commutative89.5%
sqr-neg89.5%
associate-*r/89.7%
sqr-neg89.7%
*-rgt-identity89.7%
Simplified89.7%
Taylor expanded in F around 0 89.7%
*-commutative89.7%
*-commutative89.7%
associate-*l*89.8%
Simplified89.8%
Taylor expanded in l around 0 60.5%
*-commutative60.5%
associate-/l*60.5%
*-lft-identity60.5%
distribute-rgt-out--60.5%
unpow260.5%
fma-neg60.5%
metadata-eval60.5%
Simplified60.5%
pow260.5%
associate-*r/60.5%
associate-/r*60.4%
associate-*l*60.4%
Applied egg-rr60.4%
Taylor expanded in F around 0 60.4%
mul-1-neg60.4%
associate-/l*60.6%
distribute-lft-neg-in60.6%
Simplified60.6%
Final simplification76.6%
l\_m = (fabs.f64 l)
l\_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
:precision binary64
(*
l_s
(if (<= (* PI l_m) 1500000000.0)
(- (* PI l_m) (/ (/ PI F) (/ F l_m)))
(* PI l_m))))l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if ((((double) M_PI) * l_m) <= 1500000000.0) {
tmp = (((double) M_PI) * l_m) - ((((double) M_PI) / F) / (F / l_m));
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if ((Math.PI * l_m) <= 1500000000.0) {
tmp = (Math.PI * l_m) - ((Math.PI / F) / (F / l_m));
} else {
tmp = Math.PI * l_m;
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if (math.pi * l_m) <= 1500000000.0: tmp = (math.pi * l_m) - ((math.pi / F) / (F / l_m)) else: tmp = math.pi * l_m return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (Float64(pi * l_m) <= 1500000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(pi / F) / Float64(F / l_m))); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if ((pi * l_m) <= 1500000000.0) tmp = (pi * l_m) - ((pi / F) / (F / l_m)); else tmp = pi * l_m; end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 1500000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(Pi / F), $MachinePrecision] / N[(F / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;\pi \cdot l\_m \leq 1500000000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\frac{\pi}{F}}{\frac{F}{l\_m}}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if (*.f64 (PI.f64) l) < 1.5e9Initial program 81.6%
*-commutative81.6%
sqr-neg81.6%
associate-*r/81.6%
sqr-neg81.6%
*-rgt-identity81.6%
Simplified81.6%
Taylor expanded in l around 0 76.4%
*-commutative76.4%
times-frac82.9%
Applied egg-rr82.9%
clear-num82.9%
un-div-inv82.9%
Applied egg-rr82.9%
if 1.5e9 < (*.f64 (PI.f64) l) Initial program 69.9%
*-commutative69.9%
sqr-neg69.9%
associate-*r/69.9%
sqr-neg69.9%
*-rgt-identity69.9%
Simplified69.9%
Taylor expanded in l around 0 55.6%
*-commutative55.6%
times-frac55.6%
Applied egg-rr55.6%
Taylor expanded in F around inf 99.7%
Final simplification86.9%
l\_m = (fabs.f64 l) l\_s = (copysign.f64 1 l) (FPCore (l_s F l_m) :precision binary64 (* l_s (if (<= l_m 460000000.0) (- (* PI l_m) (* (/ PI F) (/ l_m F))) (* PI l_m))))
l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
double tmp;
if (l_m <= 460000000.0) {
tmp = (((double) M_PI) * l_m) - ((((double) M_PI) / F) * (l_m / F));
} else {
tmp = ((double) M_PI) * l_m;
}
return l_s * tmp;
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
double tmp;
if (l_m <= 460000000.0) {
tmp = (Math.PI * l_m) - ((Math.PI / F) * (l_m / F));
} else {
tmp = Math.PI * l_m;
}
return l_s * tmp;
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): tmp = 0 if l_m <= 460000000.0: tmp = (math.pi * l_m) - ((math.pi / F) * (l_m / F)) else: tmp = math.pi * l_m return l_s * tmp
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) tmp = 0.0 if (l_m <= 460000000.0) tmp = Float64(Float64(pi * l_m) - Float64(Float64(pi / F) * Float64(l_m / F))); else tmp = Float64(pi * l_m); end return Float64(l_s * tmp) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp_2 = code(l_s, F, l_m) tmp = 0.0; if (l_m <= 460000000.0) tmp = (pi * l_m) - ((pi / F) * (l_m / F)); else tmp = pi * l_m; end tmp_2 = l_s * tmp; end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * If[LessEqual[l$95$m, 460000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(Pi / F), $MachinePrecision] * N[(l$95$m / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \begin{array}{l}
\mathbf{if}\;l\_m \leq 460000000:\\
\;\;\;\;\pi \cdot l\_m - \frac{\pi}{F} \cdot \frac{l\_m}{F}\\
\mathbf{else}:\\
\;\;\;\;\pi \cdot l\_m\\
\end{array}
\end{array}
if l < 4.6e8Initial program 81.6%
*-commutative81.6%
sqr-neg81.6%
associate-*r/81.6%
sqr-neg81.6%
*-rgt-identity81.6%
Simplified81.6%
Taylor expanded in l around 0 76.4%
*-commutative76.4%
times-frac82.9%
Applied egg-rr82.9%
if 4.6e8 < l Initial program 69.9%
*-commutative69.9%
sqr-neg69.9%
associate-*r/69.9%
sqr-neg69.9%
*-rgt-identity69.9%
Simplified69.9%
Taylor expanded in l around 0 55.6%
*-commutative55.6%
times-frac55.6%
Applied egg-rr55.6%
Taylor expanded in F around inf 99.7%
Final simplification86.8%
l\_m = (fabs.f64 l) l\_s = (copysign.f64 1 l) (FPCore (l_s F l_m) :precision binary64 (* l_s (* PI l_m)))
l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
return l_s * (((double) M_PI) * l_m);
}
l\_m = Math.abs(l);
l\_s = Math.copySign(1.0, l);
public static double code(double l_s, double F, double l_m) {
return l_s * (Math.PI * l_m);
}
l\_m = math.fabs(l) l\_s = math.copysign(1.0, l) def code(l_s, F, l_m): return l_s * (math.pi * l_m)
l\_m = abs(l) l\_s = copysign(1.0, l) function code(l_s, F, l_m) return Float64(l_s * Float64(pi * l_m)) end
l\_m = abs(l); l\_s = sign(l) * abs(1.0); function tmp = code(l_s, F, l_m) tmp = l_s * (pi * l_m); end
l\_m = N[Abs[l], $MachinePrecision]
l\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[l]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[l$95$s_, F_, l$95$m_] := N[(l$95$s * N[(Pi * l$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
l\_m = \left|\ell\right|
\\
l\_s = \mathsf{copysign}\left(1, \ell\right)
\\
l\_s \cdot \left(\pi \cdot l\_m\right)
\end{array}
Initial program 78.8%
*-commutative78.8%
sqr-neg78.8%
associate-*r/78.9%
sqr-neg78.9%
*-rgt-identity78.9%
Simplified78.9%
Taylor expanded in l around 0 71.5%
*-commutative71.5%
times-frac76.5%
Applied egg-rr76.5%
Taylor expanded in F around inf 74.4%
Final simplification74.4%
herbie shell --seed 2024096
(FPCore (F l)
:name "VandenBroeck and Keller, Equation (6)"
:precision binary64
(- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))