exp-w (used to crash)

Percentage Accurate: 99.5% → 99.1%

Time: 17.7s

Alternatives: 13

Speedup: 1.0×

• Could not converge on a ground truth

  1. w = 1.2781298482104053e+71
  2. l = -1.0318392631774824e-294

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.5% 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.1% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (w l)
 :precision binary64
 (let* ((t_0 (pow l (exp w))))
   (if (<= (* t_0 (exp (- w))) 5e+303)
     (/ t_0 (fma (fma (fma 0.16666666666666666 w 0.5) w 1.0) w 1.0))
     (exp (fma (log l) (exp w) (- w))))))

C

double code(double w, double l) {
	double t_0 = pow(l, exp(w));
	double tmp;
	if ((t_0 * exp(-w)) <= 5e+303) {
		tmp = t_0 / fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0);
	} else {
		tmp = exp(fma(log(l), exp(w), -w));
	}
	return tmp;
}

Julia

function code(w, l)
	t_0 = l ^ exp(w)
	tmp = 0.0
	if (Float64(t_0 * exp(Float64(-w))) <= 5e+303)
		tmp = Float64(t_0 / fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0));
	else
		tmp = exp(fma(log(l), exp(w), Float64(-w)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w))) < 4.9999999999999997e303

   1. Initial program 99.8%

      \[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.8%

      \[\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.5%

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

   if 4.9999999999999997e303 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 98.8%

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

      \[\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)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 5 \cdot 10^{+303}:\\ \;\;\;\;\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)}\\ \mathbf{else}:\\ \;\;\;\;e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 70.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double w, double l) {
	double tmp;
	if ((pow(l, exp(w)) * exp(-w)) <= 0.0) {
		tmp = 0.0;
	} else {
		tmp = l;
	}
	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)) <= 0.0d0) then
        tmp = 0.0d0
    else
        tmp = l
    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)) <= 0.0) {
		tmp = 0.0;
	} else {
		tmp = l;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (((l ^ exp(w)) * exp(-w)) <= 0.0)
		tmp = 0.0;
	else
		tmp = l;
	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], 0.0], 0.0, l]

Derivation

1. Split input into 2 regimes

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

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

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

   1. Initial program 99.4%

      \[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.4%

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

   7. Applied rewrites 94.6%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 94.6%

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

   10. Taylor expanded in w around 0

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

   12. Applied rewrites 62.5%

       \[\leadsto \ell \]
3. Recombined 2 regimes into one program.

4. Final simplification 68.3%

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

Alternative 3: 18.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{\ell}^{\left(e^{w}\right)} \cdot e^{-w} \leq 1.1 \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.1e-154) 0.0 1.0))

C

double code(double w, double l) {
	double tmp;
	if ((pow(l, exp(w)) * exp(-w)) <= 1.1e-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.1d-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.1e-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.1e-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.1e-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.1e-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.1e-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.10000000000000004e-154

   1. Initial program 100.0%

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

   4. Applied rewrites 66.1%

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

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

   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^{-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 45.1

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

   4. Applied rewrites 45.1%

      \[\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.0%

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

4. Final simplification 20.0%

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

Alternative 4: 99.5% 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.5%

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

3. Final simplification 99.5%

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

Alternative 5: 99.3% 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. 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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-exp.f64 N/A

         \[\leadsto \color{blue}{e^{-w}} \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}{-w}} \]

      6. lift-exp.f64 100.0

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

   6. Applied rewrites 100.0%

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

   if -1.6000000000000001 < w

   1. Initial program 99.2%

      \[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.2%

      \[\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.5%

      \[\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: 99.2% 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. 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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-exp.f64 N/A

         \[\leadsto \color{blue}{e^{-w}} \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}{-w}} \]

      6. lift-exp.f64 100.0

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

   6. Applied rewrites 100.0%

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

   if -1.6000000000000001 < w

   1. Initial program 99.2%

      \[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.2%

      \[\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.5%

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

       \[\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 7: 98.9% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \leq 0.18:\\ \;\;\;\;{\ell}^{\left(1 + w\right)} \cdot \left(1 - w\right)\\ \mathbf{else}:\\ \;\;\;\;{\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, 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.18)
   (* (pow l (+ 1.0 w)) (- 1.0 w))
   (* (pow l (fma (fma 0.5 w 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.18) {
		tmp = pow(l, (1.0 + w)) * (1.0 - w);
	} else {
		tmp = pow(l, fma(fma(0.5, w, 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.18)
		tmp = Float64((l ^ Float64(1.0 + w)) * Float64(1.0 - w));
	else
		tmp = Float64((l ^ fma(fma(0.5, w, 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.18], N[(N[Power[l, N[(1.0 + w), $MachinePrecision]], $MachinePrecision] * N[(1.0 - w), $MachinePrecision]), $MachinePrecision], N[(N[Power[l, N[(N[(0.5 * w + 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.17999999999999999

   1. Initial program 99.9%

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

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

   5. Applied rewrites 74.5%

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

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

   8. Applied rewrites 99.9%

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

   if 0.17999999999999999 < l

   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}{\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 61.9

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

   5. Applied rewrites 61.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. lower-fma.f64 97.1

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

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

   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(\frac{1}{2}, w, 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(\frac{1}{2}, w, 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(\frac{1}{2}, w, 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(\frac{1}{2}, w, 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(\frac{1}{2}, w, 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(\frac{1}{2}, w, 1\right), w, 1\right)\right)} \]

       6. lower-fma.f64 98.9

          \[\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(0.5, w, 1\right), w, 1\right)\right)} \]

   11. Applied rewrites 98.9%

       \[\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(0.5, w, 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.18:\\ \;\;\;\;{\ell}^{\left(1 + w\right)} \cdot \left(1 - w\right)\\ \mathbf{else}:\\ \;\;\;\;{\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, 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 8: 97.8% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < 2.59999999999999995e-20

   1. Initial program 99.9%

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

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

   5. Applied rewrites 73.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\right)}} \]
   7. Step-by-step derivation

      1. lower-+.f64 99.9

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

   8. Applied rewrites 99.9%

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

   if 2.59999999999999995e-20 < l

   1. Initial program 99.0%

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

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

   5. Applied rewrites 64.5%

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

   9. Taylor expanded in w around 0

      \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, w, 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(0.5, w, 1\right), w, 1\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.4%

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

Alternative 9: 98.3% accurate, 2.7× speedup

Math

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

FPCore

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

C

double code(double w, double l) {
	double tmp;
	if (w <= -22000000.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 <= (-22000000.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 <= -22000000.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 <= -22000000.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 <= -22000000.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 <= -22000000.0)
		tmp = exp(-w);
	else
		tmp = 1.0 * (l ^ (1.0 + w));
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[w, -22000000.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 < -2.2e7

   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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-exp.f64 N/A

         \[\leadsto \color{blue}{e^{-w}} \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}{-w}} \]

      6. lift-exp.f64 100.0

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

   6. Applied rewrites 100.0%

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

   if -2.2e7 < w

   1. Initial program 99.2%

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

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

   5. Applied rewrites 97.1%

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

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

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

   9. Taylor expanded in w around 0

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

   11. Applied rewrites 97.8%

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

   12. Taylor expanded in w around 0

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

       1. lower-+.f64 98.9

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

   14. Applied rewrites 98.9%

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

Alternative 10: 97.6% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -0.7:\\ \;\;\;\;e^{-w}\\ \mathbf{elif}\;w \leq 33000:\\ \;\;\;\;\ell\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -0.7) (exp (- w)) (if (<= w 33000.0) l 0.0)))

C

double code(double w, double l) {
	double tmp;
	if (w <= -0.7) {
		tmp = exp(-w);
	} else if (w <= 33000.0) {
		tmp = 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.7d0)) then
        tmp = exp(-w)
    else if (w <= 33000.0d0) then
        tmp = 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.7) {
		tmp = Math.exp(-w);
	} else if (w <= 33000.0) {
		tmp = l;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -0.7:
		tmp = math.exp(-w)
	elif w <= 33000.0:
		tmp = l
	else:
		tmp = 0.0
	return tmp

Julia

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

MATLAB

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

Wolfram

code[w_, l_] := If[LessEqual[w, -0.7], N[Exp[(-w)], $MachinePrecision], If[LessEqual[w, 33000.0], l, 0.0]]

Derivation

1. Split input into 3 regimes

2. if w < -0.69999999999999996

   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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-exp.f64 N/A

         \[\leadsto \color{blue}{e^{-w}} \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}{-w}} \]

      6. lift-exp.f64 100.0

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

   6. Applied rewrites 100.0%

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

   if -0.69999999999999996 < w < 33000

   1. Initial program 99.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 99.0%

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

   7. Applied rewrites 91.4%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 91.4%

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

   10. Taylor expanded in w around 0

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

   12. Applied rewrites 96.9%

       \[\leadsto \ell \]

   if 33000 < 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: 88.6% accurate, 12.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1.45 \cdot 10^{+49}:\\ \;\;\;\;\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 33000:\\ \;\;\;\;\ell\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.45e+49)
   (fma (fma (fma -0.16666666666666666 w 0.5) w -1.0) w 1.0)
   (if (<= w 33000.0) l 0.0)))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.45e+49) {
		tmp = fma(fma(fma(-0.16666666666666666, w, 0.5), w, -1.0), w, 1.0);
	} else if (w <= 33000.0) {
		tmp = l;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.45e+49)
		tmp = fma(fma(fma(-0.16666666666666666, w, 0.5), w, -1.0), w, 1.0);
	elseif (w <= 33000.0)
		tmp = l;
	else
		tmp = 0.0;
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.45e+49], N[(N[(N[(-0.16666666666666666 * w + 0.5), $MachinePrecision] * w + -1.0), $MachinePrecision] * w + 1.0), $MachinePrecision], If[LessEqual[w, 33000.0], l, 0.0]]

Derivation

1. Split input into 3 regimes

2. if w < -1.45e49

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

   7. Applied rewrites 80.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)} \]

   if -1.45e49 < w < 33000

   1. Initial program 99.1%

      \[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.1%

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

   7. Applied rewrites 92.5%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 92.4%

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

   10. Taylor expanded in w around 0

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

   12. Applied rewrites 85.5%

       \[\leadsto \ell \]

   if 33000 < 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 12: 84.2% accurate, 16.2× speedup

Math

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

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -8.2e+69) (fma (fma 0.5 w -1.0) w 1.0) (if (<= w 33000.0) l 0.0)))

C

double code(double w, double l) {
	double tmp;
	if (w <= -8.2e+69) {
		tmp = fma(fma(0.5, w, -1.0), w, 1.0);
	} else if (w <= 33000.0) {
		tmp = l;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -8.2e+69)
		tmp = fma(fma(0.5, w, -1.0), w, 1.0);
	elseif (w <= 33000.0)
		tmp = l;
	else
		tmp = 0.0;
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -8.2e+69], N[(N[(0.5 * w + -1.0), $MachinePrecision] * w + 1.0), $MachinePrecision], If[LessEqual[w, 33000.0], l, 0.0]]

Derivation

1. Split input into 3 regimes

2. if w < -8.1999999999999998e69

   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(\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 68.0

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

   7. Applied rewrites 68.0%

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

   if -8.1999999999999998e69 < w < 33000

   1. Initial program 99.1%

      \[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.1%

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

   7. Applied rewrites 92.6%

      \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 92.6%

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

   10. Taylor expanded in w around 0

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

   12. Applied rewrites 84.0%

       \[\leadsto \ell \]

   if 33000 < 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 13: 16.6% 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.5%

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

4. Applied rewrites 18.0%

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

Reproduce

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