Average Error: 0.0 → 0.0
Time: 456.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 r39365 = x;
        double r39366 = r39365 * r39365;
        double r39367 = 2.0;
        double r39368 = r39366 * r39367;
        double r39369 = 1.0;
        double r39370 = r39368 - r39369;
        return r39370;
}
↓
double f(double x) {
        double r39371 = x;
        double r39372 = r39371 * r39371;
        double r39373 = 2.0;
        double r39374 = r39372 * r39373;
        double r39375 = 1.0;
        double r39376 = r39374 - r39375;
        return r39376;
}

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