Average Error: 0.0 → 0.0
Time: 457.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 r40404 = x;
        double r40405 = r40404 * r40404;
        double r40406 = 2.0;
        double r40407 = r40405 * r40406;
        double r40408 = 1.0;
        double r40409 = r40407 - r40408;
        return r40409;
}
↓
double f(double x) {
        double r40410 = x;
        double r40411 = r40410 * r40410;
        double r40412 = 2.0;
        double r40413 = r40411 * r40412;
        double r40414 = 1.0;
        double r40415 = r40413 - r40414;
        return r40415;
}

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