exp-w (used to crash)

Percentage Accurate: 99.5% → 99.3%

Time: 22.4s

Alternatives: 10

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.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.3% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if w < -1.6000000000000001

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. 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 l around inf 100.0%

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

      1. mul-1-neg 100.0%

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

      2. distribute-rgt-neg-in 100.0%

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

      3. log-rec 100.0%

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

      4. remove-double-neg 100.0%

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

      5. +-rgt-identity 100.0%

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

      6. exp-diff 100.0%

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

      7. +-rgt-identity 100.0%

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

      8. remove-double-neg 100.0%

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

      9. distribute-lft-neg-in 100.0%

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

      10. distribute-rgt-neg-out 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in w around inf 100.0%

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

      1. neg-mul-1 100.0%

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

   10. Simplified 100.0%

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

   if -1.6000000000000001 < w

   1. Initial program 98.4%

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

      1. exp-neg 98.4%

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

      2. remove-double-neg 98.4%

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

      3. associate-*l/ 98.4%

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

      4. *-lft-identity 98.4%

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

      5. remove-double-neg 98.4%

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

   3. Simplified 98.4%

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

   5. Taylor expanded in w around 0 99.6%

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

      1. *-commutative 99.6%

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

   7. Simplified 99.6%

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

   8. Taylor expanded in w around 0 99.6%

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

      1. *-commutative 99.6%

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

   10. Simplified 99.6%

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

Alternative 2: 99.5% 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 98.9%

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

   1. exp-neg 98.9%

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

   2. remove-double-neg 98.9%

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

   3. associate-*l/ 98.9%

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

   4. *-lft-identity 98.9%

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

   5. remove-double-neg 98.9%

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

3. Simplified 98.9%

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

Alternative 3: 98.9% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[w_, l_] := Block[{t$95$0 = N[(1.0 + N[(w * N[(1.0 + N[(w * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[w, -57000.0], 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 < -57000

   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 l around inf 100.0%

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

      1. mul-1-neg 100.0%

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

      2. distribute-rgt-neg-in 100.0%

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

      3. log-rec 100.0%

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

      4. remove-double-neg 100.0%

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

      5. +-rgt-identity 100.0%

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

      6. exp-diff 100.0%

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

      7. +-rgt-identity 100.0%

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

      8. remove-double-neg 100.0%

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

      9. distribute-lft-neg-in 100.0%

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

      10. distribute-rgt-neg-out 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in w around inf 100.0%

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

      1. neg-mul-1 100.0%

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

   10. Simplified 100.0%

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

   if -57000 < w

   1. Initial program 98.4%

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

      1. exp-neg 98.4%

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

      2. remove-double-neg 98.4%

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

      3. associate-*l/ 98.4%

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

      4. *-lft-identity 98.4%

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

      5. remove-double-neg 98.4%

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

   3. Simplified 98.4%

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

   5. Taylor expanded in w around 0 99.0%

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

      1. *-commutative 99.0%

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

   7. Simplified 99.0%

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

   8. Taylor expanded in w around 0 99.5%

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

      1. *-commutative 99.0%

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

   10. Simplified 99.5%

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

Alternative 4: 98.9% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if w < -1

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. 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 l around inf 100.0%

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

      1. mul-1-neg 100.0%

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

      2. distribute-rgt-neg-in 100.0%

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

      3. log-rec 100.0%

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

      4. remove-double-neg 100.0%

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

      5. +-rgt-identity 100.0%

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

      6. exp-diff 100.0%

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

      7. +-rgt-identity 100.0%

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

      8. remove-double-neg 100.0%

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

      9. distribute-lft-neg-in 100.0%

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

      10. distribute-rgt-neg-out 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in w around inf 100.0%

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

      1. neg-mul-1 100.0%

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

   10. Simplified 100.0%

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

   if -1 < w

   1. Initial program 98.4%

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

      1. exp-neg 98.4%

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

      2. remove-double-neg 98.4%

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

      3. associate-*l/ 98.4%

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

      4. *-lft-identity 98.4%

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

      5. remove-double-neg 98.4%

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

   3. Simplified 98.4%

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

   5. Taylor expanded in w around 0 99.6%

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

      1. *-commutative 99.6%

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

   7. Simplified 99.6%

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

   8. Taylor expanded in w around 0 99.1%

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

      1. +-commutative 99.1%

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

   10. Simplified 99.1%

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

Alternative 5: 97.5% accurate, 2.7× speedup

Math

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

FPCore

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

C

double code(double w, double l) {
	double tmp;
	if ((w <= -0.7) || !(w <= 1900000.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 <= 1900000.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 <= 1900000.0)) {
		tmp = Math.exp(-w);
	} else {
		tmp = l;
	}
	return tmp;
}

Python

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

Julia

function code(w, l)
	tmp = 0.0
	if ((w <= -0.7) || !(w <= 1900000.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 <= 1900000.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, 1900000.0]], $MachinePrecision]], N[Exp[(-w)], $MachinePrecision], l]

Derivation

1. Split input into 2 regimes

2. if w < -0.69999999999999996 or 1.9e6 < 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. Taylor expanded in l around inf 100.0%

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

      1. mul-1-neg 100.0%

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

      2. distribute-rgt-neg-in 100.0%

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

      3. log-rec 100.0%

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

      4. remove-double-neg 100.0%

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

      5. +-rgt-identity 100.0%

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

      6. exp-diff 100.0%

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

      7. +-rgt-identity 100.0%

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

      8. remove-double-neg 100.0%

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

      9. distribute-lft-neg-in 100.0%

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

      10. distribute-rgt-neg-out 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in w around inf 100.0%

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

      1. neg-mul-1 100.0%

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

   10. Simplified 100.0%

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

   if -0.69999999999999996 < w < 1.9e6

   1. Initial program 98.0%

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

      1. exp-neg 98.0%

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

      2. remove-double-neg 98.0%

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

      3. associate-*l/ 98.0%

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

      4. *-lft-identity 98.0%

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

      5. remove-double-neg 98.0%

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

   3. Simplified 98.0%

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

   5. Taylor expanded in w around 0 94.9%

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

4. Final simplification 97.2%

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

Alternative 6: 98.5% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if w < -1.02

   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 l around inf 100.0%

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

      1. mul-1-neg 100.0%

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

      2. distribute-rgt-neg-in 100.0%

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

      3. log-rec 100.0%

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

      4. remove-double-neg 100.0%

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

      5. +-rgt-identity 100.0%

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

      6. exp-diff 100.0%

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

      7. +-rgt-identity 100.0%

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

      8. remove-double-neg 100.0%

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

      9. distribute-lft-neg-in 100.0%

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

      10. distribute-rgt-neg-out 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in w around inf 100.0%

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

      1. neg-mul-1 100.0%

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

   10. Simplified 100.0%

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

   if -1.02 < w

   1. Initial program 98.4%

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

      1. exp-neg 98.4%

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

      2. remove-double-neg 98.4%

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

      3. associate-*l/ 98.4%

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

      4. *-lft-identity 98.4%

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

      5. remove-double-neg 98.4%

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

   3. Simplified 98.4%

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

   5. Taylor expanded in w around 0 98.2%

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

   6. Taylor expanded in w around 0 98.2%

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

      1. +-commutative 99.1%

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

   8. Simplified 98.2%

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

4. Final simplification 98.8%

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

Alternative 7: 75.4% accurate, 16.9× speedup

Math

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

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -2.9e+63)
   (+ 1.0 (* w (+ (* w (+ 0.5 (* w -0.16666666666666666))) -1.0)))
   l))

C

double code(double w, double l) {
	double tmp;
	if (w <= -2.9e+63) {
		tmp = 1.0 + (w * ((w * (0.5 + (w * -0.16666666666666666))) + -1.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 (w <= (-2.9d+63)) then
        tmp = 1.0d0 + (w * ((w * (0.5d0 + (w * (-0.16666666666666666d0)))) + (-1.0d0)))
    else
        tmp = l
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -2.9e+63) {
		tmp = 1.0 + (w * ((w * (0.5 + (w * -0.16666666666666666))) + -1.0));
	} else {
		tmp = l;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -2.9e+63:
		tmp = 1.0 + (w * ((w * (0.5 + (w * -0.16666666666666666))) + -1.0))
	else:
		tmp = l
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -2.9e+63)
		tmp = Float64(1.0 + Float64(w * Float64(Float64(w * Float64(0.5 + Float64(w * -0.16666666666666666))) + -1.0)));
	else
		tmp = l;
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -2.9e+63)
		tmp = 1.0 + (w * ((w * (0.5 + (w * -0.16666666666666666))) + -1.0));
	else
		tmp = l;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if w < -2.8999999999999999e63

   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 l around inf 100.0%

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

      1. mul-1-neg 100.0%

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

      2. distribute-rgt-neg-in 100.0%

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

      3. log-rec 100.0%

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

      4. remove-double-neg 100.0%

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

      5. +-rgt-identity 100.0%

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

      6. exp-diff 100.0%

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

      7. +-rgt-identity 100.0%

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

      8. remove-double-neg 100.0%

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

      9. distribute-lft-neg-in 100.0%

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

      10. distribute-rgt-neg-out 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in w around inf 100.0%

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

      1. neg-mul-1 100.0%

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

   10. Simplified 100.0%

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

   11. Taylor expanded in w around 0 80.6%

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

   if -2.8999999999999999e63 < w

   1. Initial program 98.5%

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

      1. exp-neg 98.5%

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

      2. remove-double-neg 98.5%

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

      3. associate-*l/ 98.5%

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

      4. *-lft-identity 98.5%

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

      5. remove-double-neg 98.5%

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

   3. Simplified 98.5%

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

   5. Taylor expanded in w around 0 70.9%

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

4. Final simplification 73.4%

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

Alternative 8: 70.5% accurate, 21.8× speedup

Math

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

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -2.9e+63) (+ 1.0 (* w (+ (* w 0.5) -1.0))) l))

C

double code(double w, double l) {
	double tmp;
	if (w <= -2.9e+63) {
		tmp = 1.0 + (w * ((w * 0.5) + -1.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 (w <= (-2.9d+63)) then
        tmp = 1.0d0 + (w * ((w * 0.5d0) + (-1.0d0)))
    else
        tmp = l
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -2.9e+63) {
		tmp = 1.0 + (w * ((w * 0.5) + -1.0));
	} else {
		tmp = l;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -2.9e+63:
		tmp = 1.0 + (w * ((w * 0.5) + -1.0))
	else:
		tmp = l
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -2.9e+63)
		tmp = Float64(1.0 + Float64(w * Float64(Float64(w * 0.5) + -1.0)));
	else
		tmp = l;
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -2.9e+63)
		tmp = 1.0 + (w * ((w * 0.5) + -1.0));
	else
		tmp = l;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if w < -2.8999999999999999e63

   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 l around inf 100.0%

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

      1. mul-1-neg 100.0%

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

      2. distribute-rgt-neg-in 100.0%

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

      3. log-rec 100.0%

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

      4. remove-double-neg 100.0%

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

      5. +-rgt-identity 100.0%

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

      6. exp-diff 100.0%

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

      7. +-rgt-identity 100.0%

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

      8. remove-double-neg 100.0%

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

      9. distribute-lft-neg-in 100.0%

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

      10. distribute-rgt-neg-out 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in w around inf 100.0%

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

      1. neg-mul-1 100.0%

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

   10. Simplified 100.0%

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

   11. Taylor expanded in w around 0 62.3%

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

   if -2.8999999999999999e63 < w

   1. Initial program 98.5%

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

      1. exp-neg 98.5%

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

      2. remove-double-neg 98.5%

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

      3. associate-*l/ 98.5%

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

      4. *-lft-identity 98.5%

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

      5. remove-double-neg 98.5%

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

   3. Simplified 98.5%

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

   5. Taylor expanded in w around 0 70.9%

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

4. Final simplification 68.6%

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

Alternative 9: 57.0% 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 98.9%

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

   1. exp-neg 98.9%

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

   2. remove-double-neg 98.9%

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

   3. associate-*l/ 98.9%

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

   4. *-lft-identity 98.9%

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

   5. remove-double-neg 98.9%

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

3. Simplified 98.9%

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

5. Taylor expanded in w around 0 53.3%

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

Alternative 10: 4.4% accurate, 305.0× speedup

Math

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

FPCore

(FPCore (w l) :precision binary64 1.0)

C

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

Fortran

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

Java

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

Python

def code(w, l):
	return 1.0

Julia

function code(w, l)
	return 1.0
end

MATLAB

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

Wolfram

code[w_, l_] := 1.0

Derivation

1. Initial program 98.9%

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

   1. exp-neg 98.9%

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

   2. remove-double-neg 98.9%

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

   3. associate-*l/ 98.9%

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

   4. *-lft-identity 98.9%

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

   5. remove-double-neg 98.9%

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

3. Simplified 98.9%

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

5. Taylor expanded in l around inf 94.4%

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

   1. mul-1-neg 94.4%

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

   2. distribute-rgt-neg-in 94.4%

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

   3. log-rec 94.4%

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

   4. remove-double-neg 94.4%

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

   5. +-rgt-identity 94.4%

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

   6. exp-diff 95.2%

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

   7. +-rgt-identity 95.2%

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

   8. remove-double-neg 95.2%

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

   9. distribute-lft-neg-in 95.2%

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

   10. distribute-rgt-neg-out 95.2%

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

7. Simplified 95.2%

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

8. Taylor expanded in w around inf 49.0%

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

   1. neg-mul-1 49.0%

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

10. Simplified 49.0%

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

11. Taylor expanded in w around 0 4.3%

    \[\leadsto \color{blue}{1} \]
12. Add Preprocessing

Reproduce

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