exp-w (used to crash)

Percentage Accurate: 99.3% → 99.3%

Time: 13.4s

Alternatives: 9

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.3% 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, 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.8%

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

Alternative 2: 99.3% 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 3: 97.4% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in w around 0 98.3%

   \[\leadsto e^{-w} \cdot \color{blue}{\ell} \]
4. Add Preprocessing

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.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.3%

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

Alternative 5: 74.8% accurate, 17.9× speedup

Math

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

FPCore

(FPCore (w l)
 :precision binary64
 (+ l (* w (- (* w (+ (* -0.16666666666666666 (* w l)) (* l 0.5))) l))))

C

double code(double w, double l) {
	return l + (w * ((w * ((-0.16666666666666666 * (w * l)) + (l * 0.5))) - l));
}

Fortran

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

Java

public static double code(double w, double l) {
	return l + (w * ((w * ((-0.16666666666666666 * (w * l)) + (l * 0.5))) - l));
}

Python

def code(w, l):
	return l + (w * ((w * ((-0.16666666666666666 * (w * l)) + (l * 0.5))) - l))

Julia

function code(w, l)
	return Float64(l + Float64(w * Float64(Float64(w * Float64(Float64(-0.16666666666666666 * Float64(w * l)) + Float64(l * 0.5))) - l)))
end

MATLAB

function tmp = code(w, l)
	tmp = l + (w * ((w * ((-0.16666666666666666 * (w * l)) + (l * 0.5))) - l));
end

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in w around 0 98.3%

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

4. Taylor expanded in w around 0 78.0%

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

5. Final simplification 78.0%

   \[\leadsto \ell + w \cdot \left(w \cdot \left(-0.16666666666666666 \cdot \left(w \cdot \ell\right) + \ell \cdot 0.5\right) - \ell\right) \]
6. Add Preprocessing

Alternative 6: 73.8% accurate, 27.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in w around 0 98.3%

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

4. Taylor expanded in w around 0 72.5%

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

5. Taylor expanded in l around 0 76.5%

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

6. Final simplification 76.5%

   \[\leadsto \ell + \ell \cdot \left(w \cdot \left(-1 + w \cdot 0.5\right)\right) \]
7. Add Preprocessing

Alternative 7: 70.6% accurate, 33.9× speedup

Math

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

FPCore

(FPCore (w l) :precision binary64 (+ l (* w (* l (* w 0.5)))))

C

double code(double w, double l) {
	return l + (w * (l * (w * 0.5)));
}

Fortran

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

Java

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

Python

def code(w, l):
	return l + (w * (l * (w * 0.5)))

Julia

function code(w, l)
	return Float64(l + Float64(w * Float64(l * Float64(w * 0.5))))
end

MATLAB

function tmp = code(w, l)
	tmp = l + (w * (l * (w * 0.5)));
end

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in w around 0 98.3%

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

4. Taylor expanded in w around 0 72.5%

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

5. Taylor expanded in w around inf 72.5%

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

   1. *-commutative 72.5%

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

   2. associate-*r* 72.5%

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

7. Simplified 72.5%

   \[\leadsto \ell + w \cdot \color{blue}{\left(\ell \cdot \left(w \cdot 0.5\right)\right)} \]
8. Add Preprocessing

Alternative 8: 63.5% 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 98.3%

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

6. Taylor expanded in w around 0 66.9%

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

   1. mul-1-neg 66.9%

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

   2. *-rgt-identity 66.9%

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

   3. distribute-rgt-neg-in 66.9%

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

   4. neg-mul-1 66.9%

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

   5. distribute-lft-in 66.9%

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

   6. neg-mul-1 66.9%

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

   7. sub-neg 66.9%

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

8. Simplified 66.9%

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

Alternative 9: 56.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. Add Preprocessing

3. Taylor expanded in w around 0 98.3%

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

4. Taylor expanded in w around 0 61.0%

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

Reproduce

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