VandenBroeck and Keller, Equation (6)

Percentage Accurate: 75.5% → 97.5%

Time: 21.2s

Alternatives: 5

Speedup: 7.1×

• could not determine a ground truth

  1. F = 4.781232058047473e+136
  2. l = -3382436030868242.5

Specification

Math

\[\begin{array}{l} \\ \pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \end{array} \]

FPCore

(FPCore (F l)
 :precision binary64
 (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))

C

double code(double F, double l) {
	return (((double) M_PI) * l) - ((1.0 / (F * F)) * tan((((double) M_PI) * l)));
}

Java

public static double code(double F, double l) {
	return (Math.PI * l) - ((1.0 / (F * F)) * Math.tan((Math.PI * l)));
}

Python

def code(F, l):
	return (math.pi * l) - ((1.0 / (F * F)) * math.tan((math.pi * l)))

Julia

function code(F, l)
	return Float64(Float64(pi * l) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l))))
end

MATLAB

function tmp = code(F, l)
	tmp = (pi * l) - ((1.0 / (F * F)) * tan((pi * l)));
end

Wolfram

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]

Initial Program: 75.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \end{array} \]

FPCore

(FPCore (F l)
 :precision binary64
 (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))

C

double code(double F, double l) {
	return (((double) M_PI) * l) - ((1.0 / (F * F)) * tan((((double) M_PI) * l)));
}

Java

public static double code(double F, double l) {
	return (Math.PI * l) - ((1.0 / (F * F)) * Math.tan((Math.PI * l)));
}

Python

def code(F, l):
	return (math.pi * l) - ((1.0 / (F * F)) * math.tan((math.pi * l)))

Julia

function code(F, l)
	return Float64(Float64(pi * l) - Float64(Float64(1.0 / Float64(F * F)) * tan(Float64(pi * l))))
end

MATLAB

function tmp = code(F, l)
	tmp = (pi * l) - ((1.0 / (F * F)) * tan((pi * l)));
end

Wolfram

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]

Alternative 1: 97.5% accurate, 1.0× speedup

Math

\[\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 2 \cdot 10^{-12}:\\ \;\;\;\;\mathsf{fma}\left(\pi, l\_m, \frac{\frac{\pi \cdot l\_m}{F}}{-F}\right)\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot l\_m\\ \end{array} \end{array} \]

FPCore

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) 2e-12)
    (fma PI l_m (/ (/ (* PI l_m) F) (- F)))
    (* PI l_m))))

C

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) <= 2e-12) {
		tmp = fma(((double) M_PI), l_m, (((((double) M_PI) * l_m) / F) / -F));
	} else {
		tmp = ((double) M_PI) * l_m;
	}
	return l_s * tmp;
}

Julia

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) <= 2e-12)
		tmp = fma(pi, l_m, Float64(Float64(Float64(pi * l_m) / F) / Float64(-F)));
	else
		tmp = Float64(pi * l_m);
	end
	return Float64(l_s * tmp)
end

Wolfram

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], 2e-12], N[(Pi * l$95$m + N[(N[(N[(Pi * l$95$m), $MachinePrecision] / F), $MachinePrecision] / (-F)), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < 1.99999999999999996e-12

   1. Initial program 77.9%

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
   2. Step-by-step derivation

      1. fma-neg 77.9%

         \[\leadsto \color{blue}{\mathsf{fma}\left(\pi, \ell, -\frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)\right)} \]

      2. distribute-lft-neg-in 77.9%

         \[\leadsto \mathsf{fma}\left(\pi, \ell, \color{blue}{\left(-\frac{1}{F \cdot F}\right) \cdot \tan \left(\pi \cdot \ell\right)}\right) \]

      3. sqr-neg 77.9%

         \[\leadsto \mathsf{fma}\left(\pi, \ell, \left(-\frac{1}{\color{blue}{\left(-F\right) \cdot \left(-F\right)}}\right) \cdot \tan \left(\pi \cdot \ell\right)\right) \]

      4. distribute-neg-frac 77.9%

         \[\leadsto \mathsf{fma}\left(\pi, \ell, \color{blue}{\frac{-1}{\left(-F\right) \cdot \left(-F\right)}} \cdot \tan \left(\pi \cdot \ell\right)\right) \]

      5. metadata-eval 77.9%

         \[\leadsto \mathsf{fma}\left(\pi, \ell, \frac{\color{blue}{-1}}{\left(-F\right) \cdot \left(-F\right)} \cdot \tan \left(\pi \cdot \ell\right)\right) \]

      6. distribute-lft-neg-out 77.9%

         \[\leadsto \mathsf{fma}\left(\pi, \ell, \frac{-1}{\color{blue}{-F \cdot \left(-F\right)}} \cdot \tan \left(\pi \cdot \ell\right)\right) \]

      7. neg-mul-1 77.9%

         \[\leadsto \mathsf{fma}\left(\pi, \ell, \frac{-1}{\color{blue}{-1 \cdot \left(F \cdot \left(-F\right)\right)}} \cdot \tan \left(\pi \cdot \ell\right)\right) \]

      8. associate-/r* 77.9%

         \[\leadsto \mathsf{fma}\left(\pi, \ell, \color{blue}{\frac{\frac{-1}{-1}}{F \cdot \left(-F\right)}} \cdot \tan \left(\pi \cdot \ell\right)\right) \]

      9. metadata-eval 77.9%

         \[\leadsto \mathsf{fma}\left(\pi, \ell, \frac{\color{blue}{1}}{F \cdot \left(-F\right)} \cdot \tan \left(\pi \cdot \ell\right)\right) \]

      10. associate-*l/ 78.5%

          \[\leadsto \mathsf{fma}\left(\pi, \ell, \color{blue}{\frac{1 \cdot \tan \left(\pi \cdot \ell\right)}{F \cdot \left(-F\right)}}\right) \]

      11. *-lft-identity 78.5%

          \[\leadsto \mathsf{fma}\left(\pi, \ell, \frac{\color{blue}{\tan \left(\pi \cdot \ell\right)}}{F \cdot \left(-F\right)}\right) \]

      12. associate-/r* 85.6%

          \[\leadsto \mathsf{fma}\left(\pi, \ell, \color{blue}{\frac{\frac{\tan \left(\pi \cdot \ell\right)}{F}}{-F}}\right) \]

   3. Simplified 85.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\pi, \ell, \frac{\frac{\tan \left(\pi \cdot \ell\right)}{F}}{-F}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in l around 0 82.8%

      \[\leadsto \mathsf{fma}\left(\pi, \ell, \frac{\frac{\color{blue}{\ell \cdot \pi}}{F}}{-F}\right) \]

   if 1.99999999999999996e-12 < (*.f64 (PI.f64) l)

   1. Initial program 66.0%

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
   2. Step-by-step derivation

      1. *-commutative 66.0%

         \[\leadsto \pi \cdot \ell - \color{blue}{\tan \left(\pi \cdot \ell\right) \cdot \frac{1}{F \cdot F}} \]

      2. sqr-neg 66.0%

         \[\leadsto \pi \cdot \ell - \tan \left(\pi \cdot \ell\right) \cdot \frac{1}{\color{blue}{\left(-F\right) \cdot \left(-F\right)}} \]

      3. associate-*r/ 66.0%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\tan \left(\pi \cdot \ell\right) \cdot 1}{\left(-F\right) \cdot \left(-F\right)}} \]

      4. *-rgt-identity 66.0%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\tan \left(\pi \cdot \ell\right)}}{\left(-F\right) \cdot \left(-F\right)} \]

      5. sqr-neg 66.0%

         \[\leadsto \pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{\color{blue}{F \cdot F}} \]

   3. Simplified 66.0%

      \[\leadsto \color{blue}{\pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{F \cdot F}} \]
   4. Add Preprocessing

   6. Applied egg-rr 66.5%

      \[\leadsto \color{blue}{\mathsf{hypot}\left(\pi \cdot \ell, \tan \left(\pi \cdot \ell\right) \cdot {F}^{-2}\right)} \]

   7. Taylor expanded in l around inf 99.6%

      \[\leadsto \color{blue}{\ell \cdot \pi} \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\pi \cdot \ell \leq 2 \cdot 10^{-12}:\\ \;\;\;\;\mathsf{fma}\left(\pi, \ell, \frac{\frac{\pi \cdot \ell}{F}}{-F}\right)\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 97.5% accurate, 6.3× speedup

Math

\[\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 2 \cdot 10^{-12}:\\ \;\;\;\;\pi \cdot l\_m - \frac{\frac{\pi \cdot l\_m}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot l\_m\\ \end{array} \end{array} \]

FPCore

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) 2e-12) (- (* PI l_m) (/ (/ (* PI l_m) F) F)) (* PI l_m))))

C

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) <= 2e-12) {
		tmp = (((double) M_PI) * l_m) - (((((double) M_PI) * l_m) / F) / F);
	} else {
		tmp = ((double) M_PI) * l_m;
	}
	return l_s * tmp;
}

Java

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) <= 2e-12) {
		tmp = (Math.PI * l_m) - (((Math.PI * l_m) / F) / F);
	} else {
		tmp = Math.PI * l_m;
	}
	return l_s * tmp;
}

Python

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) <= 2e-12:
		tmp = (math.pi * l_m) - (((math.pi * l_m) / F) / F)
	else:
		tmp = math.pi * l_m
	return l_s * tmp

Julia

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) <= 2e-12)
		tmp = Float64(Float64(pi * l_m) - Float64(Float64(Float64(pi * l_m) / F) / F));
	else
		tmp = Float64(pi * l_m);
	end
	return Float64(l_s * tmp)
end

MATLAB

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) <= 2e-12)
		tmp = (pi * l_m) - (((pi * l_m) / F) / F);
	else
		tmp = pi * l_m;
	end
	tmp_2 = l_s * tmp;
end

Wolfram

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], 2e-12], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[(Pi * l$95$m), $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < 1.99999999999999996e-12

   1. Initial program 77.9%

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-*l/ 78.5%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{1 \cdot \tan \left(\pi \cdot \ell\right)}{F \cdot F}} \]

      2. *-un-lft-identity 78.5%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\tan \left(\pi \cdot \ell\right)}}{F \cdot F} \]

      3. associate-/r* 85.6%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\frac{\tan \left(\pi \cdot \ell\right)}{F}}{F}} \]

   4. Applied egg-rr 85.6%

      \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\frac{\tan \left(\pi \cdot \ell\right)}{F}}{F}} \]

   5. Taylor expanded in l around 0 82.8%

      \[\leadsto \pi \cdot \ell - \frac{\frac{\color{blue}{\ell \cdot \pi}}{F}}{F} \]

   if 1.99999999999999996e-12 < (*.f64 (PI.f64) l)

   1. Initial program 66.0%

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
   2. Step-by-step derivation

      1. *-commutative 66.0%

         \[\leadsto \pi \cdot \ell - \color{blue}{\tan \left(\pi \cdot \ell\right) \cdot \frac{1}{F \cdot F}} \]

      2. sqr-neg 66.0%

         \[\leadsto \pi \cdot \ell - \tan \left(\pi \cdot \ell\right) \cdot \frac{1}{\color{blue}{\left(-F\right) \cdot \left(-F\right)}} \]

      3. associate-*r/ 66.0%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\tan \left(\pi \cdot \ell\right) \cdot 1}{\left(-F\right) \cdot \left(-F\right)}} \]

      4. *-rgt-identity 66.0%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\tan \left(\pi \cdot \ell\right)}}{\left(-F\right) \cdot \left(-F\right)} \]

      5. sqr-neg 66.0%

         \[\leadsto \pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{\color{blue}{F \cdot F}} \]

   3. Simplified 66.0%

      \[\leadsto \color{blue}{\pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{F \cdot F}} \]
   4. Add Preprocessing

   6. Applied egg-rr 66.5%

      \[\leadsto \color{blue}{\mathsf{hypot}\left(\pi \cdot \ell, \tan \left(\pi \cdot \ell\right) \cdot {F}^{-2}\right)} \]

   7. Taylor expanded in l around inf 99.6%

      \[\leadsto \color{blue}{\ell \cdot \pi} \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\pi \cdot \ell \leq 2 \cdot 10^{-12}:\\ \;\;\;\;\pi \cdot \ell - \frac{\frac{\pi \cdot \ell}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.0% accurate, 7.1× speedup

Math

\[\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 1.85 \cdot 10^{-5}:\\ \;\;\;\;\pi \cdot l\_m - \frac{\pi}{F} \cdot \frac{l\_m}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot l\_m\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
l_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
 :precision binary64
 (*
  l_s
  (if (<= l_m 1.85e-5) (- (* PI l_m) (* (/ PI F) (/ l_m F))) (* PI l_m))))

C

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 <= 1.85e-5) {
		tmp = (((double) M_PI) * l_m) - ((((double) M_PI) / F) * (l_m / F));
	} else {
		tmp = ((double) M_PI) * l_m;
	}
	return l_s * tmp;
}

Java

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 <= 1.85e-5) {
		tmp = (Math.PI * l_m) - ((Math.PI / F) * (l_m / F));
	} else {
		tmp = Math.PI * l_m;
	}
	return l_s * tmp;
}

Python

l_m = math.fabs(l)
l_s = math.copysign(1.0, l)
def code(l_s, F, l_m):
	tmp = 0
	if l_m <= 1.85e-5:
		tmp = (math.pi * l_m) - ((math.pi / F) * (l_m / F))
	else:
		tmp = math.pi * l_m
	return l_s * tmp

Julia

l_m = abs(l)
l_s = copysign(1.0, l)
function code(l_s, F, l_m)
	tmp = 0.0
	if (l_m <= 1.85e-5)
		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

MATLAB

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 <= 1.85e-5)
		tmp = (pi * l_m) - ((pi / F) * (l_m / F));
	else
		tmp = pi * l_m;
	end
	tmp_2 = l_s * tmp;
end

Wolfram

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, 1.85e-5], 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]

Derivation

1. Split input into 2 regimes

2. if l < 1.84999999999999991e-5

   1. Initial program 77.9%

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
   2. Step-by-step derivation

      1. *-commutative 77.9%

         \[\leadsto \pi \cdot \ell - \color{blue}{\tan \left(\pi \cdot \ell\right) \cdot \frac{1}{F \cdot F}} \]

      2. sqr-neg 77.9%

         \[\leadsto \pi \cdot \ell - \tan \left(\pi \cdot \ell\right) \cdot \frac{1}{\color{blue}{\left(-F\right) \cdot \left(-F\right)}} \]

      3. associate-*r/ 78.5%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\tan \left(\pi \cdot \ell\right) \cdot 1}{\left(-F\right) \cdot \left(-F\right)}} \]

      4. *-rgt-identity 78.5%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\tan \left(\pi \cdot \ell\right)}}{\left(-F\right) \cdot \left(-F\right)} \]

      5. sqr-neg 78.5%

         \[\leadsto \pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{\color{blue}{F \cdot F}} \]

   3. Simplified 78.5%

      \[\leadsto \color{blue}{\pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{F \cdot F}} \]
   4. Add Preprocessing

   5. Taylor expanded in l around 0 75.7%

      \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\ell \cdot \pi}}{F \cdot F} \]
   6. Step-by-step derivation

      1. *-commutative 75.7%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\pi \cdot \ell}}{F \cdot F} \]

      2. times-frac 82.8%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\pi}{F} \cdot \frac{\ell}{F}} \]

   7. Applied egg-rr 82.8%

      \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\pi}{F} \cdot \frac{\ell}{F}} \]

   if 1.84999999999999991e-5 < l

   1. Initial program 66.0%

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
   2. Step-by-step derivation

      1. *-commutative 66.0%

         \[\leadsto \pi \cdot \ell - \color{blue}{\tan \left(\pi \cdot \ell\right) \cdot \frac{1}{F \cdot F}} \]

      2. sqr-neg 66.0%

         \[\leadsto \pi \cdot \ell - \tan \left(\pi \cdot \ell\right) \cdot \frac{1}{\color{blue}{\left(-F\right) \cdot \left(-F\right)}} \]

      3. associate-*r/ 66.0%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\tan \left(\pi \cdot \ell\right) \cdot 1}{\left(-F\right) \cdot \left(-F\right)}} \]

      4. *-rgt-identity 66.0%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\tan \left(\pi \cdot \ell\right)}}{\left(-F\right) \cdot \left(-F\right)} \]

      5. sqr-neg 66.0%

         \[\leadsto \pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{\color{blue}{F \cdot F}} \]

   3. Simplified 66.0%

      \[\leadsto \color{blue}{\pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{F \cdot F}} \]
   4. Add Preprocessing

   6. Applied egg-rr 66.5%

      \[\leadsto \color{blue}{\mathsf{hypot}\left(\pi \cdot \ell, \tan \left(\pi \cdot \ell\right) \cdot {F}^{-2}\right)} \]

   7. Taylor expanded in l around inf 99.6%

      \[\leadsto \color{blue}{\ell \cdot \pi} \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq 1.85 \cdot 10^{-5}:\\ \;\;\;\;\pi \cdot \ell - \frac{\pi}{F} \cdot \frac{\ell}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.0% accurate, 7.1× speedup

Math

\[\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 1.85 \cdot 10^{-5}:\\ \;\;\;\;\pi \cdot l\_m - \frac{\pi}{F \cdot \frac{F}{l\_m}}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot l\_m\\ \end{array} \end{array} \]

FPCore

l_m = (fabs.f64 l)
l_s = (copysign.f64 1 l)
(FPCore (l_s F l_m)
 :precision binary64
 (*
  l_s
  (if (<= l_m 1.85e-5) (- (* PI l_m) (/ PI (* F (/ F l_m)))) (* PI l_m))))

C

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 <= 1.85e-5) {
		tmp = (((double) M_PI) * l_m) - (((double) M_PI) / (F * (F / l_m)));
	} else {
		tmp = ((double) M_PI) * l_m;
	}
	return l_s * tmp;
}

Java

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 <= 1.85e-5) {
		tmp = (Math.PI * l_m) - (Math.PI / (F * (F / l_m)));
	} else {
		tmp = Math.PI * l_m;
	}
	return l_s * tmp;
}

Python

l_m = math.fabs(l)
l_s = math.copysign(1.0, l)
def code(l_s, F, l_m):
	tmp = 0
	if l_m <= 1.85e-5:
		tmp = (math.pi * l_m) - (math.pi / (F * (F / l_m)))
	else:
		tmp = math.pi * l_m
	return l_s * tmp

Julia

l_m = abs(l)
l_s = copysign(1.0, l)
function code(l_s, F, l_m)
	tmp = 0.0
	if (l_m <= 1.85e-5)
		tmp = Float64(Float64(pi * l_m) - Float64(pi / Float64(F * Float64(F / l_m))));
	else
		tmp = Float64(pi * l_m);
	end
	return Float64(l_s * tmp)
end

MATLAB

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 <= 1.85e-5)
		tmp = (pi * l_m) - (pi / (F * (F / l_m)));
	else
		tmp = pi * l_m;
	end
	tmp_2 = l_s * tmp;
end

Wolfram

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, 1.85e-5], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(Pi / N[(F * N[(F / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 1.84999999999999991e-5

   1. Initial program 77.9%

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
   2. Step-by-step derivation

      1. *-commutative 77.9%

         \[\leadsto \pi \cdot \ell - \color{blue}{\tan \left(\pi \cdot \ell\right) \cdot \frac{1}{F \cdot F}} \]

      2. sqr-neg 77.9%

         \[\leadsto \pi \cdot \ell - \tan \left(\pi \cdot \ell\right) \cdot \frac{1}{\color{blue}{\left(-F\right) \cdot \left(-F\right)}} \]

      3. associate-*r/ 78.5%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\tan \left(\pi \cdot \ell\right) \cdot 1}{\left(-F\right) \cdot \left(-F\right)}} \]

      4. *-rgt-identity 78.5%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\tan \left(\pi \cdot \ell\right)}}{\left(-F\right) \cdot \left(-F\right)} \]

      5. sqr-neg 78.5%

         \[\leadsto \pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{\color{blue}{F \cdot F}} \]

   3. Simplified 78.5%

      \[\leadsto \color{blue}{\pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{F \cdot F}} \]
   4. Add Preprocessing

   5. Taylor expanded in l around 0 75.7%

      \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\ell \cdot \pi}}{F \cdot F} \]
   6. Step-by-step derivation

      1. *-commutative 75.7%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\pi \cdot \ell}}{F \cdot F} \]

      2. times-frac 82.8%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\pi}{F} \cdot \frac{\ell}{F}} \]

   7. Applied egg-rr 82.8%

      \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\pi}{F} \cdot \frac{\ell}{F}} \]
   8. Step-by-step derivation

      1. *-commutative 82.8%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\ell}{F} \cdot \frac{\pi}{F}} \]

      2. clear-num 82.7%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{1}{\frac{F}{\ell}}} \cdot \frac{\pi}{F} \]

      3. frac-times 82.8%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{1 \cdot \pi}{\frac{F}{\ell} \cdot F}} \]

      4. *-un-lft-identity 82.8%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\pi}}{\frac{F}{\ell} \cdot F} \]

   9. Applied egg-rr 82.8%

      \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\pi}{\frac{F}{\ell} \cdot F}} \]

   if 1.84999999999999991e-5 < l

   1. Initial program 66.0%

      \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
   2. Step-by-step derivation

      1. *-commutative 66.0%

         \[\leadsto \pi \cdot \ell - \color{blue}{\tan \left(\pi \cdot \ell\right) \cdot \frac{1}{F \cdot F}} \]

      2. sqr-neg 66.0%

         \[\leadsto \pi \cdot \ell - \tan \left(\pi \cdot \ell\right) \cdot \frac{1}{\color{blue}{\left(-F\right) \cdot \left(-F\right)}} \]

      3. associate-*r/ 66.0%

         \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\tan \left(\pi \cdot \ell\right) \cdot 1}{\left(-F\right) \cdot \left(-F\right)}} \]

      4. *-rgt-identity 66.0%

         \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\tan \left(\pi \cdot \ell\right)}}{\left(-F\right) \cdot \left(-F\right)} \]

      5. sqr-neg 66.0%

         \[\leadsto \pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{\color{blue}{F \cdot F}} \]

   3. Simplified 66.0%

      \[\leadsto \color{blue}{\pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{F \cdot F}} \]
   4. Add Preprocessing

   6. Applied egg-rr 66.5%

      \[\leadsto \color{blue}{\mathsf{hypot}\left(\pi \cdot \ell, \tan \left(\pi \cdot \ell\right) \cdot {F}^{-2}\right)} \]

   7. Taylor expanded in l around inf 99.6%

      \[\leadsto \color{blue}{\ell \cdot \pi} \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq 1.85 \cdot 10^{-5}:\\ \;\;\;\;\pi \cdot \ell - \frac{\pi}{F \cdot \frac{F}{\ell}}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.6% accurate, 37.7× speedup

Math

\[\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} \]

FPCore

l_m = (fabs.f64 l)
l_s = (copysign.f64 1 l)
(FPCore (l_s F l_m) :precision binary64 (* l_s (* PI l_m)))

C

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);
}

Java

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);
}

Python

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)

Julia

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

MATLAB

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

Wolfram

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]

Derivation

1. Initial program 74.6%

   \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
2. Step-by-step derivation

   1. *-commutative 74.6%

      \[\leadsto \pi \cdot \ell - \color{blue}{\tan \left(\pi \cdot \ell\right) \cdot \frac{1}{F \cdot F}} \]

   2. sqr-neg 74.6%

      \[\leadsto \pi \cdot \ell - \tan \left(\pi \cdot \ell\right) \cdot \frac{1}{\color{blue}{\left(-F\right) \cdot \left(-F\right)}} \]

   3. associate-*r/ 75.0%

      \[\leadsto \pi \cdot \ell - \color{blue}{\frac{\tan \left(\pi \cdot \ell\right) \cdot 1}{\left(-F\right) \cdot \left(-F\right)}} \]

   4. *-rgt-identity 75.0%

      \[\leadsto \pi \cdot \ell - \frac{\color{blue}{\tan \left(\pi \cdot \ell\right)}}{\left(-F\right) \cdot \left(-F\right)} \]

   5. sqr-neg 75.0%

      \[\leadsto \pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{\color{blue}{F \cdot F}} \]

3. Simplified 75.0%

   \[\leadsto \color{blue}{\pi \cdot \ell - \frac{\tan \left(\pi \cdot \ell\right)}{F \cdot F}} \]
4. Add Preprocessing

6. Applied egg-rr 38.9%

   \[\leadsto \color{blue}{\mathsf{hypot}\left(\pi \cdot \ell, \tan \left(\pi \cdot \ell\right) \cdot {F}^{-2}\right)} \]

7. Taylor expanded in l around inf 74.0%

   \[\leadsto \color{blue}{\ell \cdot \pi} \]

8. Final simplification 74.0%

   \[\leadsto \pi \cdot \ell \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024041 
(FPCore (F l)
  :name "VandenBroeck and Keller, Equation (6)"
  :precision binary64
  (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))