Average Error: 0.0 → 0.0
Time: 1.5s
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 r273 = x;
        double r274 = r273 * r273;
        double r275 = 2.0;
        double r276 = r274 * r275;
        double r277 = 1.0;
        double r278 = r276 - r277;
        return r278;
}
↓
double f(double x) {
        double r279 = x;
        double r280 = r279 * r279;
        double r281 = 2.0;
        double r282 = r280 * r281;
        double r283 = 1.0;
        double r284 = r282 - r283;
        return r284;
}

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