exp-w (used to crash)

Percentage Accurate: 99.4% → 99.0%

Time: 19.2s

Alternatives: 14

Speedup: 1.0×

• Could not converge on a ground truth

  1. w = -8.811290331867848e+37
  2. l = -765376083549288.6

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.0% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \leq 0.0205:\\ \;\;\;\;{\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)} \cdot \left(1 - w\right)\\ \mathbf{else}:\\ \;\;\;\;{\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(w, 0.5, 1\right), w, 1\right)\right)} \cdot \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 (<= l 0.0205)
   (*
    (pow l (fma (fma (fma 0.16666666666666666 w 0.5) w 1.0) w 1.0))
    (- 1.0 w))
   (* (pow l (fma (fma w 0.5 1.0) w 1.0)) (fma (fma 0.5 w -1.0) w 1.0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < 0.0205000000000000009

   1. Initial program 99.8%

      \[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 80.0

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

   5. Applied rewrites 80.0%

      \[\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 99.4

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

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

   if 0.0205000000000000009 < l

   1. Initial program 98.8%

      \[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 69.7

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

   5. Applied rewrites 69.7%

      \[\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. *-commutative N/A

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

      6. lower-fma.f64 97.9

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

   8. Applied rewrites 97.9%

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

   9. Taylor expanded in w around 0

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

       1. +-commutative N/A

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

       2. *-commutative N/A

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

       3. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} \cdot w - 1, w, 1\right)} \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(w, \frac{1}{2}, 1\right), w, 1\right)\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) \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(w, \frac{1}{2}, 1\right), w, 1\right)\right)} \]

       5. metadata-eval N/A

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

       6. lower-fma.f64 99.7

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

   11. Applied rewrites 99.7%

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

4. Final simplification 99.5%

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

Alternative 2: 98.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-w}\\ \mathbf{if}\;t\_0 \cdot {\ell}^{\left(e^{w}\right)} \leq 2 \cdot 10^{+305}:\\ \;\;\;\;{\ell}^{\left(1 + w\right)} \cdot \left(1 - w\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (let* ((t_0 (exp (- w))))
   (if (<= (* t_0 (pow l (exp w))) 2e+305)
     (* (pow l (+ 1.0 w)) (- 1.0 w))
     t_0)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w))) < 1.9999999999999999e305

   1. Initial program 99.6%

      \[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 99.3

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

   5. Applied rewrites 99.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. +-commutative N/A

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

      2. lower-+.f64 99.1

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

   8. Applied rewrites 99.1%

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

   if 1.9999999999999999e305 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 98.5%

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

      1. lift-pow.f64 N/A

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

      2. sqr-pow N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

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

      7. metadata-eval N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

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

      11. flip-- N/A

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

      12. metadata-eval N/A

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

      13. metadata-eval 97.0

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

   4. Applied rewrites 97.0%

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

      1. lift-*.f64 N/A

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

      2. lift-exp.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. *-rgt-identity N/A

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

      5. lift-neg.f64 N/A

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

      6. lift-exp.f64 97.0

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

   6. Applied rewrites 97.0%

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

4. Final simplification 98.5%

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

Alternative 3: 37.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \leq 10^{-154}:\\ \;\;\;\;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 (<= (* (exp (- w)) (pow l (exp w))) 1e-154)
   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 ((exp(-w) * pow(l, exp(w))) <= 1e-154) {
		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(exp(Float64(-w)) * (l ^ exp(w))) <= 1e-154)
		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[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1e-154], 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))) < 9.9999999999999997e-155

   1. Initial program 99.9%

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

   4. Applied rewrites 51.9%

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

   if 9.9999999999999997e-155 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 99.2%

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

      1. lift-pow.f64 N/A

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

      2. sqr-pow N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

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

      7. metadata-eval N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

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

      11. flip-- N/A

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

      12. metadata-eval N/A

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

      13. metadata-eval 37.3

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

   4. Applied rewrites 37.3%

      \[\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 27.8

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

      \[\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. Add Preprocessing

Alternative 4: 32.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \leq 10^{-154}:\\ \;\;\;\;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 (<= (* (exp (- w)) (pow l (exp w))) 1e-154)
   0.0
   (fma (fma 0.5 w -1.0) w 1.0)))

C

double code(double w, double l) {
	double tmp;
	if ((exp(-w) * pow(l, exp(w))) <= 1e-154) {
		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(exp(Float64(-w)) * (l ^ exp(w))) <= 1e-154)
		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[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1e-154], 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))) < 9.9999999999999997e-155

   1. Initial program 99.9%

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

   4. Applied rewrites 51.9%

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

   if 9.9999999999999997e-155 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 99.2%

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

      1. lift-pow.f64 N/A

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

      2. sqr-pow N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

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

      7. metadata-eval N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

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

      11. flip-- N/A

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

      12. metadata-eval N/A

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

      13. metadata-eval 37.3

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

   4. Applied rewrites 37.3%

      \[\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 22.3

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

   7. Applied rewrites 22.3%

      \[\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. Add Preprocessing

Alternative 5: 18.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double w, double l) {
	double tmp;
	if ((exp(-w) * pow(l, exp(w))) <= 1e-154) {
		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 ((exp(-w) * (l ** exp(w))) <= 1d-154) 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.exp(-w) * Math.pow(l, Math.exp(w))) <= 1e-154) {
		tmp = 0.0;
	} else {
		tmp = 1.0 - w;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[w_, l_] := If[LessEqual[N[(N[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1e-154], 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))) < 9.9999999999999997e-155

   1. Initial program 99.9%

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

   4. Applied rewrites 51.9%

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

   if 9.9999999999999997e-155 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 99.2%

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

      1. lift-pow.f64 N/A

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

      2. sqr-pow N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

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

      7. metadata-eval N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

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

      11. flip-- N/A

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

      12. metadata-eval N/A

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

      13. metadata-eval 37.3

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

   4. Applied rewrites 37.3%

      \[\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. Add Preprocessing

Alternative 6: 18.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double w, double l) {
	double tmp;
	if ((exp(-w) * pow(l, 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 ((exp(-w) * (l ** 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.exp(-w) * Math.pow(l, Math.exp(w))) <= 1.12e-154) {
		tmp = 0.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if (math.exp(-w) * math.pow(l, 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(exp(Float64(-w)) * (l ^ exp(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 ((exp(-w) * (l ^ 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[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $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.9%

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

   4. Applied rewrites 51.9%

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

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

   1. Initial program 99.2%

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

      1. lift-pow.f64 N/A

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

      2. sqr-pow N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

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

      7. metadata-eval N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

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

      11. flip-- N/A

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

      12. metadata-eval N/A

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

      13. metadata-eval 37.3

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

   4. Applied rewrites 37.3%

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

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

Alternative 7: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{{\ell}^{\left(e^{w}\right)}}{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(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.3%

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

3. Taylor expanded in w around 0

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

   1. *-commutative N/A

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

   2. distribute-lft-out N/A

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

   3. associate-*l* N/A

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

   4. *-commutative N/A

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

   5. distribute-rgt1-in N/A

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

   6. lower-*.f64 N/A

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

5. Applied rewrites 92.2%

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

   1. lift-*.f64 N/A

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

   2. lift-exp.f64 N/A

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

   3. lift-neg.f64 N/A

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

   4. *-commutative N/A

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

   5. exp-neg N/A

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

   6. lift-exp.f64 N/A

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

   7. un-div-inv N/A

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

   8. lower-/.f64 92.2

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

7. Applied rewrites 92.2%

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

8. Taylor expanded in w around inf

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

   1. lower-pow.f64 N/A

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

   2. lower-exp.f64 99.3

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

10. Applied rewrites 99.3%

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

Alternative 8: 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]

Derivation

1. Initial program 99.3%

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

Alternative 9: 98.8% accurate, 2.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < 0.016

   1. Initial program 99.8%

      \[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 79.8

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

   5. Applied rewrites 79.8%

      \[\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 99.4

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

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

   if 0.016 < l

   1. Initial program 98.8%

      \[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 69.9

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

   5. Applied rewrites 69.9%

      \[\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. *-commutative N/A

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

      6. lower-fma.f64 97.9

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

   8. Applied rewrites 97.9%

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

   9. Taylor expanded in w around 0

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

   11. Applied rewrites 98.8%

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

4. Final simplification 99.1%

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

Alternative 10: 97.8% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -0.225:\\ \;\;\;\;e^{-w}\\ \mathbf{elif}\;w \leq 440000000:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\log \ell, \ell, \ell\right), w, \ell\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -0.225)
   (exp (- w))
   (if (<= w 440000000.0) (fma (fma (log l) l l) w l) 0.0)))

C

double code(double w, double l) {
	double tmp;
	if (w <= -0.225) {
		tmp = exp(-w);
	} else if (w <= 440000000.0) {
		tmp = fma(fma(log(l), l, l), w, l);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -0.225)
		tmp = exp(Float64(-w));
	elseif (w <= 440000000.0)
		tmp = fma(fma(log(l), l, l), w, l);
	else
		tmp = 0.0;
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -0.225], N[Exp[(-w)], $MachinePrecision], If[LessEqual[w, 440000000.0], N[(N[(N[Log[l], $MachinePrecision] * l + l), $MachinePrecision] * w + l), $MachinePrecision], 0.0]]

Derivation

1. Split input into 3 regimes

2. if w < -0.225000000000000006

   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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(e^{w}\right)}} \]

      2. sqr-pow N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

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

      7. metadata-eval N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

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

      11. flip-- N/A

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

      12. metadata-eval N/A

          \[\leadsto e^{\mathsf{neg}\left(w\right)} \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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-exp.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. *-rgt-identity N/A

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

      5. lift-neg.f64 N/A

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

      6. lift-exp.f64 100.0

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

   6. Applied rewrites 100.0%

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

   if -0.225000000000000006 < w < 4.4e8

   1. Initial program 98.9%

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

   3. Taylor expanded in w around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-log.f64 N/A

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

      8. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\log \ell, \ell, \color{blue}{\mathsf{neg}\left(\ell\right)}\right), w, \ell\right) \]

      9. lower-neg.f64 97.4

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

   5. Applied rewrites 97.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\log \ell, \ell, -\ell\right), w, \ell\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\left(\ell \cdot \ell\right) \cdot \ell, \frac{1}{\mathsf{fma}\left(\ell, \ell, 0\right)}, \log \ell \cdot \ell\right), w, \ell\right) \]
   8. Step-by-step derivation

   9. Applied rewrites 96.9%

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

   if 4.4e8 < w

   1. Initial program 100.0%

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

   4. Applied rewrites 100.0%

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

Alternative 11: 98.7% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < 0.016

   1. Initial program 99.8%

      \[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 79.8

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

   5. Applied rewrites 79.8%

      \[\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. +-commutative N/A

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

      2. lower-+.f64 99.1

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

   8. Applied rewrites 99.1%

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

   if 0.016 < l

   1. Initial program 98.8%

      \[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 69.9

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

   5. Applied rewrites 69.9%

      \[\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. *-commutative N/A

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

      6. lower-fma.f64 97.9

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

   8. Applied rewrites 97.9%

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

   9. Taylor expanded in w around 0

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

   11. Applied rewrites 98.8%

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

4. Final simplification 99.0%

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

Alternative 12: 98.1% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-w}\\ \mathbf{if}\;w \leq -0.7:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;w \leq 1:\\ \;\;\;\;{\ell}^{1} \cdot \left(1 - w\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if w < -0.69999999999999996 or 1 < w

   1. Initial program 99.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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(e^{w}\right)}} \]

      2. sqr-pow N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

      4. flip-+ N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

      6. metadata-eval N/A

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

      7. metadata-eval N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

      10. metadata-eval N/A

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

      11. flip-- N/A

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

      12. metadata-eval N/A

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

      13. metadata-eval 98.0

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

   4. Applied rewrites 98.0%

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

      1. lift-*.f64 N/A

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

      2. lift-exp.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. *-rgt-identity N/A

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

      5. lift-neg.f64 N/A

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

      6. lift-exp.f64 98.0

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

   6. Applied rewrites 98.0%

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

   if -0.69999999999999996 < w < 1

   1. Initial program 99.6%

      \[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 99.2

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

   5. Applied rewrites 99.2%

      \[\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}{1}} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.5%

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

4. Final simplification 97.7%

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

Alternative 13: 45.3% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ e^{-w} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.3%

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

   1. lift-pow.f64 N/A

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

   2. sqr-pow N/A

      \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(\frac{e^{w}}{2} + \frac{e^{w}}{2}\right)}} \]

   4. flip-+ N/A

      \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{\color{blue}{0}}{\frac{e^{w}}{2} - \frac{e^{w}}{2}}\right)} \]

   6. metadata-eval N/A

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

   7. metadata-eval N/A

      \[\leadsto e^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \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^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\left(\frac{0 \cdot 0 - 0 \cdot 0}{\color{blue}{0}}\right)} \]

   10. metadata-eval N/A

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

   11. flip-- N/A

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

   12. metadata-eval N/A

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

   13. metadata-eval 40.7

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

4. Applied rewrites 40.7%

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

   1. lift-*.f64 N/A

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

   2. lift-exp.f64 N/A

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

   3. lift-neg.f64 N/A

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

   4. *-rgt-identity N/A

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

   5. lift-neg.f64 N/A

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

   6. lift-exp.f64 40.7

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

6. Applied rewrites 40.7%

   \[\leadsto \color{blue}{e^{-w}} \]
7. Add Preprocessing

Alternative 14: 16.5% 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.3%

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

4. Applied rewrites 15.2%

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

Reproduce

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