Average Error: 0.0 → 0.0
Time: 515.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 r40052 = x;
        double r40053 = r40052 * r40052;
        double r40054 = 2.0;
        double r40055 = r40053 * r40054;
        double r40056 = 1.0;
        double r40057 = r40055 - r40056;
        return r40057;
}
↓
double f(double x) {
        double r40058 = x;
        double r40059 = r40058 * r40058;
        double r40060 = 2.0;
        double r40061 = r40059 * r40060;
        double r40062 = 1.0;
        double r40063 = r40061 - r40062;
        return r40063;
}

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 2019352 +o rules:numerics
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  :precision binary64
  (- (* (* x x) 2) 1))