Average Error: 0.0 → 0.0
Time: 17.7s
Precision: 64
\[e^{-\left(1 - x \cdot x\right)}\]
\[{e}^{\left(x \cdot x - 1\right)}\]
e^{-\left(1 - x \cdot x\right)}
{e}^{\left(x \cdot x - 1\right)}
double f(double x) {
        double r27125 = 1.0;
        double r27126 = x;
        double r27127 = r27126 * r27126;
        double r27128 = r27125 - r27127;
        double r27129 = -r27128;
        double r27130 = exp(r27129);
        return r27130;
}

double f(double x) {
        double r27131 = exp(1.0);
        double r27132 = x;
        double r27133 = r27132 * r27132;
        double r27134 = 1.0;
        double r27135 = r27133 - r27134;
        double r27136 = pow(r27131, r27135);
        return r27136;
}

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 *-un-lft-identity0.0

    \[\leadsto e^{\color{blue}{1 \cdot \left(x \cdot x - 1\right)}}\]
  5. Applied exp-prod0.0

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

    \[\leadsto {\color{blue}{e}}^{\left(x \cdot x - 1\right)}\]
  7. Final simplification0.0

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

Reproduce

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