Average Error: 0.0 → 0.0
Time: 1.3s
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 r44389 = x;
        double r44390 = r44389 * r44389;
        double r44391 = 2.0;
        double r44392 = r44390 * r44391;
        double r44393 = 1.0;
        double r44394 = r44392 - r44393;
        return r44394;
}
↓
double f(double x) {
        double r44395 = x;
        double r44396 = r44395 * r44395;
        double r44397 = 2.0;
        double r44398 = r44396 * r44397;
        double r44399 = 1.0;
        double r44400 = r44398 - r44399;
        return r44400;
}

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