Average Error: 0.0 → 0.0
Time: 5.2s
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 r51200 = x;
        double r51201 = r51200 * r51200;
        double r51202 = 2.0;
        double r51203 = r51201 * r51202;
        double r51204 = 1.0;
        double r51205 = r51203 - r51204;
        return r51205;
}
↓
double f(double x) {
        double r51206 = x;
        double r51207 = r51206 * r51206;
        double r51208 = 2.0;
        double r51209 = r51207 * r51208;
        double r51210 = 1.0;
        double r51211 = r51209 - r51210;
        return r51211;
}

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