Average Error: 0.0 → 0.0
Time: 1.4s
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 r50378 = x;
        double r50379 = r50378 * r50378;
        double r50380 = 2.0;
        double r50381 = r50379 * r50380;
        double r50382 = 1.0;
        double r50383 = r50381 - r50382;
        return r50383;
}
↓
double f(double x) {
        double r50384 = x;
        double r50385 = r50384 * r50384;
        double r50386 = 2.0;
        double r50387 = r50385 * r50386;
        double r50388 = 1.0;
        double r50389 = r50387 - r50388;
        return r50389;
}

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