VandenBroeck and Keller, Equation (6)

Percentage Accurate: 77.1% → 97.8%

Time: 15.9s

Alternatives: 6

Speedup: 8.1×

• could not determine a ground truth

  1. F = 1.8078767596204728e+256
  2. l = 869653386963855.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: 77.1% 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.8% 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 5 \cdot 10^{-8}:\\ \;\;\;\;\pi \cdot l\_m - \frac{\frac{\pi}{F}}{\frac{F}{l\_m}}\\ \mathbf{else}:\\ \;\;\;\;l\_m \cdot \pi\\ \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) 5e-8) (- (* PI l_m) (/ (/ PI F) (/ F l_m))) (* l_m PI))))

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) <= 5e-8) {
		tmp = (((double) M_PI) * l_m) - ((((double) M_PI) / F) / (F / l_m));
	} else {
		tmp = l_m * ((double) M_PI);
	}
	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) <= 5e-8) {
		tmp = (Math.PI * l_m) - ((Math.PI / F) / (F / l_m));
	} else {
		tmp = l_m * Math.PI;
	}
	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) <= 5e-8:
		tmp = (math.pi * l_m) - ((math.pi / F) / (F / l_m))
	else:
		tmp = l_m * math.pi
	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) <= 5e-8)
		tmp = Float64(Float64(pi * l_m) - Float64(Float64(pi / F) / Float64(F / l_m)));
	else
		tmp = Float64(l_m * pi);
	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) <= 5e-8)
		tmp = (pi * l_m) - ((pi / F) / (F / l_m));
	else
		tmp = l_m * pi;
	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], 5e-8], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(Pi / F), $MachinePrecision] / N[(F / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(l$95$m * Pi), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < 4.9999999999999998e-8

   1. Initial program 76.4%

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

      1. *-commutative 76.4%

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

      2. sqr-neg 76.4%

         \[\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/ 77.0%

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

      4. sqr-neg 77.0%

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

      5. *-rgt-identity 77.0%

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

   3. Simplified 77.0%

      \[\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 74.6%

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

      1. *-commutative 74.6%

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

      2. *-un-lft-identity 74.6%

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

      3. associate-*r/ 74.6%

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

      4. times-frac 82.6%

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

      5. associate-/l* 82.6%

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

   7. Applied egg-rr 82.6%

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

      1. associate-*r* 82.6%

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

      2. clear-num 82.6%

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

      3. un-div-inv 82.6%

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

      4. associate-*l/ 82.6%

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

      5. *-un-lft-identity 82.6%

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

   9. Applied egg-rr 82.6%

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

   if 4.9999999999999998e-8 < (*.f64 (PI.f64) l)

   1. Initial program 76.0%

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

      1. *-commutative 76.0%

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

      2. sqr-neg 76.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/ 76.0%

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

      4. sqr-neg 76.0%

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

      5. *-rgt-identity 76.0%

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

   3. Simplified 76.0%

      \[\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 inf 99.6%

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

Alternative 2: 92.1% 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 4.4 \cdot 10^{-6}:\\ \;\;\;\;l\_m \cdot \left(\pi - \frac{1}{\frac{F}{\pi} \cdot F}\right)\\ \mathbf{else}:\\ \;\;\;\;l\_m \cdot \pi\\ \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 4.4e-6) (* l_m (- PI (/ 1.0 (* (/ F PI) F)))) (* l_m PI))))

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 <= 4.4e-6) {
		tmp = l_m * (((double) M_PI) - (1.0 / ((F / ((double) M_PI)) * F)));
	} else {
		tmp = l_m * ((double) M_PI);
	}
	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 <= 4.4e-6) {
		tmp = l_m * (Math.PI - (1.0 / ((F / Math.PI) * F)));
	} else {
		tmp = l_m * Math.PI;
	}
	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 <= 4.4e-6:
		tmp = l_m * (math.pi - (1.0 / ((F / math.pi) * F)))
	else:
		tmp = l_m * math.pi
	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 <= 4.4e-6)
		tmp = Float64(l_m * Float64(pi - Float64(1.0 / Float64(Float64(F / pi) * F))));
	else
		tmp = Float64(l_m * pi);
	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 <= 4.4e-6)
		tmp = l_m * (pi - (1.0 / ((F / pi) * F)));
	else
		tmp = l_m * pi;
	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, 4.4e-6], N[(l$95$m * N[(Pi - N[(1.0 / N[(N[(F / Pi), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(l$95$m * Pi), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 4.4000000000000002e-6

   1. Initial program 76.4%

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

      1. *-commutative 76.4%

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

      2. sqr-neg 76.4%

         \[\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/ 77.0%

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

      4. sqr-neg 77.0%

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

      5. *-rgt-identity 77.0%

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

   3. Simplified 77.0%

      \[\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 74.0%

      \[\leadsto \color{blue}{\ell \cdot \left(\pi - \frac{\pi}{{F}^{2}}\right)} \]
   6. Step-by-step derivation

      1. *-un-lft-identity 74.0%

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

      2. pow2 74.0%

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

      3. times-frac 74.0%

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

   7. Applied egg-rr 74.0%

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

      1. *-commutative 74.0%

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

      2. clear-num 74.0%

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

      3. frac-times 74.0%

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

      4. metadata-eval 74.0%

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

   9. Applied egg-rr 74.0%

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

   if 4.4000000000000002e-6 < l

   1. Initial program 76.0%

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

      1. *-commutative 76.0%

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

      2. sqr-neg 76.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/ 76.0%

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

      4. sqr-neg 76.0%

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

      5. *-rgt-identity 76.0%

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

   3. Simplified 76.0%

      \[\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 inf 99.6%

      \[\leadsto \color{blue}{\ell \cdot \pi} \]
3. Recombined 2 regimes into one program.
4. 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 4.4 \cdot 10^{-6}:\\ \;\;\;\;\pi \cdot l\_m - \frac{\pi}{F} \cdot \frac{l\_m}{F}\\ \mathbf{else}:\\ \;\;\;\;l\_m \cdot \pi\\ \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 4.4e-6) (- (* PI l_m) (* (/ PI F) (/ l_m F))) (* l_m PI))))

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 <= 4.4e-6) {
		tmp = (((double) M_PI) * l_m) - ((((double) M_PI) / F) * (l_m / F));
	} else {
		tmp = l_m * ((double) M_PI);
	}
	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 <= 4.4e-6) {
		tmp = (Math.PI * l_m) - ((Math.PI / F) * (l_m / F));
	} else {
		tmp = l_m * Math.PI;
	}
	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 <= 4.4e-6:
		tmp = (math.pi * l_m) - ((math.pi / F) * (l_m / F))
	else:
		tmp = l_m * math.pi
	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 <= 4.4e-6)
		tmp = Float64(Float64(pi * l_m) - Float64(Float64(pi / F) * Float64(l_m / F)));
	else
		tmp = Float64(l_m * pi);
	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 <= 4.4e-6)
		tmp = (pi * l_m) - ((pi / F) * (l_m / F));
	else
		tmp = l_m * pi;
	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, 4.4e-6], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(Pi / F), $MachinePrecision] * N[(l$95$m / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(l$95$m * Pi), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 4.4000000000000002e-6

   1. Initial program 76.4%

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

      1. *-commutative 76.4%

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

      2. sqr-neg 76.4%

         \[\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/ 77.0%

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

      4. sqr-neg 77.0%

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

      5. *-rgt-identity 77.0%

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

   3. Simplified 77.0%

      \[\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 74.6%

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

      1. *-commutative 74.6%

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

      2. times-frac 82.6%

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

   7. Applied egg-rr 82.6%

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

   if 4.4000000000000002e-6 < l

   1. Initial program 76.0%

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

      1. *-commutative 76.0%

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

      2. sqr-neg 76.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/ 76.0%

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

      4. sqr-neg 76.0%

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

      5. *-rgt-identity 76.0%

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

   3. Simplified 76.0%

      \[\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 inf 99.6%

      \[\leadsto \color{blue}{\ell \cdot \pi} \]
3. Recombined 2 regimes into one program.
4. 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 4.4 \cdot 10^{-6}:\\ \;\;\;\;\pi \cdot l\_m - \frac{\pi \cdot \frac{l\_m}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;l\_m \cdot \pi\\ \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 4.4e-6) (- (* PI l_m) (/ (* PI (/ l_m F)) F)) (* l_m PI))))

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 <= 4.4e-6) {
		tmp = (((double) M_PI) * l_m) - ((((double) M_PI) * (l_m / F)) / F);
	} else {
		tmp = l_m * ((double) M_PI);
	}
	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 <= 4.4e-6) {
		tmp = (Math.PI * l_m) - ((Math.PI * (l_m / F)) / F);
	} else {
		tmp = l_m * Math.PI;
	}
	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 <= 4.4e-6:
		tmp = (math.pi * l_m) - ((math.pi * (l_m / F)) / F)
	else:
		tmp = l_m * math.pi
	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 <= 4.4e-6)
		tmp = Float64(Float64(pi * l_m) - Float64(Float64(pi * Float64(l_m / F)) / F));
	else
		tmp = Float64(l_m * pi);
	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 <= 4.4e-6)
		tmp = (pi * l_m) - ((pi * (l_m / F)) / F);
	else
		tmp = l_m * pi;
	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, 4.4e-6], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(Pi * N[(l$95$m / F), $MachinePrecision]), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(l$95$m * Pi), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 4.4000000000000002e-6

   1. Initial program 76.4%

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

      1. *-commutative 76.4%

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

      2. sqr-neg 76.4%

         \[\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/ 77.0%

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

      4. sqr-neg 77.0%

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

      5. *-rgt-identity 77.0%

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

   3. Simplified 77.0%

      \[\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 74.6%

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

      1. *-commutative 74.6%

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

      2. *-un-lft-identity 74.6%

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

      3. associate-*r/ 74.6%

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

      4. times-frac 82.6%

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

      5. associate-/l* 82.6%

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

   7. Applied egg-rr 82.6%

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

      1. associate-*l/ 82.6%

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

      2. *-un-lft-identity 82.6%

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

   9. Applied egg-rr 82.6%

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

   if 4.4000000000000002e-6 < l

   1. Initial program 76.0%

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

      1. *-commutative 76.0%

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

      2. sqr-neg 76.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/ 76.0%

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

      4. sqr-neg 76.0%

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

      5. *-rgt-identity 76.0%

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

   3. Simplified 76.0%

      \[\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 inf 99.6%

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

Alternative 5: 92.2% accurate, 8.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 4.4 \cdot 10^{-6}:\\ \;\;\;\;l\_m \cdot \left(\pi - \frac{\frac{\pi}{F}}{F}\right)\\ \mathbf{else}:\\ \;\;\;\;l\_m \cdot \pi\\ \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 4.4e-6) (* l_m (- PI (/ (/ PI F) F))) (* l_m PI))))

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 <= 4.4e-6) {
		tmp = l_m * (((double) M_PI) - ((((double) M_PI) / F) / F));
	} else {
		tmp = l_m * ((double) M_PI);
	}
	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 <= 4.4e-6) {
		tmp = l_m * (Math.PI - ((Math.PI / F) / F));
	} else {
		tmp = l_m * Math.PI;
	}
	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 <= 4.4e-6:
		tmp = l_m * (math.pi - ((math.pi / F) / F))
	else:
		tmp = l_m * math.pi
	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 <= 4.4e-6)
		tmp = Float64(l_m * Float64(pi - Float64(Float64(pi / F) / F)));
	else
		tmp = Float64(l_m * pi);
	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 <= 4.4e-6)
		tmp = l_m * (pi - ((pi / F) / F));
	else
		tmp = l_m * pi;
	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, 4.4e-6], N[(l$95$m * N[(Pi - N[(N[(Pi / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(l$95$m * Pi), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if l < 4.4000000000000002e-6

   1. Initial program 76.4%

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

      1. *-commutative 76.4%

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

      2. sqr-neg 76.4%

         \[\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/ 77.0%

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

      4. sqr-neg 77.0%

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

      5. *-rgt-identity 77.0%

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

   3. Simplified 77.0%

      \[\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 74.0%

      \[\leadsto \color{blue}{\ell \cdot \left(\pi - \frac{\pi}{{F}^{2}}\right)} \]
   6. Step-by-step derivation

      1. *-un-lft-identity 74.0%

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

      2. pow2 74.0%

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

      3. times-frac 74.0%

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

   7. Applied egg-rr 74.0%

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

      1. associate-*l/ 74.0%

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

      2. *-un-lft-identity 74.0%

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

   9. Applied egg-rr 74.0%

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

   if 4.4000000000000002e-6 < l

   1. Initial program 76.0%

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

      1. *-commutative 76.0%

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

      2. sqr-neg 76.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/ 76.0%

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

      4. sqr-neg 76.0%

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

      5. *-rgt-identity 76.0%

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

   3. Simplified 76.0%

      \[\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 inf 99.6%

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

Alternative 6: 73.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(l\_m \cdot \pi\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 (* l_m PI)))

C

l\_m = fabs(l);
l\_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
	return l_s * (l_m * ((double) M_PI));
}

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 * (l_m * Math.PI);
}

Python

l\_m = math.fabs(l)
l\_s = math.copysign(1.0, l)
def code(l_s, F, l_m):
	return l_s * (l_m * math.pi)

Julia

l\_m = abs(l)
l\_s = copysign(1.0, l)
function code(l_s, F, l_m)
	return Float64(l_s * Float64(l_m * pi))
end

MATLAB

l\_m = abs(l);
l\_s = sign(l) * abs(1.0);
function tmp = code(l_s, F, l_m)
	tmp = l_s * (l_m * pi);
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[(l$95$m * Pi), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 76.3%

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

   1. *-commutative 76.3%

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

   2. sqr-neg 76.3%

      \[\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/ 76.8%

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

   4. sqr-neg 76.8%

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

   5. *-rgt-identity 76.8%

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

3. Simplified 76.8%

   \[\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 inf 73.9%

   \[\leadsto \color{blue}{\ell \cdot \pi} \]
6. Add Preprocessing

Reproduce

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