exp-w (used to crash)

Percentage Accurate: 99.4% → 99.4%

Time: 11.6s

Alternatives: 7

Speedup: 1.0×

• 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} \\ e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

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

2. Final simplification 99.7%

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

Alternative 2: 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.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. associate-*l/ 99.7%

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

   3. *-lft-identity 99.7%

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

3. Simplified 99.7%

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

4. Final simplification 99.7%

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

Alternative 3: 97.5% accurate, 2.9× speedup

Math

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

FPCore

(FPCore (w l)
 :precision binary64
 (if (or (<= w -0.68) (not (<= w 1.0))) (exp (- w)) (* l (- 1.0 w))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if w < -0.680000000000000049 or 1 < 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. associate-*l/ 100.0%

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

      3. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in w around 0 99.1%

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

      1. add-exp-log 99.1%

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

      2. div-exp 99.1%

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

   6. Applied egg-rr 99.1%

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

   7. Taylor expanded in w around inf 99.5%

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

      1. neg-mul-1 99.5%

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

   9. Simplified 99.5%

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

   if -0.680000000000000049 < w < 1

   1. Initial program 99.4%

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

      1. exp-neg 99.4%

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

      2. associate-*l/ 99.4%

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

      3. *-lft-identity 99.4%

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

   3. Simplified 99.4%

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

   4. Taylor expanded in w around 0 96.5%

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

   5. Taylor expanded in w around 0 96.5%

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

      1. mul-1-neg 96.5%

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

      2. unsub-neg 96.5%

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

   7. Simplified 96.5%

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

   8. Taylor expanded in l around 0 96.5%

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

4. Final simplification 97.8%

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

Alternative 4: 97.4% 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.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. associate-*l/ 99.7%

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

   3. *-lft-identity 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in w around 0 97.6%

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

5. Final simplification 97.6%

   \[\leadsto \frac{\ell}{e^{w}} \]

Alternative 5: 64.0% accurate, 50.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if w < -0.849999999999999978

   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. associate-*l/ 100.0%

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

      3. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in w around 0 98.6%

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

   5. Taylor expanded in w around 0 32.9%

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

      1. mul-1-neg 32.9%

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

      2. unsub-neg 32.9%

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

   7. Simplified 32.9%

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

   8. Taylor expanded in w around inf 32.9%

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

      1. associate-*r* 32.9%

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

      2. neg-mul-1 32.9%

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

      3. *-commutative 32.9%

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

   10. Simplified 32.9%

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

   if -0.849999999999999978 < w

   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. associate-*l/ 99.6%

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

      3. *-lft-identity 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in w around 0 97.3%

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

   5. Taylor expanded in w around 0 77.5%

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

4. Final simplification 65.7%

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

Alternative 6: 63.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.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. associate-*l/ 99.7%

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

   3. *-lft-identity 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in w around 0 97.6%

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

5. Taylor expanded in w around 0 65.5%

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

   1. mul-1-neg 65.5%

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

   2. unsub-neg 65.5%

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

7. Simplified 65.5%

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

8. Taylor expanded in l around 0 65.5%

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

9. Final simplification 65.5%

   \[\leadsto \ell \cdot \left(1 - w\right) \]

Alternative 7: 56.7% 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.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. associate-*l/ 99.7%

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

   3. *-lft-identity 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in w around 0 97.6%

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

5. Taylor expanded in w around 0 58.1%

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

6. Final simplification 58.1%

   \[\leadsto \ell \]

Reproduce

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