Average Error: 0.0 → 0.0
Time: 502.0ms
Precision: 64
\[\left(x \cdot x\right) \cdot 2 - 1\]
↓
\[\left(x \cdot x\right) \cdot 2 - 1\]
\left(x \cdot x\right) \cdot 2 - 1
↓
\left(x \cdot x\right) \cdot 2 - 1
double f(double x) {
        double r23601 = x;
        double r23602 = r23601 * r23601;
        double r23603 = 2.0;
        double r23604 = r23602 * r23603;
        double r23605 = 1.0;
        double r23606 = r23604 - r23605;
        return r23606;
}
↓
double f(double x) {
        double r23607 = x;
        double r23608 = r23607 * r23607;
        double r23609 = 2.0;
        double r23610 = r23608 * r23609;
        double r23611 = 1.0;
        double r23612 = r23610 - r23611;
        return r23612;
}

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

    \[\left(x \cdot x\right) \cdot 2 - 1\]

  2. Final simplification0.0

    \[\leadsto \left(x \cdot x\right) \cdot 2 - 1\]

Reproduce

herbie shell --seed 2019346 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  :precision binary64
  (- (* (* x x) 2) 1))