Average Error: 0.0 → 0.0
Time: 15.7s
Precision: 64
\[e^{-\left(1 - x \cdot x\right)}\]
↓
\[{e}^{\left(-1 + x \cdot x\right)}\]
e^{-\left(1 - x \cdot x\right)}
↓
{e}^{\left(-1 + x \cdot x\right)}
double f(double x) {
        double r1114131 = 1.0;
        double r1114132 = x;
        double r1114133 = r1114132 * r1114132;
        double r1114134 = r1114131 - r1114133;
        double r1114135 = -r1114134;
        double r1114136 = exp(r1114135);
        return r1114136;
}
↓
double f(double x) {
        double r1114137 = exp(1.0);
        double r1114138 = -1.0;
        double r1114139 = x;
        double r1114140 = r1114139 * r1114139;
        double r1114141 = r1114138 + r1114140;
        double r1114142 = pow(r1114137, r1114141);
        return r1114142;
}

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^{-1 + x \cdot x}}\]
  3. Using strategy rm

  4. Applied *-un-lft-identity0.0

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

  5. Applied exp-prod0.0

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

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

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