Average Error: 0.0 → 0.0
Time: 511.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 r43435 = x;
        double r43436 = r43435 * r43435;
        double r43437 = 2.0;
        double r43438 = r43436 * r43437;
        double r43439 = 1.0;
        double r43440 = r43438 - r43439;
        return r43440;
}
↓
double f(double x) {
        double r43441 = x;
        double r43442 = r43441 * r43441;
        double r43443 = 2.0;
        double r43444 = r43442 * r43443;
        double r43445 = 1.0;
        double r43446 = r43444 - r43445;
        return r43446;
}

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