exp-w (used to crash)

Percentage Accurate: 99.4% → 99.4%

Time: 31.9s

Alternatives: 6

Speedup: N/A×

• could not determine a ground truth

  1. w = 2.00000000000000007e154
  2. l = -2

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \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.8%

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

   1. exp-neg 99.8%

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

   2. remove-double-neg 99.8%

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

   3. associate-*l/ 99.8%

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

   4. *-lft-identity 99.8%

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

   5. remove-double-neg 99.8%

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

3. Simplified 99.8%

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

Alternative 2: 97.8% accurate, 2.7× speedup

Math

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

FPCore

(FPCore (w l)
 :precision binary64
 (if (or (<= w -0.7) (not (<= w 600.0))) (exp (- w)) l))

C

double code(double w, double l) {
	double tmp;
	if ((w <= -0.7) || !(w <= 600.0)) {
		tmp = exp(-w);
	} 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 ((w <= (-0.7d0)) .or. (.not. (w <= 600.0d0))) then
        tmp = exp(-w)
    else
        tmp = l
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if ((w <= -0.7) || !(w <= 600.0)) {
		tmp = Math.exp(-w);
	} else {
		tmp = l;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if (w <= -0.7) or not (w <= 600.0):
		tmp = math.exp(-w)
	else:
		tmp = l
	return tmp

Julia

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

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if ((w <= -0.7) || ~((w <= 600.0)))
		tmp = exp(-w);
	else
		tmp = l;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if w < -0.69999999999999996 or 600 < w

   1. Initial program 100.0%

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

      1. exp-neg 100.0%

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

      2. remove-double-neg 100.0%

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

      3. associate-*l/ 100.0%

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

      4. *-lft-identity 100.0%

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

      5. remove-double-neg 100.0%

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

   3. Simplified 100.0%

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

      1. add-exp-log 100.0%

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

      2. log-pow 100.0%

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

   6. Applied egg-rr 100.0%

      \[\leadsto \frac{\color{blue}{e^{e^{w} \cdot \log \ell}}}{e^{w}} \]
   7. Step-by-step derivation

      1. div-exp 100.0%

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

      2. *-commutative 100.0%

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

   8. Applied egg-rr 100.0%

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

   9. Taylor expanded in w around inf 100.0%

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

       1. neg-mul-1 100.0%

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

   11. Simplified 100.0%

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

   if -0.69999999999999996 < w < 600

   1. Initial program 99.6%

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

      1. exp-neg 99.6%

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

      2. remove-double-neg 99.6%

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

      3. associate-*l/ 99.6%

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

      4. *-lft-identity 99.6%

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

      5. remove-double-neg 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in w around 0 98.0%

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

   6. Taylor expanded in w around 0 97.1%

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

4. Final simplification 98.4%

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

Alternative 3: 97.7% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. exp-neg 99.8%

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

   2. remove-double-neg 99.8%

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

   3. associate-*l/ 99.8%

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

   4. *-lft-identity 99.8%

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

   5. remove-double-neg 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in w around 0 98.0%

   \[\leadsto \frac{\color{blue}{\ell}}{e^{w}} \]
6. Add Preprocessing

Alternative 4: 65.0% accurate, 33.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -460:\\ \;\;\;\;-\ell \cdot w\\ \mathbf{else}:\\ \;\;\;\;\ell\\ \end{array} \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (if (<= w -460.0) (- (* l w)) l))

C

double code(double w, double l) {
	double tmp;
	if (w <= -460.0) {
		tmp = -(l * w);
	} 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 (w <= (-460.0d0)) then
        tmp = -(l * w)
    else
        tmp = l
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -460.0) {
		tmp = -(l * w);
	} else {
		tmp = l;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -460.0:
		tmp = -(l * w)
	else:
		tmp = l
	return tmp

Julia

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

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -460.0)
		tmp = -(l * w);
	else
		tmp = l;
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[w, -460.0], (-N[(l * w), $MachinePrecision]), l]

Derivation

1. Split input into 2 regimes

2. if w < -460

   1. Initial program 100.0%

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

      1. exp-neg 100.0%

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

      2. remove-double-neg 100.0%

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

      3. associate-*l/ 100.0%

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

      4. *-lft-identity 100.0%

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

      5. remove-double-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in w around 0 1.8%

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

      1. add-log-exp 1.7%

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

      2. *-commutative 1.7%

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

      3. exp-to-pow 1.7%

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

   7. Applied egg-rr 1.7%

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

   8. Taylor expanded in l around inf 35.8%

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

      1. neg-mul-1 35.8%

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

   10. Simplified 35.8%

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

   11. Taylor expanded in w around inf 35.8%

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

       1. associate-*r* 35.8%

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

       2. mul-1-neg 35.8%

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

   13. Simplified 35.8%

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

   if -460 < w

   1. Initial program 99.7%

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

      1. exp-neg 99.7%

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

      2. remove-double-neg 99.7%

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

      3. associate-*l/ 99.7%

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

      4. *-lft-identity 99.7%

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

      5. remove-double-neg 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in w around 0 76.8%

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

   6. Taylor expanded in w around 0 76.5%

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

4. Final simplification 64.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -460:\\ \;\;\;\;-\ell \cdot w\\ \mathbf{else}:\\ \;\;\;\;\ell\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 64.7% accurate, 61.0× speedup

Math

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

FPCore

(FPCore (w l) :precision binary64 (* l (- 1.0 w)))

C

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

Fortran

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

Java

public static double code(double w, double l) {
	return l * (1.0 - w);
}

Python

def code(w, l):
	return l * (1.0 - w)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. exp-neg 99.8%

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

   2. remove-double-neg 99.8%

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

   3. associate-*l/ 99.8%

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

   4. *-lft-identity 99.8%

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

   5. remove-double-neg 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in w around 0 54.2%

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

   1. add-log-exp 29.2%

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

   2. *-commutative 29.2%

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

   3. exp-to-pow 29.2%

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

7. Applied egg-rr 29.2%

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

8. Taylor expanded in l around inf 64.0%

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

   1. neg-mul-1 64.0%

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

10. Simplified 64.0%

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

11. Taylor expanded in l around 0 64.0%

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

    1. mul-1-neg 64.0%

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

    2. unsub-neg 64.0%

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

13. Simplified 64.0%

    \[\leadsto \color{blue}{\ell \cdot \left(1 - w\right)} \]
14. Add Preprocessing

Alternative 6: 57.8% accurate, 305.0× speedup

Math

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

FPCore

(FPCore (w l) :precision binary64 l)

C

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

Fortran

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

Java

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

Python

def code(w, l):
	return l

Julia

function code(w, l)
	return l
end

MATLAB

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

Wolfram

code[w_, l_] := l

Derivation

1. Initial program 99.8%

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

   1. exp-neg 99.8%

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

   2. remove-double-neg 99.8%

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

   3. associate-*l/ 99.8%

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

   4. *-lft-identity 99.8%

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

   5. remove-double-neg 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in w around 0 54.2%

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

6. Taylor expanded in w around 0 54.7%

   \[\leadsto \color{blue}{\ell} \]
7. Add Preprocessing

Reproduce

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