Average Error: 0.0 → 0.0
Time: 474.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 r44331 = x;
        double r44332 = r44331 * r44331;
        double r44333 = 2.0;
        double r44334 = r44332 * r44333;
        double r44335 = 1.0;
        double r44336 = r44334 - r44335;
        return r44336;
}
↓
double f(double x) {
        double r44337 = x;
        double r44338 = r44337 * r44337;
        double r44339 = 2.0;
        double r44340 = r44338 * r44339;
        double r44341 = 1.0;
        double r44342 = r44340 - r44341;
        return r44342;
}

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