Average Error: 0.0 → 0.0
Time: 929.0ms
Precision: 64
\[\left(x \cdot x\right) \cdot 2 - 1\]
↓
\[2 \cdot \left(x \cdot x\right) - 1\]
\left(x \cdot x\right) \cdot 2 - 1
↓
2 \cdot \left(x \cdot x\right) - 1
double f(double x) {
        double r36317 = x;
        double r36318 = r36317 * r36317;
        double r36319 = 2.0;
        double r36320 = r36318 * r36319;
        double r36321 = 1.0;
        double r36322 = r36320 - r36321;
        return r36322;
}
↓
double f(double x) {
        double r36323 = 2.0;
        double r36324 = x;
        double r36325 = r36324 * r36324;
        double r36326 = r36323 * r36325;
        double r36327 = 1.0;
        double r36328 = r36326 - r36327;
        return r36328;
}

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 2 \cdot \left(x \cdot x\right) - 1\]

Reproduce

herbie shell --seed 2019195 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  (- (* (* x x) 2.0) 1.0))