Average Error: 0.0 → 0.0
Time: 12.5s
Precision: 64
\[e^{-\left(1 - x \cdot x\right)}\]
↓
\[{\left(e^{x}\right)}^{x} \cdot e^{-1}\]
e^{-\left(1 - x \cdot x\right)}
↓
{\left(e^{x}\right)}^{x} \cdot e^{-1}
double f(double x) {
        double r28748 = 1.0;
        double r28749 = x;
        double r28750 = r28749 * r28749;
        double r28751 = r28748 - r28750;
        double r28752 = -r28751;
        double r28753 = exp(r28752);
        return r28753;
}
↓
double f(double x) {
        double r28754 = x;
        double r28755 = exp(r28754);
        double r28756 = pow(r28755, r28754);
        double r28757 = 1.0;
        double r28758 = -r28757;
        double r28759 = exp(r28758);
        double r28760 = r28756 * r28759;
        return r28760;
}

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. Simplified0.0

    \[\leadsto \color{blue}{e^{x \cdot x - 1}}\]
  3. Using strategy rm

  4. Applied sub-neg0.0

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

  5. Applied exp-sum0.0

    \[\leadsto \color{blue}{e^{x \cdot x} \cdot e^{-1}}\]

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

herbie shell --seed 2019351 
(FPCore (x)
  :name "exp neg sub"
  :precision binary64
  (exp (- (- 1 (* x x)))))