VandenBroeck and Keller, Equation (6)

Percentage Accurate: 76.7% → 82.7%

Time: 26.2s

Alternatives: 4

Speedup: 1.0×

• could not determine a ground truth

  1. F = 8.64684589209134e-278
  2. l = -3260765375610167.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.7% 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: 82.7% accurate, 0.8× 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^{-46}:\\ \;\;\;\;\pi \cdot l_m - \frac{\pi}{\frac{F}{\frac{l_m}{F}}}\\ \mathbf{else}:\\ \;\;\;\;\pi \cdot l_m - \frac{\tan \left(\pi \cdot l_m\right)}{F \cdot F}\\ \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-46)
    (- (* PI l_m) (/ PI (/ F (/ l_m F))))
    (- (* PI l_m) (/ (tan (* PI l_m)) (* F 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 ((((double) M_PI) * l_m) <= 5e-46) {
		tmp = (((double) M_PI) * l_m) - (((double) M_PI) / (F / (l_m / F)));
	} else {
		tmp = (((double) M_PI) * l_m) - (tan((((double) M_PI) * l_m)) / (F * 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 ((Math.PI * l_m) <= 5e-46) {
		tmp = (Math.PI * l_m) - (Math.PI / (F / (l_m / F)));
	} else {
		tmp = (Math.PI * l_m) - (Math.tan((Math.PI * l_m)) / (F * 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 (math.pi * l_m) <= 5e-46:
		tmp = (math.pi * l_m) - (math.pi / (F / (l_m / F)))
	else:
		tmp = (math.pi * l_m) - (math.tan((math.pi * l_m)) / (F * 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 (Float64(pi * l_m) <= 5e-46)
		tmp = Float64(Float64(pi * l_m) - Float64(pi / Float64(F / Float64(l_m / F))));
	else
		tmp = Float64(Float64(pi * l_m) - Float64(tan(Float64(pi * l_m)) / Float64(F * 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 ((pi * l_m) <= 5e-46)
		tmp = (pi * l_m) - (pi / (F / (l_m / F)));
	else
		tmp = (pi * l_m) - (tan((pi * l_m)) / (F * 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[LessEqual[N[(Pi * l$95$m), $MachinePrecision], 5e-46], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(Pi / N[(F / N[(l$95$m / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] / N[(F * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (PI.f64) l) < 4.99999999999999992e-46

   1. Initial program 81.4%

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

      1. sqr-neg 81.4%

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

      2. associate-*l/ 82.1%

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

      3. sqr-neg 82.1%

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

      4. *-lft-identity 82.1%

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

   3. Simplified 82.1%

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

   4. Taylor expanded in l around 0 79.5%

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

      1. *-commutative 79.5%

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

      2. times-frac 87.0%

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

   6. Applied egg-rr 87.0%

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

      1. associate-*l/ 87.0%

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

      2. associate-/l* 87.0%

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

   8. Applied egg-rr 87.0%

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

   if 4.99999999999999992e-46 < (*.f64 (PI.f64) l)

   1. Initial program 77.2%

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

      1. sqr-neg 77.2%

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

      2. associate-*l/ 77.2%

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

      3. sqr-neg 77.2%

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

      4. *-lft-identity 77.2%

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

   3. Simplified 77.2%

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

4. Final simplification 84.2%

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

Alternative 2: 82.8% accurate, 1.0× 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 - \frac{\frac{\tan \left(\pi \cdot l_m\right)}{F}}{F}\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) (/ (/ (tan (* PI l_m)) F) F))))

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) - ((tan((((double) M_PI) * l_m)) / F) / F));
}

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

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) - ((math.tan((math.pi * l_m)) / F) / F))

Julia

l_m = abs(l)
l_s = copysign(1.0, l)
function code(l_s, F, l_m)
	return Float64(l_s * Float64(Float64(pi * l_m) - Float64(Float64(tan(Float64(pi * l_m)) / F) / F)))
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) - ((tan((pi * l_m)) / F) / F));
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[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(N[Tan[N[(Pi * l$95$m), $MachinePrecision]], $MachinePrecision] / F), $MachinePrecision] / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.2%

   \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right) \]
2. 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* 86.1%

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

3. Applied egg-rr 86.1%

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

4. Final simplification 86.1%

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

Alternative 3: 75.6% accurate, 1.5× 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 - \frac{l_m}{F} \cdot \frac{\pi}{F}\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) (* (/ l_m F) (/ PI F)))))

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) - ((l_m / F) * (((double) M_PI) / F)));
}

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

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) - ((l_m / F) * (math.pi / F)))

Julia

l_m = abs(l)
l_s = copysign(1.0, l)
function code(l_s, F, l_m)
	return Float64(l_s * Float64(Float64(pi * l_m) - Float64(Float64(l_m / F) * Float64(pi / F))))
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) - ((l_m / F) * (pi / F)));
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[(N[(Pi * l$95$m), $MachinePrecision] - N[(N[(l$95$m / F), $MachinePrecision] * N[(Pi / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.2%

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

   1. sqr-neg 80.2%

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

   2. associate-*l/ 80.7%

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

   3. sqr-neg 80.7%

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

   4. *-lft-identity 80.7%

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

3. Simplified 80.7%

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

4. Taylor expanded in l around 0 75.2%

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

   1. *-commutative 75.2%

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

   2. times-frac 80.5%

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

6. Applied egg-rr 80.5%

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

7. Final simplification 80.5%

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

Alternative 4: 75.5% accurate, 1.5× 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 - \frac{\pi}{\frac{F}{\frac{l_m}{F}}}\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) (/ PI (/ F (/ l_m F))))))

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) - (((double) M_PI) / (F / (l_m / F))));
}

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

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) - (math.pi / (F / (l_m / F))))

Julia

l_m = abs(l)
l_s = copysign(1.0, l)
function code(l_s, F, l_m)
	return Float64(l_s * Float64(Float64(pi * l_m) - Float64(pi / Float64(F / Float64(l_m / F)))))
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) - (pi / (F / (l_m / F))));
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[(N[(Pi * l$95$m), $MachinePrecision] - N[(Pi / N[(F / N[(l$95$m / F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.2%

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

   1. sqr-neg 80.2%

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

   2. associate-*l/ 80.7%

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

   3. sqr-neg 80.7%

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

   4. *-lft-identity 80.7%

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

3. Simplified 80.7%

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

4. Taylor expanded in l around 0 75.2%

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

   1. *-commutative 75.2%

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

   2. times-frac 80.5%

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

6. Applied egg-rr 80.5%

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

   1. associate-*l/ 80.5%

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

   2. associate-/l* 80.6%

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

8. Applied egg-rr 80.6%

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

9. Final simplification 80.6%

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

Reproduce

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