Average Error: 0.0 → 0.0
Time: 14.9s
Precision: 64
\[e^{-\left(1 - x \cdot x\right)}\]
↓
\[e^{-1} \cdot {\left(e^{x}\right)}^{x}\]
e^{-\left(1 - x \cdot x\right)}
↓
e^{-1} \cdot {\left(e^{x}\right)}^{x}
double f(double x) {
        double r33723 = 1.0;
        double r33724 = x;
        double r33725 = r33724 * r33724;
        double r33726 = r33723 - r33725;
        double r33727 = -r33726;
        double r33728 = exp(r33727);
        return r33728;
}
↓
double f(double x) {
        double r33729 = 1.0;
        double r33730 = -r33729;
        double r33731 = exp(r33730);
        double r33732 = x;
        double r33733 = exp(r33732);
        double r33734 = pow(r33733, r33732);
        double r33735 = r33731 * r33734;
        return r33735;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{-\left(1 - x \cdot x\right)}\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto e^{-\color{blue}{\left(1 + \left(-x \cdot x\right)\right)}}\]

  4. Applied distribute-neg-in0.0

    \[\leadsto e^{\color{blue}{\left(-1\right) + \left(-\left(-x \cdot x\right)\right)}}\]

  5. Applied exp-sum0.0

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

  6. Simplified0.0

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

  7. Final simplification0.0

    \[\leadsto e^{-1} \cdot {\left(e^{x}\right)}^{x}\]

Reproduce

herbie shell --seed 2019325 +o rules:numerics
(FPCore (x)
  :name "exp neg sub"
  :precision binary64
  (exp (- (- 1 (* x x)))))