exp-w (used to crash)

Percentage Accurate: 99.4% → 99.4%

Time: 19.0s

Alternatives: 16

Speedup: 1.0×

• could not determine a ground truth

  1. w = -5.070481397953285e-78
  2. l = -22751433.665059466

Specification

Math

\[\begin{array}{l} \\ e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (exp (- w)) (pow l (exp w))))

C

double code(double w, double l) {
	return exp(-w) * pow(l, exp(w));
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    code = exp(-w) * (l ** exp(w))
end function

Java

public static double code(double w, double l) {
	return Math.exp(-w) * Math.pow(l, Math.exp(w));
}

Python

def code(w, l):
	return math.exp(-w) * math.pow(l, math.exp(w))

Julia

function code(w, l)
	return Float64(exp(Float64(-w)) * (l ^ exp(w)))
end

MATLAB

function tmp = code(w, l)
	tmp = exp(-w) * (l ^ exp(w));
end

Wolfram

code[w_, l_] := N[(N[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (exp (- w)) (pow l (exp w))))

C

double code(double w, double l) {
	return exp(-w) * pow(l, exp(w));
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    code = exp(-w) * (l ** exp(w))
end function

Java

public static double code(double w, double l) {
	return Math.exp(-w) * Math.pow(l, Math.exp(w));
}

Python

def code(w, l):
	return math.exp(-w) * math.pow(l, math.exp(w))

Julia

function code(w, l)
	return Float64(exp(Float64(-w)) * (l ^ exp(w)))
end

MATLAB

function tmp = code(w, l)
	tmp = exp(-w) * (l ^ exp(w));
end

Wolfram

code[w_, l_] := N[(N[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ {\ell}^{\left(e^{w}\right)} \cdot e^{-w} \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (pow l (exp w)) (exp (- w))))

C

double code(double w, double l) {
	return pow(l, exp(w)) * exp(-w);
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    code = (l ** exp(w)) * exp(-w)
end function

Java

public static double code(double w, double l) {
	return Math.pow(l, Math.exp(w)) * Math.exp(-w);
}

Python

def code(w, l):
	return math.pow(l, math.exp(w)) * math.exp(-w)

Julia

function code(w, l)
	return Float64((l ^ exp(w)) * exp(Float64(-w)))
end

MATLAB

function tmp = code(w, l)
	tmp = (l ^ exp(w)) * exp(-w);
end

Wolfram

code[w_, l_] := N[(N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision] * N[Exp[(-w)], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
2. Add Preprocessing

3. Final simplification 99.7%

   \[\leadsto {\ell}^{\left(e^{w}\right)} \cdot e^{-w} \]
4. Add Preprocessing

Alternative 2: 37.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 2 \cdot 10^{-159}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right), w, -1\right), w, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= (* (pow l (exp w)) (exp (- w))) 2e-159)
   0.0
   (fma (fma (fma -0.16666666666666666 w 0.5) w -1.0) w 1.0)))

C

double code(double w, double l) {
	double tmp;
	if ((pow(l, exp(w)) * exp(-w)) <= 2e-159) {
		tmp = 0.0;
	} else {
		tmp = fma(fma(fma(-0.16666666666666666, w, 0.5), w, -1.0), w, 1.0);
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (Float64((l ^ exp(w)) * exp(Float64(-w))) <= 2e-159)
		tmp = 0.0;
	else
		tmp = fma(fma(fma(-0.16666666666666666, w, 0.5), w, -1.0), w, 1.0);
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[N[(N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision] * N[Exp[(-w)], $MachinePrecision]), $MachinePrecision], 2e-159], 0.0, N[(N[(N[(-0.16666666666666666 * w + 0.5), $MachinePrecision] * w + -1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w))) < 1.99999999999999998e-159

   1. Initial program 99.8%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   4. Applied rewrites 59.0%

      \[\leadsto \color{blue}{0} \]

   if 1.99999999999999998e-159 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 99.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(e^{w}\right)}} \]

      2. sqr-pow N/A

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

      3. pow-prod-up N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

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

      5. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 - 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      7. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 \cdot 0} - 0}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      8. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - \color{blue}{0 \cdot 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      9. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0 + 0}}\right)} \]

      11. flip-- N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{\left(0 - 0\right)}} \]

      12. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{0}} \]

      13. metadata-eval 44.6

          \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   4. Applied rewrites 44.6%

      \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   5. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1 + w \cdot \left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1\right)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{w \cdot \left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1\right) + 1} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1\right) \cdot w} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1, w, 1\right)} \]

      4. sub-neg N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) + \left(\mathsf{neg}\left(1\right)\right)}, w, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) \cdot w} + \left(\mathsf{neg}\left(1\right)\right), w, 1\right) \]

      6. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) \cdot w + \color{blue}{-1}, w, 1\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{-1}{6} \cdot w, w, -1\right)}, w, 1\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{-1}{6} \cdot w + \frac{1}{2}}, w, -1\right), w, 1\right) \]

      9. lower-fma.f64 33.3

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right)}, w, -1\right), w, 1\right) \]

   7. Applied rewrites 33.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right), w, -1\right), w, 1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 39.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 2 \cdot 10^{-159}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right), w, -1\right), w, 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 33.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 2 \cdot 10^{-159}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= (* (pow l (exp w)) (exp (- w))) 2e-159)
   0.0
   (fma (fma 0.5 w -1.0) w 1.0)))

C

double code(double w, double l) {
	double tmp;
	if ((pow(l, exp(w)) * exp(-w)) <= 2e-159) {
		tmp = 0.0;
	} else {
		tmp = fma(fma(0.5, w, -1.0), w, 1.0);
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (Float64((l ^ exp(w)) * exp(Float64(-w))) <= 2e-159)
		tmp = 0.0;
	else
		tmp = fma(fma(0.5, w, -1.0), w, 1.0);
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[N[(N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision] * N[Exp[(-w)], $MachinePrecision]), $MachinePrecision], 2e-159], 0.0, N[(N[(0.5 * w + -1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w))) < 1.99999999999999998e-159

   1. Initial program 99.8%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   4. Applied rewrites 59.0%

      \[\leadsto \color{blue}{0} \]

   if 1.99999999999999998e-159 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 99.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(e^{w}\right)}} \]

      2. sqr-pow N/A

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

      3. pow-prod-up N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

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

      5. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 - 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      7. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 \cdot 0} - 0}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      8. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - \color{blue}{0 \cdot 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      9. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0 + 0}}\right)} \]

      11. flip-- N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{\left(0 - 0\right)}} \]

      12. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{0}} \]

      13. metadata-eval 44.6

          \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   4. Applied rewrites 44.6%

      \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   5. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1 + w \cdot \left(\frac{1}{2} \cdot w - 1\right)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{w \cdot \left(\frac{1}{2} \cdot w - 1\right) + 1} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot w - 1\right) \cdot w} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} \cdot w - 1, w, 1\right)} \]

      4. sub-neg N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot w + \left(\mathsf{neg}\left(1\right)\right)}, w, 1\right) \]

      5. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + \color{blue}{-1}, w, 1\right) \]

      6. lower-fma.f64 27.9

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, w, -1\right)}, w, 1\right) \]

   7. Applied rewrites 27.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 35.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 2 \cdot 10^{-159}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 19.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 2 \cdot 10^{-159}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;1 - w\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= (* (pow l (exp w)) (exp (- w))) 2e-159) 0.0 (- 1.0 w)))

C

double code(double w, double l) {
	double tmp;
	if ((pow(l, exp(w)) * exp(-w)) <= 2e-159) {
		tmp = 0.0;
	} else {
		tmp = 1.0 - w;
	}
	return tmp;
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if (((l ** exp(w)) * exp(-w)) <= 2d-159) then
        tmp = 0.0d0
    else
        tmp = 1.0d0 - w
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if ((Math.pow(l, Math.exp(w)) * Math.exp(-w)) <= 2e-159) {
		tmp = 0.0;
	} else {
		tmp = 1.0 - w;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if (math.pow(l, math.exp(w)) * math.exp(-w)) <= 2e-159:
		tmp = 0.0
	else:
		tmp = 1.0 - w
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (Float64((l ^ exp(w)) * exp(Float64(-w))) <= 2e-159)
		tmp = 0.0;
	else
		tmp = Float64(1.0 - w);
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (((l ^ exp(w)) * exp(-w)) <= 2e-159)
		tmp = 0.0;
	else
		tmp = 1.0 - w;
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[N[(N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision] * N[Exp[(-w)], $MachinePrecision]), $MachinePrecision], 2e-159], 0.0, N[(1.0 - w), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w))) < 1.99999999999999998e-159

   1. Initial program 99.8%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   4. Applied rewrites 59.0%

      \[\leadsto \color{blue}{0} \]

   if 1.99999999999999998e-159 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 99.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(e^{w}\right)}} \]

      2. sqr-pow N/A

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

      3. pow-prod-up N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

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

      5. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 - 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      7. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 \cdot 0} - 0}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      8. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - \color{blue}{0 \cdot 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      9. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0 + 0}}\right)} \]

      11. flip-- N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{\left(0 - 0\right)}} \]

      12. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{0}} \]

      13. metadata-eval 44.6

          \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   4. Applied rewrites 44.6%

      \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   5. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1 + -1 \cdot w} \]
   6. Step-by-step derivation

      1. neg-mul-1 N/A

         \[\leadsto 1 + \color{blue}{\left(\mathsf{neg}\left(w\right)\right)} \]

      2. unsub-neg N/A

         \[\leadsto \color{blue}{1 - w} \]

      3. lower--.f64 5.8

         \[\leadsto \color{blue}{1 - w} \]

   7. Applied rewrites 5.8%

      \[\leadsto \color{blue}{1 - w} \]
3. Recombined 2 regimes into one program.

4. Final simplification 19.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 2 \cdot 10^{-159}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;1 - w\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1.6 \cdot 10^{-11}:\\ \;\;\;\;e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\ell}^{\left(e^{w}\right)}}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.6e-11)
   (exp (fma (log l) (exp w) (- w)))
   (/
    (pow l (exp w))
    (fma (fma (fma 0.16666666666666666 w 0.5) w 1.0) w 1.0))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.6e-11) {
		tmp = exp(fma(log(l), exp(w), -w));
	} else {
		tmp = pow(l, exp(w)) / fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0);
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.6e-11)
		tmp = exp(fma(log(l), exp(w), Float64(-w)));
	else
		tmp = Float64((l ^ exp(w)) / fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0));
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.6e-11], N[Exp[N[(N[Log[l], $MachinePrecision] * N[Exp[w], $MachinePrecision] + (-w)), $MachinePrecision]], $MachinePrecision], N[(N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision] / N[(N[(N[(0.16666666666666666 * w + 0.5), $MachinePrecision] * w + 1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1.59999999999999997e-11

   1. Initial program 99.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 99.6%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.7%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]

   if -1.59999999999999997e-11 < w

   1. Initial program 99.7%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]

   6. Taylor expanded in w around 0

      \[\leadsto \frac{{\ell}^{\left(e^{w}\right)}}{1 + \color{blue}{w \cdot \left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right)}} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.4%

      \[\leadsto \frac{{\ell}^{\left(e^{w}\right)}}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), \color{blue}{w}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 19.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 1.12 \cdot 10^{-154}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= (* (pow l (exp w)) (exp (- w))) 1.12e-154) 0.0 1.0))

C

double code(double w, double l) {
	double tmp;
	if ((pow(l, exp(w)) * exp(-w)) <= 1.12e-154) {
		tmp = 0.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if (((l ** exp(w)) * exp(-w)) <= 1.12d-154) then
        tmp = 0.0d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if ((Math.pow(l, Math.exp(w)) * Math.exp(-w)) <= 1.12e-154) {
		tmp = 0.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if (math.pow(l, math.exp(w)) * math.exp(-w)) <= 1.12e-154:
		tmp = 0.0
	else:
		tmp = 1.0
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (Float64((l ^ exp(w)) * exp(Float64(-w))) <= 1.12e-154)
		tmp = 0.0;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (((l ^ exp(w)) * exp(-w)) <= 1.12e-154)
		tmp = 0.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[N[(N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision] * N[Exp[(-w)], $MachinePrecision]), $MachinePrecision], 1.12e-154], 0.0, 1.0]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w))) < 1.12e-154

   1. Initial program 99.8%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   4. Applied rewrites 59.0%

      \[\leadsto \color{blue}{0} \]

   if 1.12e-154 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 99.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(e^{w}\right)}} \]

      2. sqr-pow N/A

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

      3. pow-prod-up N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

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

      5. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 - 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      7. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 \cdot 0} - 0}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      8. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - \color{blue}{0 \cdot 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      9. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0 + 0}}\right)} \]

      11. flip-- N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{\left(0 - 0\right)}} \]

      12. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{0}} \]

      13. metadata-eval 44.6

          \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   4. Applied rewrites 44.6%

      \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   5. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1} \]
   6. Step-by-step derivation

   7. Applied rewrites 4.8%

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

4. Final simplification 18.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 1.12 \cdot 10^{-154}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 99.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1.6:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\ell}^{\left(e^{w}\right)}}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.6)
   (exp (- w))
   (/
    (pow l (exp w))
    (fma (fma (fma 0.16666666666666666 w 0.5) w 1.0) w 1.0))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.6) {
		tmp = exp(-w);
	} else {
		tmp = pow(l, exp(w)) / fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0);
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.6)
		tmp = exp(Float64(-w));
	else
		tmp = Float64((l ^ exp(w)) / fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0));
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.6], N[Exp[(-w)], $MachinePrecision], N[(N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision] / N[(N[(N[(0.16666666666666666 * w + 0.5), $MachinePrecision] * w + 1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1.6000000000000001

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]

   8. Taylor expanded in w around inf

      \[\leadsto e^{-1 \cdot w} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto e^{-w} \]

   if -1.6000000000000001 < w

   1. Initial program 99.5%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 99.5%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]

   6. Taylor expanded in w around 0

      \[\leadsto \frac{{\ell}^{\left(e^{w}\right)}}{1 + \color{blue}{w \cdot \left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right)}} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.8%

      \[\leadsto \frac{{\ell}^{\left(e^{w}\right)}}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), \color{blue}{w}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 99.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\\ \mathbf{if}\;w \leq -1.6:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\ell}^{t\_0}}{t\_0}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (let* ((t_0 (fma (fma (fma 0.16666666666666666 w 0.5) w 1.0) w 1.0)))
   (if (<= w -1.6) (exp (- w)) (/ (pow l t_0) t_0))))

C

double code(double w, double l) {
	double t_0 = fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0);
	double tmp;
	if (w <= -1.6) {
		tmp = exp(-w);
	} else {
		tmp = pow(l, t_0) / t_0;
	}
	return tmp;
}

Julia

function code(w, l)
	t_0 = fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0)
	tmp = 0.0
	if (w <= -1.6)
		tmp = exp(Float64(-w));
	else
		tmp = Float64((l ^ t_0) / t_0);
	end
	return tmp
end

Wolfram

code[w_, l_] := Block[{t$95$0 = N[(N[(N[(0.16666666666666666 * w + 0.5), $MachinePrecision] * w + 1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]}, If[LessEqual[w, -1.6], N[Exp[(-w)], $MachinePrecision], N[(N[Power[l, t$95$0], $MachinePrecision] / t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if w < -1.6000000000000001

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]

   8. Taylor expanded in w around inf

      \[\leadsto e^{-1 \cdot w} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto e^{-w} \]

   if -1.6000000000000001 < w

   1. Initial program 99.5%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 99.5%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]

   6. Taylor expanded in w around 0

      \[\leadsto \frac{{\ell}^{\left(e^{w}\right)}}{1 + \color{blue}{w \cdot \left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right)}} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.8%

      \[\leadsto \frac{{\ell}^{\left(e^{w}\right)}}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), \color{blue}{w}, 1\right)} \]

   9. Taylor expanded in w around 0

      \[\leadsto \frac{{\ell}^{\left(1 + w \cdot \left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right)\right)}}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6}, w, \frac{1}{2}\right), \color{blue}{w}, 1\right), w, 1\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 98.6%

       \[\leadsto \frac{{\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)}}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), \color{blue}{w}, 1\right), w, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 98.8% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1.6:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;\left(1 - w\right) \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.6)
   (exp (- w))
   (*
    (- 1.0 w)
    (pow l (fma (fma (fma 0.16666666666666666 w 0.5) w 1.0) w 1.0)))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.6) {
		tmp = exp(-w);
	} else {
		tmp = (1.0 - w) * pow(l, fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0));
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.6)
		tmp = exp(Float64(-w));
	else
		tmp = Float64(Float64(1.0 - w) * (l ^ fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0)));
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.6], N[Exp[(-w)], $MachinePrecision], N[(N[(1.0 - w), $MachinePrecision] * N[Power[l, N[(N[(N[(0.16666666666666666 * w + 0.5), $MachinePrecision] * w + 1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1.6000000000000001

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]

   8. Taylor expanded in w around inf

      \[\leadsto e^{-1 \cdot w} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto e^{-w} \]

   if -1.6000000000000001 < w

   1. Initial program 99.5%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{\left(1 + -1 \cdot w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

      1. neg-mul-1 N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(w\right)\right)}\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

      3. lower--.f64 98.3

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   5. Applied rewrites 98.3%

      \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\color{blue}{\left(w \cdot \left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right) + 1\right)}} \]

      2. *-commutative N/A

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\left(\color{blue}{\left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right) \cdot w} + 1\right)} \]

      3. lower-fma.f64 N/A

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\color{blue}{\left(\mathsf{fma}\left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right), w, 1\right)\right)}} \]

      4. +-commutative N/A

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\left(\mathsf{fma}\left(\color{blue}{w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right) + 1}, w, 1\right)\right)} \]

      5. *-commutative N/A

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\left(\mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot w\right) \cdot w} + 1, w, 1\right)\right)} \]

      6. lower-fma.f64 N/A

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot w, w, 1\right)}, w, 1\right)\right)} \]

      7. +-commutative N/A

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{1}{6} \cdot w + \frac{1}{2}}, w, 1\right), w, 1\right)\right)} \]

      8. lower-fma.f64 98.3

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.16666666666666666, w, 0.5\right)}, w, 1\right), w, 1\right)\right)} \]

   8. Applied rewrites 98.3%

      \[\leadsto \left(1 - w\right) \cdot {\ell}^{\color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 98.8% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1.3:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;{\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, 1\right), w, 1\right)\right)} \cdot \left(1 - w\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.3)
   (exp (- w))
   (* (pow l (fma (fma 0.5 w 1.0) w 1.0)) (- 1.0 w))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.3) {
		tmp = exp(-w);
	} else {
		tmp = pow(l, fma(fma(0.5, w, 1.0), w, 1.0)) * (1.0 - w);
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.3)
		tmp = exp(Float64(-w));
	else
		tmp = Float64((l ^ fma(fma(0.5, w, 1.0), w, 1.0)) * Float64(1.0 - w));
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.3], N[Exp[(-w)], $MachinePrecision], N[(N[Power[l, N[(N[(0.5 * w + 1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]], $MachinePrecision] * N[(1.0 - w), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1.30000000000000004

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]

   8. Taylor expanded in w around inf

      \[\leadsto e^{-1 \cdot w} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto e^{-w} \]

   if -1.30000000000000004 < w

   1. Initial program 99.5%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{\left(1 + -1 \cdot w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

      1. neg-mul-1 N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(w\right)\right)}\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

      3. lower--.f64 98.3

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   5. Applied rewrites 98.3%

      \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

      \[\leadsto \left(1 - w\right) \cdot {\ell}^{\color{blue}{\left(1 + w \cdot \left(1 + \frac{1}{2} \cdot w\right)\right)}} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\color{blue}{\left(\mathsf{fma}\left(1 + \frac{1}{2} \cdot w, w, 1\right)\right)}} \]

      4. +-commutative N/A

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\left(\mathsf{fma}\left(\color{blue}{\frac{1}{2} \cdot w + 1}, w, 1\right)\right)} \]

      5. lower-fma.f64 98.3

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(0.5, w, 1\right)}, w, 1\right)\right)} \]

   8. Applied rewrites 98.3%

      \[\leadsto \left(1 - w\right) \cdot {\ell}^{\color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, 1\right), w, 1\right)\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -1.3:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;{\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, 1\right), w, 1\right)\right)} \cdot \left(1 - w\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 97.8% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -0.68:\\ \;\;\;\;e^{-w}\\ \mathbf{elif}\;w \leq 0.09:\\ \;\;\;\;{\ell}^{1} \cdot 1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -0.68) (exp (- w)) (if (<= w 0.09) (* (pow l 1.0) 1.0) 0.0)))

C

double code(double w, double l) {
	double tmp;
	if (w <= -0.68) {
		tmp = exp(-w);
	} else if (w <= 0.09) {
		tmp = pow(l, 1.0) * 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if (w <= (-0.68d0)) then
        tmp = exp(-w)
    else if (w <= 0.09d0) then
        tmp = (l ** 1.0d0) * 1.0d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -0.68) {
		tmp = Math.exp(-w);
	} else if (w <= 0.09) {
		tmp = Math.pow(l, 1.0) * 1.0;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -0.68:
		tmp = math.exp(-w)
	elif w <= 0.09:
		tmp = math.pow(l, 1.0) * 1.0
	else:
		tmp = 0.0
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -0.68)
		tmp = exp(Float64(-w));
	elseif (w <= 0.09)
		tmp = Float64((l ^ 1.0) * 1.0);
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -0.68)
		tmp = exp(-w);
	elseif (w <= 0.09)
		tmp = (l ^ 1.0) * 1.0;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[w, -0.68], N[Exp[(-w)], $MachinePrecision], If[LessEqual[w, 0.09], N[(N[Power[l, 1.0], $MachinePrecision] * 1.0), $MachinePrecision], 0.0]]

Derivation

1. Split input into 3 regimes

2. if w < -0.680000000000000049

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]

   8. Taylor expanded in w around inf

      \[\leadsto e^{-1 \cdot w} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto e^{-w} \]

   if -0.680000000000000049 < w < 0.089999999999999997

   1. Initial program 99.5%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{\left(1 + -1 \cdot w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

      1. neg-mul-1 N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(w\right)\right)}\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

      3. lower--.f64 98.5

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   5. Applied rewrites 98.5%

      \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

      \[\leadsto 1 \cdot {\ell}^{\left(e^{w}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.5%

      \[\leadsto 1 \cdot {\ell}^{\left(e^{w}\right)} \]

   9. Taylor expanded in w around 0

      \[\leadsto 1 \cdot {\ell}^{\color{blue}{1}} \]
   10. Step-by-step derivation

   11. Applied rewrites 96.9%

       \[\leadsto 1 \cdot {\ell}^{\color{blue}{1}} \]

   if 0.089999999999999997 < w

   1. Initial program 99.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   4. Applied rewrites 97.3%

      \[\leadsto \color{blue}{0} \]
3. Recombined 3 regimes into one program.

4. Final simplification 97.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -0.68:\\ \;\;\;\;e^{-w}\\ \mathbf{elif}\;w \leq 0.09:\\ \;\;\;\;{\ell}^{1} \cdot 1\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 98.6% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;{\ell}^{\left(1 + w\right)} \cdot \left(1 - w\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.0) (exp (- w)) (* (pow l (+ 1.0 w)) (- 1.0 w))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.0) {
		tmp = exp(-w);
	} else {
		tmp = pow(l, (1.0 + w)) * (1.0 - w);
	}
	return tmp;
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if (w <= (-1.0d0)) then
        tmp = exp(-w)
    else
        tmp = (l ** (1.0d0 + w)) * (1.0d0 - w)
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -1.0) {
		tmp = Math.exp(-w);
	} else {
		tmp = Math.pow(l, (1.0 + w)) * (1.0 - w);
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -1.0:
		tmp = math.exp(-w)
	else:
		tmp = math.pow(l, (1.0 + w)) * (1.0 - w)
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.0)
		tmp = exp(Float64(-w));
	else
		tmp = Float64((l ^ Float64(1.0 + w)) * Float64(1.0 - w));
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -1.0)
		tmp = exp(-w);
	else
		tmp = (l ^ (1.0 + w)) * (1.0 - w);
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.0], N[Exp[(-w)], $MachinePrecision], N[(N[Power[l, N[(1.0 + w), $MachinePrecision]], $MachinePrecision] * N[(1.0 - w), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]

   8. Taylor expanded in w around inf

      \[\leadsto e^{-1 \cdot w} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto e^{-w} \]

   if -1 < w

   1. Initial program 99.5%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{\left(1 + -1 \cdot w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

      1. neg-mul-1 N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(w\right)\right)}\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

      3. lower--.f64 98.3

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   5. Applied rewrites 98.3%

      \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

      \[\leadsto \left(1 - w\right) \cdot {\ell}^{\color{blue}{\left(1 + w\right)}} \]
   7. Step-by-step derivation

      1. lower-+.f64 97.9

         \[\leadsto \left(1 - w\right) \cdot {\ell}^{\color{blue}{\left(1 + w\right)}} \]

   8. Applied rewrites 97.9%

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

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -1:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;{\ell}^{\left(1 + w\right)} \cdot \left(1 - w\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 98.5% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(1 + w\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.0) (exp (- w)) (* 1.0 (pow l (+ 1.0 w)))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.0) {
		tmp = exp(-w);
	} else {
		tmp = 1.0 * pow(l, (1.0 + w));
	}
	return tmp;
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if (w <= (-1.0d0)) then
        tmp = exp(-w)
    else
        tmp = 1.0d0 * (l ** (1.0d0 + w))
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -1.0) {
		tmp = Math.exp(-w);
	} else {
		tmp = 1.0 * Math.pow(l, (1.0 + w));
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -1.0:
		tmp = math.exp(-w)
	else:
		tmp = 1.0 * math.pow(l, (1.0 + w))
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.0)
		tmp = exp(Float64(-w));
	else
		tmp = Float64(1.0 * (l ^ Float64(1.0 + w)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -1.0)
		tmp = exp(-w);
	else
		tmp = 1.0 * (l ^ (1.0 + w));
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.0], N[Exp[(-w)], $MachinePrecision], N[(1.0 * N[Power[l, N[(1.0 + w), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]

   8. Taylor expanded in w around inf

      \[\leadsto e^{-1 \cdot w} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto e^{-w} \]

   if -1 < w

   1. Initial program 99.5%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{\left(1 + -1 \cdot w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

      1. neg-mul-1 N/A

         \[\leadsto \left(1 + \color{blue}{\left(\mathsf{neg}\left(w\right)\right)}\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      2. unsub-neg N/A

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

      3. lower--.f64 98.3

         \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   5. Applied rewrites 98.3%

      \[\leadsto \color{blue}{\left(1 - w\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

      \[\leadsto 1 \cdot {\ell}^{\left(e^{w}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.5%

      \[\leadsto 1 \cdot {\ell}^{\left(e^{w}\right)} \]

   9. Taylor expanded in w around 0

      \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(1 + w\right)}} \]
   10. Step-by-step derivation

       1. lower-+.f64 97.4

          \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(1 + w\right)}} \]

   11. Applied rewrites 97.4%

       \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(1 + w\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 97.6% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -0.68:\\ \;\;\;\;e^{-w}\\ \mathbf{elif}\;w \leq 0.09:\\ \;\;\;\;\frac{-1}{\frac{-1}{\ell}}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -0.68) (exp (- w)) (if (<= w 0.09) (/ -1.0 (/ -1.0 l)) 0.0)))

C

double code(double w, double l) {
	double tmp;
	if (w <= -0.68) {
		tmp = exp(-w);
	} else if (w <= 0.09) {
		tmp = -1.0 / (-1.0 / l);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if (w <= (-0.68d0)) then
        tmp = exp(-w)
    else if (w <= 0.09d0) then
        tmp = (-1.0d0) / ((-1.0d0) / l)
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -0.68) {
		tmp = Math.exp(-w);
	} else if (w <= 0.09) {
		tmp = -1.0 / (-1.0 / l);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -0.68:
		tmp = math.exp(-w)
	elif w <= 0.09:
		tmp = -1.0 / (-1.0 / l)
	else:
		tmp = 0.0
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -0.68)
		tmp = exp(Float64(-w));
	elseif (w <= 0.09)
		tmp = Float64(-1.0 / Float64(-1.0 / l));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -0.68)
		tmp = exp(-w);
	elseif (w <= 0.09)
		tmp = -1.0 / (-1.0 / l);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[w, -0.68], N[Exp[(-w)], $MachinePrecision], If[LessEqual[w, 0.09], N[(-1.0 / N[(-1.0 / l), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 3 regimes

2. if w < -0.680000000000000049

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 100.0%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]

   8. Taylor expanded in w around inf

      \[\leadsto e^{-1 \cdot w} \]
   9. Step-by-step derivation

   10. Applied rewrites 100.0%

       \[\leadsto e^{-w} \]

   if -0.680000000000000049 < w < 0.089999999999999997

   1. Initial program 99.5%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 99.5%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.2%

      \[\leadsto e^{-w} \cdot \color{blue}{{\left({\ell}^{\left(-e^{w}\right)}\right)}^{-1}} \]
   8. Step-by-step derivation

   9. Applied rewrites 99.2%

      \[\leadsto \frac{-1}{\color{blue}{{\ell}^{\left(-e^{w}\right)} \cdot \left(-e^{w}\right)}} \]

   10. Taylor expanded in w around 0

       \[\leadsto \frac{-1}{\frac{-1}{\color{blue}{\ell}}} \]
   11. Step-by-step derivation

   12. Applied rewrites 96.6%

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

   if 0.089999999999999997 < w

   1. Initial program 99.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   4. Applied rewrites 97.3%

      \[\leadsto \color{blue}{0} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 15: 88.8% accurate, 8.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -0.68:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right), w, -1\right), w, 1\right)\\ \mathbf{elif}\;w \leq 0.09:\\ \;\;\;\;\frac{-1}{\frac{-1}{\ell}}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -0.68)
   (fma (fma (fma -0.16666666666666666 w 0.5) w -1.0) w 1.0)
   (if (<= w 0.09) (/ -1.0 (/ -1.0 l)) 0.0)))

C

double code(double w, double l) {
	double tmp;
	if (w <= -0.68) {
		tmp = fma(fma(fma(-0.16666666666666666, w, 0.5), w, -1.0), w, 1.0);
	} else if (w <= 0.09) {
		tmp = -1.0 / (-1.0 / l);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -0.68)
		tmp = fma(fma(fma(-0.16666666666666666, w, 0.5), w, -1.0), w, 1.0);
	elseif (w <= 0.09)
		tmp = Float64(-1.0 / Float64(-1.0 / l));
	else
		tmp = 0.0;
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -0.68], N[(N[(N[(-0.16666666666666666 * w + 0.5), $MachinePrecision] * w + -1.0), $MachinePrecision] * w + 1.0), $MachinePrecision], If[LessEqual[w, 0.09], N[(-1.0 / N[(-1.0 / l), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 3 regimes

2. if w < -0.680000000000000049

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-pow.f64 N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(e^{w}\right)}} \]

      2. sqr-pow N/A

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

      3. pow-prod-up N/A

         \[\leadsto e^{-w} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

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

      5. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 - 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      7. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{\color{blue}{0 \cdot 0} - 0}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      8. metadata-eval N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - \color{blue}{0 \cdot 0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      9. +-inverses N/A

         \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0 + 0}}\right)} \]

      11. flip-- N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{\left(0 - 0\right)}} \]

      12. metadata-eval N/A

          \[\leadsto e^{-w} \cdot {\ell}^{\color{blue}{0}} \]

      13. metadata-eval 100.0

          \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   4. Applied rewrites 100.0%

      \[\leadsto e^{-w} \cdot \color{blue}{1} \]

   5. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1 + w \cdot \left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1\right)} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{w \cdot \left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1\right) + 1} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1\right) \cdot w} + 1 \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1, w, 1\right)} \]

      4. sub-neg N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) + \left(\mathsf{neg}\left(1\right)\right)}, w, 1\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) \cdot w} + \left(\mathsf{neg}\left(1\right)\right), w, 1\right) \]

      6. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) \cdot w + \color{blue}{-1}, w, 1\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{2} + \frac{-1}{6} \cdot w, w, -1\right)}, w, 1\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{-1}{6} \cdot w + \frac{1}{2}}, w, -1\right), w, 1\right) \]

      9. lower-fma.f64 72.5

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right)}, w, -1\right), w, 1\right) \]

   7. Applied rewrites 72.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right), w, -1\right), w, 1\right)} \]

   if -0.680000000000000049 < w < 0.089999999999999997

   1. Initial program 99.5%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(e^{w}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-to-pow N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      3. remove-double-neg N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(\log \ell \cdot e^{w}\right)\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      4. distribute-lft-neg-out N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\log \ell\right)\right) \cdot e^{w}}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      5. log-rec N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{\log \left(\frac{1}{\ell}\right)} \cdot e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      6. *-commutative N/A

         \[\leadsto e^{\mathsf{neg}\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)}\right)} \cdot e^{\mathsf{neg}\left(w\right)} \]

      7. mul-1-neg N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. +-rgt-identity N/A

         \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      9. exp-sum N/A

         \[\leadsto \color{blue}{e^{\left(-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) + 0\right) + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. +-rgt-identity N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} + \left(\mathsf{neg}\left(w\right)\right)} \]

      11. unsub-neg N/A

          \[\leadsto e^{\color{blue}{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right) - w}} \]

      12. div-exp N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}}{e^{w}}} \]

   5. Applied rewrites 99.5%

      \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.2%

      \[\leadsto e^{-w} \cdot \color{blue}{{\left({\ell}^{\left(-e^{w}\right)}\right)}^{-1}} \]
   8. Step-by-step derivation

   9. Applied rewrites 99.2%

      \[\leadsto \frac{-1}{\color{blue}{{\ell}^{\left(-e^{w}\right)} \cdot \left(-e^{w}\right)}} \]

   10. Taylor expanded in w around 0

       \[\leadsto \frac{-1}{\frac{-1}{\color{blue}{\ell}}} \]
   11. Step-by-step derivation

   12. Applied rewrites 96.6%

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

   if 0.089999999999999997 < w

   1. Initial program 99.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   4. Applied rewrites 97.3%

      \[\leadsto \color{blue}{0} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 16: 17.2% accurate, 309.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (w l) :precision binary64 0.0)

C

double code(double w, double l) {
	return 0.0;
}

Fortran

real(8) function code(w, l)
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    code = 0.0d0
end function

Java

public static double code(double w, double l) {
	return 0.0;
}

Python

def code(w, l):
	return 0.0

Julia

function code(w, l)
	return 0.0
end

MATLAB

function tmp = code(w, l)
	tmp = 0.0;
end

Wolfram

code[w_, l_] := 0.0

Derivation

1. Initial program 99.7%

   \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
2. Add Preprocessing

4. Applied rewrites 16.5%

   \[\leadsto \color{blue}{0} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024268 
(FPCore (w l)
  :name "exp-w (used to crash)"
  :precision binary64
  (* (exp (- w)) (pow l (exp w))))