Average Error: 0.3 → 0.3
Time: 22.7s
Precision: binary64
Cost: 448
\[e^{-w} \cdot {\ell}^{\left(e^{w}\right)}\]
\[\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}\]
e^{-w} \cdot {\ell}^{\left(e^{w}\right)}
\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}
(FPCore (w l) :precision binary64 (* (exp (- w)) (pow l (exp w))))
(FPCore (w l) :precision binary64 (/ (pow l (exp w)) (exp w)))
double code(double w, double l) {
	return exp(-w) * pow(l, exp(w));
}
double code(double w, double l) {
	return pow(l, exp(w)) / exp(w);
}

Error

Bits error versus w

Bits error versus l

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs
Alternative 1
Accuracy0.3
Cost512
\[{\ell}^{\left(e^{w}\right)} \cdot e^{-w}\]

Derivation

  1. Initial program 0.3

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

    \[\leadsto \color{blue}{\frac{{\ell}^{\left(e^{w}\right)}}{e^{w}}}\]
  3. Using strategy rm
  4. Applied *-un-lft-identity_binary64_7600.3

    \[\leadsto \frac{\color{blue}{1 \cdot {\ell}^{\left(e^{w}\right)}}}{e^{w}}\]
  5. Using strategy rm
  6. Applied pow1_binary64_8210.3

    \[\leadsto \color{blue}{{\left(\frac{1 \cdot {\ell}^{\left(e^{w}\right)}}{e^{w}}\right)}^{1}}\]
  7. Final simplification0.3

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

Reproduce

herbie shell --seed 2020322 
(FPCore (w l)
  :name "exp-w crasher"
  :precision binary64
  (* (exp (- w)) (pow l (exp w))))