VandenBroeck and Keller, Equation (6)

Percentage Accurate: 76.0% → 99.4%

Time: 16.5s

Alternatives: 6

Speedup: 6.3×

• could not determine a ground truth

  1. F = -1.3862083912045739e-12
  2. l = 1499834701368094.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: 76.0% 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: 99.4% accurate, 0.9× 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 10^{+14}:\\ \;\;\;\;\pi \cdot l\_m + \frac{\tan \left(\pi \cdot l\_m\right) \cdot \frac{-1}{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) 1e+14)
    (+ (* PI l_m) (/ (* (tan (* PI l_m)) (/ -1.0 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) <= 1e+14) {
		tmp = (((double) M_PI) * l_m) + ((tan((((double) M_PI) * l_m)) * (-1.0 / 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) <= 1e+14) {
		tmp = (Math.PI * l_m) + ((Math.tan((Math.PI * l_m)) * (-1.0 / 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) <= 1e+14:
		tmp = (math.pi * l_m) + ((math.tan((math.pi * l_m)) * (-1.0 / 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) <= 1e+14)
		tmp = Float64(Float64(pi * l_m) + Float64(Float64(tan(Float64(pi * l_m)) * Float64(-1.0 / 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) <= 1e+14)
		tmp = (pi * l_m) + ((tan((pi * l_m)) * (-1.0 / 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], 1e+14], N[(N[(Pi * l$95$m), $MachinePrecision] + N[(N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / F), $MachinePrecision]), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < 1e14

   1. Initial program 80.2%

      \[\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-/r* 80.2%

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

      2. metadata-eval 80.2%

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

      3. add-sqr-sqrt 39.9%

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

      4. sqrt-prod 65.0%

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

      5. sqrt-div 65.0%

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

      6. associate-*l/ 65.0%

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

      7. sqrt-div 65.0%

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

      8. metadata-eval 65.0%

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

      9. sqrt-prod 44.4%

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

      10. add-sqr-sqrt 88.4%

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

   4. Applied egg-rr 88.4%

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

   if 1e14 < (*.f64 (PI.f64) l)

   1. Initial program 57.1%

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

      1. *-commutative 57.1%

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

      2. sqr-neg 57.1%

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

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

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

      5. *-rgt-identity 57.1%

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

   3. Simplified 57.1%

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

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

   6. Taylor expanded in F around inf 99.6%

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

4. Final simplification 90.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\pi \cdot \ell \leq 10^{+14}:\\ \;\;\;\;\pi \cdot \ell + \frac{\tan \left(\pi \cdot \ell\right) \cdot \frac{-1}{F}}{F}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \ell\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.4% 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 10^{+14}:\\ \;\;\;\;\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} \]

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) 1e+14)
    (- (* PI l_m) (/ (/ (tan (* 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) <= 1e+14) {
		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;
}

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) <= 1e+14) {
		tmp = (Math.PI * l_m) - ((Math.tan((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) <= 1e+14:
		tmp = (math.pi * l_m) - ((math.tan((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) <= 1e+14)
		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

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) <= 1e+14)
		tmp = (pi * l_m) - ((tan((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], 1e+14], 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]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < 1e14

   1. Initial program 80.2%

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

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

      2. *-un-lft-identity 80.7%

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

      3. associate-/r* 88.4%

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

   4. Applied egg-rr 88.4%

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

   if 1e14 < (*.f64 (PI.f64) l)

   1. Initial program 57.1%

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

      1. *-commutative 57.1%

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

      2. sqr-neg 57.1%

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

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

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

      5. *-rgt-identity 57.1%

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

   3. Simplified 57.1%

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

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

   6. Taylor expanded in F around inf 99.6%

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

4. Final simplification 90.7%

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

Alternative 3: 74.4% accurate, 3.9× 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}\;F \leq 1.16 \cdot 10^{-275} \lor \neg \left(F \leq 1.75 \cdot 10^{-199} \lor \neg \left(F \leq 1.25 \cdot 10^{-154}\right) \land F \leq 1.15 \cdot 10^{-10}\right):\\ \;\;\;\;\pi \cdot l\_m\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \left(\frac{l\_m}{F} \cdot \frac{-1}{F}\right)\\ \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 (or (<= F 1.16e-275)
          (not
           (or (<= F 1.75e-199) (and (not (<= F 1.25e-154)) (<= F 1.15e-10)))))
    (* PI l_m)
    (* PI (* (/ l_m F) (/ -1.0 F))))))

C

l_m = fabs(l);
l_s = copysign(1.0, l);
double code(double l_s, double F, double l_m) {
	double tmp;
	if ((F <= 1.16e-275) || !((F <= 1.75e-199) || (!(F <= 1.25e-154) && (F <= 1.15e-10)))) {
		tmp = ((double) M_PI) * l_m;
	} else {
		tmp = ((double) M_PI) * ((l_m / F) * (-1.0 / F));
	}
	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 ((F <= 1.16e-275) || !((F <= 1.75e-199) || (!(F <= 1.25e-154) && (F <= 1.15e-10)))) {
		tmp = Math.PI * l_m;
	} else {
		tmp = Math.PI * ((l_m / F) * (-1.0 / F));
	}
	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 (F <= 1.16e-275) or not ((F <= 1.75e-199) or (not (F <= 1.25e-154) and (F <= 1.15e-10))):
		tmp = math.pi * l_m
	else:
		tmp = math.pi * ((l_m / F) * (-1.0 / F))
	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 ((F <= 1.16e-275) || !((F <= 1.75e-199) || (!(F <= 1.25e-154) && (F <= 1.15e-10))))
		tmp = Float64(pi * l_m);
	else
		tmp = Float64(pi * Float64(Float64(l_m / F) * Float64(-1.0 / F)));
	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 ((F <= 1.16e-275) || ~(((F <= 1.75e-199) || (~((F <= 1.25e-154)) && (F <= 1.15e-10)))))
		tmp = pi * l_m;
	else
		tmp = pi * ((l_m / F) * (-1.0 / F));
	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[Or[LessEqual[F, 1.16e-275], N[Not[Or[LessEqual[F, 1.75e-199], And[N[Not[LessEqual[F, 1.25e-154]], $MachinePrecision], LessEqual[F, 1.15e-10]]]], $MachinePrecision]], N[(Pi * l$95$m), $MachinePrecision], N[(Pi * N[(N[(l$95$m / F), $MachinePrecision] * N[(-1.0 / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if F < 1.15999999999999995e-275 or 1.7499999999999999e-199 < F < 1.25000000000000005e-154 or 1.15000000000000004e-10 < F

   1. Initial program 77.3%

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

      1. *-commutative 77.3%

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

      2. sqr-neg 77.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/ 77.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 77.8%

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

      5. *-rgt-identity 77.8%

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

   3. Simplified 77.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 0 72.3%

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

   6. Taylor expanded in F around inf 77.9%

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

   if 1.15999999999999995e-275 < F < 1.7499999999999999e-199 or 1.25000000000000005e-154 < F < 1.15000000000000004e-10

   1. Initial program 67.8%

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

      1. *-commutative 67.8%

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

      2. sqr-neg 67.8%

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

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

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

      5. *-rgt-identity 67.9%

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

   3. Simplified 67.9%

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

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

   6. Taylor expanded in F around 0 63.3%

      \[\leadsto \color{blue}{-1 \cdot \frac{\ell \cdot \pi}{{F}^{2}}} \]
   7. Step-by-step derivation

      1. mul-1-neg 63.3%

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

      2. *-commutative 63.3%

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

      3. associate-*r/ 63.4%

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

      4. distribute-lft-neg-in 63.4%

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

   8. Simplified 63.4%

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

      1. *-un-lft-identity 63.4%

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

      2. pow2 63.4%

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

      3. times-frac 76.1%

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

   10. Applied egg-rr 76.1%

       \[\leadsto \left(-\pi\right) \cdot \color{blue}{\left(\frac{1}{F} \cdot \frac{\ell}{F}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;F \leq 1.16 \cdot 10^{-275} \lor \neg \left(F \leq 1.75 \cdot 10^{-199} \lor \neg \left(F \leq 1.25 \cdot 10^{-154}\right) \land F \leq 1.15 \cdot 10^{-10}\right):\\ \;\;\;\;\pi \cdot \ell\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot \left(\frac{\ell}{F} \cdot \frac{-1}{F}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.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 1000000000000:\\ \;\;\;\;\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 (<= (* PI l_m) 1000000000000.0)
    (- (* 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 ((((double) M_PI) * l_m) <= 1000000000000.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;
}

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) <= 1000000000000.0) {
		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 (math.pi * l_m) <= 1000000000000.0:
		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 (Float64(pi * l_m) <= 1000000000000.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

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) <= 1000000000000.0)
		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[N[(Pi * l$95$m), $MachinePrecision], 1000000000000.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]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < 1e12

   1. Initial program 80.4%

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

      1. *-commutative 80.4%

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

      2. sqr-neg 80.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/ 81.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 81.0%

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

      5. *-rgt-identity 81.0%

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

   3. Simplified 81.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 77.0%

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

      1. *-commutative 77.0%

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

      2. times-frac 84.8%

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

   7. Applied egg-rr 84.8%

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

   if 1e12 < (*.f64 (PI.f64) l)

   1. Initial program 56.5%

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

      1. *-commutative 56.5%

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

      2. sqr-neg 56.5%

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

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

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

      5. *-rgt-identity 56.5%

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

   3. Simplified 56.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 46.3%

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

   6. Taylor expanded in F around inf 97.8%

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

4. Final simplification 87.5%

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

Alternative 5: 98.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 1000000000000:\\ \;\;\;\;\pi \cdot l\_m - \frac{l\_m \cdot \frac{\pi}{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) 1000000000000.0)
    (- (* PI l_m) (/ (* l_m (/ PI 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) <= 1000000000000.0) {
		tmp = (((double) M_PI) * l_m) - ((l_m * (((double) M_PI) / 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) <= 1000000000000.0) {
		tmp = (Math.PI * l_m) - ((l_m * (Math.PI / 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) <= 1000000000000.0:
		tmp = (math.pi * l_m) - ((l_m * (math.pi / 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) <= 1000000000000.0)
		tmp = Float64(Float64(pi * l_m) - Float64(Float64(l_m * Float64(pi / 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) <= 1000000000000.0)
		tmp = (pi * l_m) - ((l_m * (pi / 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], 1000000000000.0], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(l$95$m * N[(Pi / F), $MachinePrecision]), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision], N[(Pi * l$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < 1e12

   1. Initial program 80.4%

      \[\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-/r* 80.4%

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

      2. metadata-eval 80.4%

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

      3. add-sqr-sqrt 40.1%

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

      4. sqrt-prod 65.3%

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

      5. sqrt-div 65.3%

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

      6. associate-*l/ 65.3%

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

      7. sqrt-div 65.4%

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

      8. metadata-eval 65.4%

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

      9. sqrt-prod 44.7%

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

      10. add-sqr-sqrt 88.7%

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

   4. Applied egg-rr 88.7%

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

   5. Taylor expanded in l around 0 84.7%

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

      1. associate-/l* 84.8%

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

   7. Simplified 84.8%

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

   if 1e12 < (*.f64 (PI.f64) l)

   1. Initial program 56.5%

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

      1. *-commutative 56.5%

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

      2. sqr-neg 56.5%

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

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

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

      5. *-rgt-identity 56.5%

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

   3. Simplified 56.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 46.3%

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

   6. Taylor expanded in F around inf 97.8%

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

4. Final simplification 87.5%

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

Alternative 6: 73.9% 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 75.4%

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

   1. *-commutative 75.4%

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

   2. sqr-neg 75.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/ 75.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 75.8%

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

   5. *-rgt-identity 75.8%

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

3. Simplified 75.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 0 70.5%

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

6. Taylor expanded in F around inf 67.0%

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

7. Final simplification 67.0%

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

Reproduce

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